QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#688784	#6443. Windblume Festival	tsai	WA	155ms	3864kb	C++14	564b	2024-10-30 13:33:00	2024-10-30 13:33:01

Judging History

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

[2024-10-30 13:33:01]
评测

测评结果：WA
用时：155ms
内存：3864kb

查看

[2024-10-30 13:33:00]
提交

answer

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1000050;
ll a[N]={0};
void solve(){
	int n;
	scanf("%d",&n);
	ll sum=0;
	int zheng=0,fu=0;
	ll maxi=1e18;
	for(int i=1;i<=n;i++){
		scanf("%lld",&a[i]);
		sum+=abs(a[i]);
		if(a[i]>0){
			zheng++;
		}else{
			fu++;
		}
		maxi=min(maxi,abs(a[i]));
	}
	if((zheng>0&&fu==0)||(zheng==0&&fu>0)){
		cout<<sum-2*maxi;
	}else{
		cout<<sum;
	}
	return ;
}


int main(){
	int t;
	scanf("%d",&t);
	while(t--){
		solve();
		if(t) printf("\n");
	}
	return 0;
}

Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3864kb

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:

result:

ok 5 number(s): "10 713 746 779 0"

Test #2:

score: -100

Wrong Answer

time: 155ms

memory: 3836kb

input:

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'