QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #250588 | #6443. Windblume Festival | hhoppitree# | WA | 289ms | 3552kb | C++14 | 428b | 2023-11-13 13:42:19 | 2023-11-13 13:42:20 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr),cout.tie(nullptr);
int T;
cin>>T;
while(T--)
{
int n,mn=1e9;
long long su=0;
cin>>n;
for(int i=1;i<=n;++i)
{
int x;cin>>x;
su+=abs(x),mn=min(mn,x);
}
cout<<su-2*max(mn,0)<<endl;
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3552kb
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: 289ms
memory: 3544kb
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'