QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#236421#6443. Windblume FestivalstcmuyWA 172ms3620kbC++20829b2023-11-03 22:36:002023-11-03 22:36:01

Judging History

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

  • [2023-11-03 22:36:01]
  • 评测
  • 测评结果:WA
  • 用时:172ms
  • 内存:3620kb
  • [2023-11-03 22:36:00]
  • 提交

answer

#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define i64 long long
#define endl '\n'
#define lb(x) ((x) & (-x))
using namespace std;
const i64 mod = 1e18;
const int maxn = 1e3+10;
signed main()
{
    IOS;
    int t; cin >> t;
    while(t--)
    {
        int n; cin >> n;
        vector<i64> a(n+1);
        for(int i = 1; i <= n; ++i) cin >> a[i];
        sort(a.begin()+1,a.end());
        if(n == 1)
        {
            cout << a[1] << endl;
            continue;
        }
        i64 ans = 0;
        for(int i = 1; i <= n; ++i) ans += abs(a[i]);
        if(a[1] > 0)
        {
           if(n >= 4)  ans -= 2*a[1];
           else  ans -= a[1];
        }
        if(a[n] < 0) ans += a[1];
        cout << ans << endl;
    }
    return 0;
}


Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 0
Accepted
time: 126ms
memory: 3596kb

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
0
1
-2
2
1
-2
-2
0
-1
1
-1
2
-2
2
1
1
2
0
2...

result:

ok 1000000 numbers

Test #3:

score: 0
Accepted
time: 172ms
memory: 3608kb

input:

1000000
1
-182188011
1
-889401027
1
-379434063
1
-731536137
1
632523155
1
837208235
1
192807861
1
-162604370
1
963735146
1
736725265
1
-70315400
1
659481275
1
217883785
1
-396219883
1
653358757
1
-489133046
1
412498823
1
-210628961
1
-137310415
1
849916587
1
-50143945
1
-509463528
1
105005776
1
7382...

output:

-182188011
-889401027
-379434063
-731536137
632523155
837208235
192807861
-162604370
963735146
736725265
-70315400
659481275
217883785
-396219883
653358757
-489133046
412498823
-210628961
-137310415
849916587
-50143945
-509463528
105005776
738262345
352827098
391146170
108054338
601933024
-705538291...

result:

ok 1000000 numbers

Test #4:

score: -100
Wrong Answer
time: 106ms
memory: 3620kb

input:

666685
1
0
2
2 -1
1
2
1
2
1
-1
2
-2 2
1
0
2
-1 -2
2
2 -1
2
0 1
2
2 -1
1
1
2
1 1
1
1
2
0 2
2
1 0
2
0 2
2
-1 2
1
1
1
-1
1
-2
1
2
2
-1 0
2
-2 1
2
-2 -2
2
0 -1
1
-2
1
2
1
2
2
-1 -1
1
1
1
-2
1
2
2
-2 1
2
2 1
2
0 -2
1
-1
1
0
1
2
1
-2
2
2 0
1
-1
2
0 0
2
2 -2
2
-2 0
1
-2
1
1
2
2 0
1
-2
1
-1
2
1 -1
2
1 -2
2
...

output:

0
3
2
2
-1
4
0
1
3
1
3
1
1
1
2
1
2
3
1
-1
-2
2
1
3
2
1
-2
2
2
1
1
-2
2
3
2
2
-1
0
2
-2
2
-1
0
4
2
-2
1
2
-2
-1
2
3
2
-2
3
4
2
2
-2
1
2
3
3
2
2
2
1
-2
2
1
1
0
2
-1
2
0
2
2
1
2
4
1
2
4
-2
-1
3
2
1
1
1
0
-2
2
1
2
2
1
2
-2
0
2
2
2
2
-1
0
-2
2
-1
2
1
3
1
1
-1
0
1
2
2
-1
2
-1
2
0
1
-1
-1
-2
1
0
2
1
-2
2
2...

result:

wrong answer 13th numbers differ - expected: '0', found: '1'