QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #572264 | #6443. Windblume Festival | ji_114514 | WA | 98ms | 3640kb | C++20 | 622b | 2024-09-18 13:22:24 | 2024-09-18 13:22:25 |
Judging History
answer
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 1e6 + 10;
int n, a[N];
void solve()
{
cin >> n;
int ok = 0;
ll res = 0, minv = 1e9 + 7;
for (int i = 1; i <= n; i++) {
cin >> a[i];
res += abs(a[i]);
minv = min(minv, llabs(a[i]));
if (a[i] >= 0)ok |= 1;
if (a[i] <= 0)ok |= 2;
}
if (ok == 3 || n == 1)cout << res << '\n';
else cout << res - 2 * minv << '\n';
}
int main()
{
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int t; cin >> t;
while (t--)solve();
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 3640kb
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: 98ms
memory: 3584kb
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 0 1 2 2 1 2 2 0 1 1 1 2 2 2 1 1 2 0 2 2 2 1 0 1 0 1 2 2 1 2 1 1 0 1 1 1 0 2 2 1 0 2 0 ...
result:
wrong answer 2nd numbers differ - expected: '-2', found: '2'