QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #497563 | #6443. Windblume Festival | Abcl | WA | 443ms | 3648kb | C++14 | 708b | 2024-07-29 13:46:33 | 2024-07-29 13:46:34 |
Judging History
answer
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=200005;
int n,ans;
int a[100005];
void solve(){
cin>>n;
ans=0;
int minl=1e9+5,maxl=-1e9-5;
for(int i=1;i<=n;i++){
cin>>a[i];
minl=min(minl,a[i]);
maxl=max(maxl,a[i]);
ans+=a[i];
}
if(minl>0&&n>1){
// cout<<minl<<endl;
ans=ans-2*minl;
}
else if(maxl<0&&n>1){
ans=-ans-2*(-maxl);
}
else {ans=0;
for(int i=1;i<=n;i++) ans+=abs(a[i]);
}
cout<<ans<<endl;
return;
}
signed main() {
//ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int t=1;
cin>>t;
while(t--){
solve();
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3648kb
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: 443ms
memory: 3576kb
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'