QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#662680	#6443. Windblume Festival	WeCun	WA	128ms	3812kb	C++20	605b	2024-10-21 09:10:37	2024-10-21 09:10:37

Judging History

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

[2024-10-21 09:10:37]
评测

测评结果：WA
用时：128ms
内存：3812kb

查看

[2024-10-21 09:10:37]
提交

answer

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

void solve()
{
	int n;
	cin >> n;
	vector<ll> a(n);
	
	ll sum = 0;
	for(int i = 0; i < n; i++) cin >> a[i], sum += abs(a[i]);
	
	ll mi = 1e9;
	bool f1 = false, f2 = false;
	for(int i = 0; i < n; i++)
	{
		if(a[i] <= 0) f1 = true;
		if(a[i] >= 0) f2 = true;
		
		mi = min(mi, abs(a[i]));
	}
	
	if(f1 && f2) cout << sum << "\n";
	else cout << sum - 2 * mi << "\n";
}

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

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3652kb

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: 128ms

memory: 3812kb

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'