QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #726434 | #6695. Matching | BlueLang# | AC ✓ | 116ms | 10608kb | C++23 | 895b | 2024-11-09 00:30:12 | 2024-11-09 00:30:12 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define endl '\n'
const int N=1e6+10;
int a[N];
int cnt;
vector<int> v[N];
void solve() {
int n;
cin>>n;
for(int i=1;i<=cnt;i++) {
v[i].clear();
}
cnt=0;
for(int i=1;i<=n;i++) cin>>a[i];
map<int,int> mp;
for(int i=1;i<=n;i++) {
int x=a[i]-i;
if(!mp[x]) {
mp[x]=++cnt;
v[cnt].push_back(a[i]);
}
else {
v[mp[x]].push_back(a[i]);
}
}
for(int i=1;i<=cnt;i++) {
sort(v[i].begin(),v[i].end());
reverse(v[i].begin(),v[i].end());
// for(int j=0;j<v[i].size();j++) {
// cout<<v[i][j]
// }
}
int ans=0;
for(int i=1;i<=cnt;i++) {
for(int j=1;j<v[i].size();j+=2) {
if(v[i][j]+v[i][j-1]>0)
ans+=v[i][j]+v[i][j-1];
}
}
cout<<ans<<endl;
}
signed main()
{
int t;
cin>>t;
while(t--)
solve();
}
这程序好像有点Bug，我给组数据试试？
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 3540kb
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: 0
Accepted
time: 116ms
memory: 10608kb
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 0 7 2 0 8 0 5999999964 16 0 1 1999999995 28 0 54...
result:
ok 5504 numbers