QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#418423#6695. MatchingMessywindWA 114ms5828kbC++201.0kb2024-05-23 13:50:052024-05-23 13:50:05

Judging History

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

  • [2024-05-23 13:50:05]
  • 评测
  • 测评结果:WA
  • 用时:114ms
  • 内存:5828kb
  • [2024-05-23 13:50:05]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
#define int long long

int a[N];

struct node 
{
    int val;
    int id;
}b[N];

bool cmp(node a, node b)
{
    if(b.val == a.val)
    {
        return a.id > b.id;
    }
    return a.val > b.val;
}

signed main()
{
    int T;
    cin >> T;
    while(T--)
    {
        int n;
        cin >> n;
        for (int i = 0; i < n; ++i)
        {
            cin >> a[i];
        }

        for(int i = 0; i < n; i ++)
        {
            b[i].id = i;
            b[i].val = a[i] - i;
        }

        sort(b, b + n, cmp);

        int ans = 0;
        for(int i = 0; i < n; i ++)
        {
            // cout << b[i].val << " " << b[i].id << endl;
            if(b[i].val == b[i + 1].val)
            {
                // cout <<"id"<< b[i].id << " " << b[i + 1].id << endl;
                ans += max((int)0, a[b[i].id] + a[b[i + 1].id]);
                i ++;
            }
        }
        cout << ans << endl;
    }
}

详细

Test #1:

score: 100
Accepted
time: 0ms
memory: 3636kb

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: 114ms
memory: 5828kb

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:

wrong answer 90th numbers differ - expected: '0', found: '7'