QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#231577#6443. Windblume FestivalsfjhWA 319ms3612kbC++14793b2023-10-29 14:21:292023-10-29 14:21:29

Judging History

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

  • [2023-10-29 14:21:29]
  • 评测
  • 测评结果:WA
  • 用时:319ms
  • 内存:3612kb
  • [2023-10-29 14:21:29]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fer(i,a,b) for(int i=a;i<=b;i++)
#define fdr(i,a,b) for(int i=a;i>=b;i--)
const int N=1e6+10; 
const int INF=1e9+10;

int n;
int a[N];
signed main(){
	ios::sync_with_stdio(0);cin.tie(0),cout.tie(0);
	int t;
	cin>>t;
	while(t--){
		cin>>n;
		int f=0,ff=0;
		int sum=0;
		int mn=INF;
		fer(i,1,n){
			cin>>a[i];
			if(a[i]<0) f=1;
			if(a[i]>=0) ff=1;
			sum+=abs(a[i]);
			mn=min(mn,abs(a[i]));
		}
		if(f){
			if(!ff) cout<<sum-2*mn<<endl;
			else cout<<sum<<endl;
		}
		else{
			cout<<sum-2*mn<<endl;
		}
	}		
}


//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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 319ms
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
...

result:

wrong answer 1st numbers differ - expected: '2', found: '-2'