QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #789942 | #6695. Matching | Nlll# | WA | 40ms | 4688kb | C++17 | 677b | 2024-11-27 23:02:09 | 2024-11-27 23:02:10 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
unordered_map<ll, ll> mp;
void solve()
{
int n;
cin >> n;
vector<ll> a(n + 1);
for(int i = 1; i <= n; i++)
{
cin >> a[i];
}
ll ans = 0;
for(int i = n; i; i--)
{
ll x = a[i] - i;
if(mp.count(x))
{
if(mp[x] + a[i] > 0)
{
ans += mp[x] + a[i];
}
mp.erase(x);
}
else mp[x] = a[i];
}
cout << ans << "\n";
}
int main()
{
cin.tie(0)->sync_with_stdio(false);
int T;
cin >> T;
while(T--) solve();
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3616kb
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: 40ms
memory: 4688kb
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 16 9 0 3 4 11 6 9 6 5999999969 11 2 11 7 1999999981 39 0 20 8 6 5 0 7 20 1 15 4 3 0 7 30 0 7 1999999997 0 1 7999999964 4 17 9999999912 11999999873 10 13 11 0 9 9 0 6 10 3999999982 14 3 10 0 8 3 3 8 3999999982 7999999941 1 5 16 10 0 0 8 5 8 19 0 7999999950 25 0 0 1999999995 ...
result:
wrong answer 9th numbers differ - expected: '9', found: '16'