QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#183686 | #6695. Matching | liuzhenhao09# | AC ✓ | 66ms | 11644kb | C++14 | 647b | 2023-09-19 19:16:26 | 2023-09-19 19:16:26 |
Judging History
answer
#include<bits/stdc++.h>
#define int long long
using namespace std;
int T,n,tot = 0;
int a[100010],b[100010];
vector<int>to[100010];
map<int,int>mp;
signed main(){
scanf("%lld",&T);
while(T--){
mp.clear();
tot = 0;
scanf("%lld",&n);
for(int i = 1; i <= n; i++){
scanf("%lld",&a[i]),b[i] = a[i] - i;
if(!mp[b[i]]) mp[b[i]] = ++tot;
to[mp[b[i]]].push_back(i);
}
int sum = 0;
for(int v = 1; v <= tot; v++){
for(int i = to[v].size() - 1; i >= 1; i -= 2){
int val = a[to[v][i]] + a[to[v][i - 1]];
if(val > 0) sum += val;
}
to[v].clear();
}
printf("%lld\n",sum);
}
return 0;
}
这程序好像有点Bug,我给组数据试试?
詳細信息
Test #1:
score: 100
Accepted
time: 2ms
memory: 6256kb
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: 66ms
memory: 11644kb
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