QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#418523 | #6695. Matching | bible_w# | WA | 47ms | 5788kb | C++20 | 915b | 2024-05-23 14:21:11 | 2024-05-23 14:21:11 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define ll long long
void solve(){
int n;
cin >> n;
vector<int> a(n);
map<int,vector<int>> mp;
for (int i = 0;i < n;i++){
cin >> a[i];
mp[i - a[i]].push_back(a[i]);
}
ll ans = 0;
for (auto [_,b] : mp){
sort(b.begin(),b.end(),greater<>());
for (int i = 0;i < b.size();i++){
if (b[i] >= 0 && i + 1 < b.size() && b[i + 1] >= 0){
ans += b[i] + b[i + 1];
i++;
}else if (b[i] >= 0 && i + 1 < b.size() && b.back() + b[i] > 0){
ans += b[i] + b.back();
i++;
}else break;
}
}
cout << ans << "\n";
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
while (t--){
solve();
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3588kb
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: 47ms
memory: 5788kb
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 0 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 0 7 2 0 8 0 5999999964 16 0 1 1999999995 28 0 54...
result:
wrong answer 6th numbers differ - expected: '1', found: '0'