QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #563378 | #6443. Windblume Festival | rxzfn639 | WA | 123ms | 3604kb | C++23 | 569b | 2024-09-14 10:41:44 | 2024-09-14 10:41:45 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
const i64 P = 998244353;
void solve() {
int n;
cin >> n;
vector<i64> a(n);
i64 sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += abs(a[i]);
}
sort(a.begin(), a.end());
if (a[0] > 0) sum -= 2ll * a[0];
else if (a.back() < 0) sum -= 2ll * abs(a.back());
cout << sum << '\n';
}
int main() {
ios::sync_with_stdio(0); cin.tie(0), cout.tie(0);
int t = 1;
cin >> t;
while(t--) solve();
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3480kb
input:
5 4 1 -3 2 -4 11 91 66 73 71 32 83 72 79 84 33 93 12 91 66 73 71 32 83 72 79 84 33 33 93 13 91 66 73 71 32 83 72 79 84 33 33 33 93 1 0
output:
10 713 746 779 0
result:
ok 5 number(s): "10 713 746 779 0"
Test #2:
score: -100
Wrong Answer
time: 123ms
memory: 3604kb
input:
1000000 1 2 1 -2 1 1 1 -1 1 2 1 1 1 2 1 -2 1 -2 1 2 1 1 1 1 1 2 1 2 1 2 1 -2 1 -2 1 0 1 2 1 1 1 -1 1 0 1 -2 1 0 1 1 1 1 1 -2 1 -2 1 2 1 1 1 2 1 1 1 1 1 0 1 2 1 0 1 -1 1 -1 1 -2 1 -2 1 0 1 -2 1 0 1 1 1 -1 1 2 1 0 1 -2 1 -2 1 0 1 1 1 -1 1 -2 1 -1 1 0 1 -1 1 -1 1 -1 1 -1 1 1 1 2 1 0 1 0 1 -2 1 2 1 2 1 ...
output:
-2 -2 -1 -1 -2 -1 -2 -2 -2 -2 -1 -1 -2 -2 -2 -2 -2 0 -2 -1 -1 0 -2 0 -1 -1 -2 -2 -2 -1 -2 -1 -1 0 -2 0 -1 -1 -2 -2 0 -2 0 -1 -1 -2 0 -2 -2 0 -1 -1 -2 -1 0 -1 -1 -1 -1 -1 -2 0 0 -2 -2 -2 -1 -2 -2 -1 -2 -1 -2 -2 -1 -1 0 -2 0 0 0 -1 -1 -2 -1 -1 0 -2 -1 -2 -1 -1 0 -1 -2 -2 -1 -1 0 -2 -2 -2 -1 0 -1 0 -1 ...
result:
wrong answer 1st numbers differ - expected: '2', found: '-2'