QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #397130 | #6695. Matching | DDT | WA | 53ms | 5056kb | C++23 | 746b | 2024-04-23 17:13:24 | 2024-04-23 17:13:25 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const int INF=0x3f3f3f3f;
#define endl '\n'
#define x first
#define y second
typedef long long ll;
typedef pair<int,int> PII;
bool cmp(int a,int b)
{
return a>b;
}
void solve()
{
map<int,vector<int>> mp;
int n,ans=0;
cin>>n;
for(int i=1;i<=n;i++)
{
int x;
cin>>x;
mp[i-x].push_back(x);
}
for(auto &it : mp)
{
sort(it.y.begin(),it.y.end(),cmp);
for(int i=0;i<it.y.size();i+=2)
{
if(i+1>=it.y.size())break;
if(it.y[i]+it.y[i+1]>0)ans+=it.y[i]+it.y[i+1];
}
}
cout<<ans<<endl;
}
int main()
{
ios::sync_with_stdio(false);
ios::sync_with_stdio(0);cin.tie(0),cout.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: 3632kb
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: 53ms
memory: 5056kb
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 1705032680 3 16 1705032647 1705032637 5 0 11 0 10 12 0 6 8 -294967314 12 0 7 0 0 3 3 0 1999999994 -294967324 1 0 16 0 0 0 7 2 0 8 0 1705032668 16 0 1 1999999995 28 0 54...
result:
wrong answer 45th numbers differ - expected: '5999999976', found: '1705032680'