QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#607117#6443. Windblume FestivalS_zhi#WA 456ms3808kbC++14686b2024-10-03 13:57:292024-10-03 13:57:37

Judging History

你现在查看的是最新测评结果

  • [2024-10-03 13:57:37]
  • 评测
  • 测评结果:WA
  • 用时:456ms
  • 内存:3808kb
  • [2024-10-03 13:57:29]
  • 提交

answer

#include <iostream>
#include <vector>
#define int long long 
using namespace std ;
signed main(){
    int T ; cin >> T ; while(T --){
        int n ; cin >> n ; 
        vector<int> a(n) ;
        bool neg = false ; 
        bool pos = false ;
        for(int i = 0 ; i < n ; i ++){ cin >> a[i] ; if(a[i] <= 0) neg = true ;  if(a[i] >= 0) pos = true ;}  
        int minn = 1e9 + 10  , sum = 0 ; 
        for(int i = 0 ; i < n ; i ++) a[i] = max(a[i] , -a[i]) , minn = min(minn , a[i]) , sum += a[i]; 
        sum -= 2 * minn ; 
        if(n == 1 || (neg && pos)){ cout << sum  + 2 * minn << endl ;}
        else cout << sum << endl ; 
        
    }
    return 0 ;
}

詳細信息

Test #1:

score: 100
Accepted
time: 0ms
memory: 3808kb

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: 456ms
memory: 3572kb

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'