QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#543707 | #6695. Matching | feng | WA | 54ms | 8716kb | C++20 | 1.1kb | 2024-09-01 18:37:26 | 2024-09-01 18:37:26 |
Judging History
answer
#include<bits/stdc++.h>
#define int long long
#define endl "\n"
#define PII pair<int,int>
using namespace std;
const int maxn = 1e5 + 5;
vector<int> temp[maxn];
signed main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0); std::cout.tie(0);
int T; cin >> T;
while (T--) {
int n; cin >> n;
vector<int> a(n + 1);
map<int, int> m;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
temp[i].clear();
}
int kase = 1;
for (int i = 1; i <= n; ++i) {
if (m[a[i] - i]) {
temp[m[a[i] - i]].push_back(a[i]);
}
else {
m[a[i] - i] = ++kase;
temp[kase].push_back(a[i]);
}
}
int ans = 0;
for (int i = 1; i <= kase; ++i) {
if (temp[i].size() < 2) continue;
for (int j = temp[i].size() - 1; j > 0; j -= 2) {
if (temp[i][j] + temp[i][j - 1] < 0) break;
ans += temp[i][j] + temp[i][j - 1];
}
}
cout << ans << endl;
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 3552kb
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: 54ms
memory: 8716kb
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 11 0 9 3 0 3 0 11 6 9 0 1999999989 13 1 11 7 1999999981 40 0 11 0 6 0 0 7 9 1 15 4 3 0 7 23 0 5 1999999997 0 3 5999999976 3 16 5999999943 5999999933 5 0 11 0 10 12 0 6 8 3999999982 12 0 7 0 0 3 3 0 1999999994 3999999972 1 0 16 0 0 2 7 2 0 8 0 5999999964 16 0 1 1999999995 28 0 54...
result:
wrong answer 75th numbers differ - expected: '0', found: '2'