QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #577805 | #6695. Matching | shiqiaqiaya# | WA | 55ms | 5164kb | C++20 | 694b | 2024-09-20 14:51:25 | 2024-09-20 14:51:26 |
Judging History
answer
#include <bits/stdc++.h>
#define int long long
using namespace std;
void solve() {
int n;
cin >> n;
vector<array<int, 2>> a(n + 1);
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
a[i] = {i - x, x};
}
sort(a.begin() + 1, a.end());
int ans = 0;
for (int i = 1; i <= n; i++) {
int j = i;
while (j + 1 <= n && a[j + 1][0] == a[i][0]) {
j++;
}
int k = i + ((j - i + 1) % 2);
for (; k <= j; k += 2) {
ans += max(0LL, a[k][1] + a[k + 1][1]);
}
i = j + 1;
}
cout << ans << "\n";
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int T;
cin >> T;
while (T--) solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3528kb
input:
3 9 3 -5 5 6 7 -1 9 1 2 3 -5 -4 -3 3 1 10 100
output:
30 0 0
result:
ok 3 number(s): "30 0 0"
Test #2:
score: -100
Wrong Answer
time: 55ms
memory: 5164kb
input:
5504 9 -1 -7 -6 -5 -4 -3 5 -1 0 5 999999995 999999993 999999995 999999995 999999995 5 3 -6 -5 -4 -2 4 -8 2 3 -5 4 -2 -1 0 1 9 -4 -9 3 -1 -1 -5 2 -3 -5 7 -1 -2 1 2 3 4 3 4 -2 5 2 -4 10 2 4 1 -3 -2 4 5 -3 0 -4 6 -1 0 1 2 4 -3 5 -4 -3 -2 -1 0 4 -1 0 1 2 8 1 0 -4 -1 0 -5 -3 -5 2 5 6 8 -4 -3 -2 -1 0 1 2 ...
output:
4 1999999988 0 5 1 1 10 0 9 3 0 3 0 11 6 9 0 1999999989 13 1 11 7 1999999981 36 0 11 0 6 0 0 7 9 0 15 4 3 0 7 20 0 5 1999999997 0 3 5999999976 3 16 1999999985 1999999972 5 0 11 0 1 11 0 6 8 3999999982 4 0 7 0 0 3 3 0 1999999994 1999999990 1 0 12 0 0 0 7 2 0 8 0 3999999975 16 0 1 1999999995 28 0 43 9...
result:
wrong answer 7th numbers differ - expected: '11', found: '10'