QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #249786 | #6443. Windblume Festival | He2717970784 | WA | 406ms | 3456kb | C++17 | 723b | 2023-11-12 15:34:07 | 2023-11-12 15:34:08 |
Judging History
answer
#include<iostream>
#include<vector>
#include<cmath>
#define int long long
using namespace std;
const int INF = 0xcf;
int solve() {
int n = 0;
cin >> n;
vector<int>a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
if (n == 1) {
return a[0];
}
int sum = 0, num = 0,val = INF;
for (int i = 0; i < n; i++) {
sum += abs(a[i]);
if (a[i] < 0) {
num++;
}
val = min(val, abs(a[i]));
}
int ans = 0;
if (num == n || (!num)) {
ans = sum - 2 * abs(val);
}
else {
ans = sum;
}
return ans;
}
signed main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int t = 0;
cin >> t;
while (t--) {
int ans = solve();
cout << ans << endl;
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 3408kb
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: 0
Accepted
time: 327ms
memory: 3452kb
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...
result:
ok 1000000 numbers
Test #3:
score: 0
Accepted
time: 406ms
memory: 3456kb
input:
1000000 1 -182188011 1 -889401027 1 -379434063 1 -731536137 1 632523155 1 837208235 1 192807861 1 -162604370 1 963735146 1 736725265 1 -70315400 1 659481275 1 217883785 1 -396219883 1 653358757 1 -489133046 1 412498823 1 -210628961 1 -137310415 1 849916587 1 -50143945 1 -509463528 1 105005776 1 7382...
output:
-182188011 -889401027 -379434063 -731536137 632523155 837208235 192807861 -162604370 963735146 736725265 -70315400 659481275 217883785 -396219883 653358757 -489133046 412498823 -210628961 -137310415 849916587 -50143945 -509463528 105005776 738262345 352827098 391146170 108054338 601933024 -705538291...
result:
ok 1000000 numbers
Test #4:
score: 0
Accepted
time: 235ms
memory: 3392kb
input:
666685 1 0 2 2 -1 1 2 1 2 1 -1 2 -2 2 1 0 2 -1 -2 2 2 -1 2 0 1 2 2 -1 1 1 2 1 1 1 1 2 0 2 2 1 0 2 0 2 2 -1 2 1 1 1 -1 1 -2 1 2 2 -1 0 2 -2 1 2 -2 -2 2 0 -1 1 -2 1 2 1 2 2 -1 -1 1 1 1 -2 1 2 2 -2 1 2 2 1 2 0 -2 1 -1 1 0 1 2 1 -2 2 2 0 1 -1 2 0 0 2 2 -2 2 -2 0 1 -2 1 1 2 2 0 1 -2 1 -1 2 1 -1 2 1 -2 2 ...
output:
0 3 2 2 -1 4 0 1 3 1 3 1 0 1 2 1 2 3 1 -1 -2 2 1 3 0 1 -2 2 2 0 1 -2 2 3 1 2 -1 0 2 -2 2 -1 0 4 2 -2 1 2 -2 -1 2 3 2 -2 3 4 2 2 -2 1 2 3 3 2 2 2 0 -2 2 1 1 0 2 -1 2 0 0 2 1 2 4 1 1 4 -2 -1 3 1 0 1 1 0 -2 2 1 2 2 1 2 -2 0 2 2 1 2 -1 0 -2 0 -1 2 0 3 1 0 -1 0 1 2 0 -1 1 -1 2 0 1 -1 -1 -2 1 0 2 1 -2 2 2...
result:
ok 666685 numbers
Test #5:
score: -100
Wrong Answer
time: 200ms
memory: 3420kb
input:
666588 1 877229937 1 -790704201 2 932859032 656440170 1 -192529503 2 94528196 817385616 1 13901525 1 340254741 1 -685072067 2 549059935 448603339 2 675680588 -933313073 2 370439701 -907173091 2 -602257809 -804844783 2 627233219 -171938196 1 -643067959 2 -525280817 -454814822 1 557964767 1 -667401143...
output:
877229937 -790704201 1589298788 -192529503 911913398 13901525 340254741 -685072067 997662860 1608993661 1277612792 1407102178 799171415 -643067959 980095225 557964767 -667401143 1369748754 596566747 1466691460 -581445120 613463693 -594232733 -641051872 1766315648 143281260 1111011274 -534042370 8545...
result:
wrong answer 3rd numbers differ - expected: '276418862', found: '1589298788'