QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#622001#6443. Windblume FestivalKXDdesuWA 115ms3684kbC++23890b2024-10-08 19:21:012024-10-08 19:21:02

Judging History

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

  • [2024-10-08 19:21:02]
  • 评测
  • 测评结果:WA
  • 用时:115ms
  • 内存:3684kb
  • [2024-10-08 19:21:01]
  • 提交

answer

#include<bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define lowbit(x) ((x) & (-x))
using i64 = long long;
using pii = std::pair<int, int>;
void solve()
{
    int n;
    std::cin >> n;
    std::vector<int> a(n);
    for (int i = 0; i < n; i ++) {
        std::cin >> a[i];
    }
    bool ok = false;
    for (int i = 0; i < n; i ++) {
        if (a[i] < 0) {
            ok = true;
            break;
        }
    }
    i64 sum = 0;
    for (int i = 0; i < n; i ++) {
        sum += std::abs(a[i]);
    } 
    if (!ok) {
        int min = *min_element(all(a));
        sum -= 2 * min;
    }
    std::cout << sum << '\n';
}
int main()
{
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);
    std::ios::sync_with_stdio(false);
    int T = 1;
    std::cin >> T;
    while (T --) solve();
    return 0;
}

详细

Test #1:

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

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: 115ms
memory: 3684kb

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

result:

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