QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#235996#6443. Windblume Festivalucup-team1001#WA 99ms3636kbC++17959b2023-11-03 14:43:532023-11-03 14:43:54

Judging History

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

  • [2023-11-03 14:43:54]
  • 评测
  • 测评结果:WA
  • 用时:99ms
  • 内存:3636kb
  • [2023-11-03 14:43:53]
  • 提交

answer

#include "bits/stdc++.h"

using namespace std;

using ll = long long;
using ull = unsigned long long;

#define IOS ios::sync_with_stdio(0);cin.tie(0);
#define endl "\n"
#define yes cout<<"Yes"<<endl;
#define no cout<<"No"<<endl;
#define rep(i, a, b) for(int i=(a);i<(b);++i)

#define int ll

void solve() {
    int n;
    cin >> n;
    bool is_pos = true, is_neg = true;
    int sabs = 0, minx = numeric_limits<int>::max(), maxx = numeric_limits<int>::min();
    rep(i, 0, n) {
        int x;
        cin >> x;
        is_pos &= x > 0;
        is_neg &= x < 0;
        sabs += abs(x);
        minx = min(minx, x);
        maxx = max(maxx, x);
    }
    if (is_neg) {
        cout << sabs + 2 * maxx << endl;
    } else if (is_pos) {
        cout << sabs - 2 * minx << endl;
    } else {
        cout << sabs << endl;
    }
}


signed main() {
    IOS
    int t;
    cin >> t;
//    t = 1;
    while (t--)solve();
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: -100
Wrong Answer
time: 99ms
memory: 3632kb

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
...

result:

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