QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #255025 | #6443. Windblume Festival | Satsuki# | WA | 102ms | 3620kb | C++17 | 478b | 2023-11-18 14:33:23 | 2023-11-18 14:33:23 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
const int N = 200010;
void solve()
{
int res = 0;
int n;cin >> n;
int mi = 1e18;
int ans = 0;
for(int i = 1;i <= n;i++)
{
int t;cin >> t;
res += t;
ans += abs(t);
mi = min(mi,t);
}
if(mi < 0)
cout << ans << endl;
else cout << res - mi * 2 << endl;
}
signed main()
{
ios::sync_with_stdio(false);cin.tie(0);
int T;cin >> T;
while(T--)solve();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3620kb
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: 102ms
memory: 3556kb
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 ...
result:
wrong answer 1st numbers differ - expected: '2', found: '-2'