QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#220463	#6443. Windblume Festival	PHarr^#	WA	129ms	3784kb	C++20	746b	2023-10-20 13:53:07	2023-10-20 13:53:08

Judging History

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

[2023-10-20 13:53:08]
评测

测评结果：WA
用时：129ms
内存：3784kb

查看

[2023-10-20 13:53:07]
提交

answer

#include <bits/stdc++.h>

using namespace std;

using ll = long long;

void solve() {
    int n;
    cin >> n;
    vector<ll> a(n);
    for (ll &i: a) cin >> i;
    int l = *min_element(a.begin(), a.end());
    int r = *max_element(a.begin(), a.end());
    if (l >= 0) {
        cout << accumulate(a.begin(), a.end(), 0ll) - 2ll * l << "\n";
        return;
    }
    if (r <= 0) {
        cout << 2ll * r - accumulate(a.begin(), a.end(), 0ll) << "\n";
        return;
    }
    ll res = 0;
    for (auto i: a)
        res += abs(i);
    cout << res << "\n";
    return;
}

int main() {
    ios::sync_with_stdio(false), cin.tie(nullptr);
    int TC;
    for (cin >> TC; TC; TC--)
        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: 3616kb

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

memory: 3784kb

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'