QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#661239	#6443. Windblume Festival	zyq_313^#	WA	100ms	3692kb	C++14	585b	2024-10-20 15:24:30	2024-10-20 15:24:37

Judging History

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

[2024-10-20 15:24:37]
评测

测评结果：WA
用时：100ms
内存：3692kb

查看

[2024-10-20 15:24:30]
提交

answer

#include <bits/stdc++.h>

using namespace std;

#define endl '\n'
#define pii pair<int, int>
#define i64 long long

const int N = 1e6 + 10;
int a[N];
int n;
i64 sum;


void solve(){
	cin >> n;
	int z=0,f=0;
	long long  ans=0;
	for (int i = 1; i <= n; i ++){
		cin >> a[i];
		if(a[i]<0)f++;
		else z++;
		a[i]=abs(a[i]);
		ans=ans+a[i];
	}
	sort(a+1,a+n+1);
	if((z==n)||f==n){
		ans=ans-2*a[1];
	}
	cout<<ans<<endl;
	
	
	
	
	
}


int main(){
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	int t = 1;
	cin >> t;
	
	while (t --) solve();
}

Source code, Language: C++14

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:

result:

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

Test #2:

score: -100

Wrong Answer

time: 100ms

memory: 3692kb

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'