QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#231569	#6443. Windblume Festival	sfjh	WA	316ms	3632kb	C++14	722b	2023-10-29 14:15:07	2023-10-29 14:15:07

Judging History

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

[2023-10-29 14:15:07]
评测

测评结果：WA
用时：316ms
内存：3632kb

查看

[2023-10-29 14:15:07]
提交

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;
		int sum=0;
		int mn=INF;
		fer(i,1,n){
			cin>>a[i];
			if(a[i]<0) f=1;
			sum+=abs(a[i]);
			mn=min(mn,a[i]);
		}
		if(f){
			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

源文件, 语言: C++14

詳細信息

Test #1:

score: 100

Accepted

time: 0ms

memory: 3568kb

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

memory: 3632kb

input:

output:

result:

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