QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#333892#6695. MatchingpiaoyunWA 55ms6100kbC++17837b2024-02-20 18:58:012024-02-20 18:58:01

Judging History

你现在查看的是最新测评结果

  • [2024-02-20 18:58:01]
  • 评测
  • 测评结果:WA
  • 用时:55ms
  • 内存:6100kb
  • [2024-02-20 18:58:01]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int MAXN = 1e6 + 10;
int N,M,K,Q;
int a[MAXN];

int tot = 0;
map<int,int> mp;

int get(int x){
    if(int ret = mp[x]) return ret;
    return mp[x] = ++tot;
}

pair<int,int> b[MAXN];

void prepare(){
    scanf("%lld",&N);
    for(int i = 1;i <= N; i++) scanf("%lld",&a[i]);
    for(int i = 1;i <= N; i++){
        b[i].first = a[i] - i;
        b[i].second = -a[i];
    }
    sort(b+1,b+1+N);
    int ans = 0;
    for(int i = 1;i <= N; i++){
        if(b[i].first == b[i+1].first){
            if(b[i].second + b[i+1].second <= 0) ans -= b[i].second + b[i+1].second;
            i++;
        }
    }
    printf("%lld\n",ans);
}

signed main(){
    int T = 1;
    scanf("%lld",&T);
    while(T--){
        prepare();
    }
}

详细

Test #1:

score: 100
Accepted
time: 1ms
memory: 3948kb

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: 55ms
memory: 6100kb

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
4
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
16
1
15
4
3
0
7
23
0
5
1999999997
0
3
5999999976
3
16
5999999943
5999999933
5
0
15
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
5...

result:

wrong answer 6th numbers differ - expected: '1', found: '4'