QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#167094#6695. Matchingucup-team1716AC ✓33ms4244kbC++20751b2023-09-07 02:59:532023-09-07 02:59:54

Judging History

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

  • [2023-09-07 02:59:54]
  • 评测
  • 测评结果:AC
  • 用时:33ms
  • 内存:4244kb
  • [2023-09-07 02:59:53]
  • 提交

answer

#include <bits/stdc++.h>
#define ll long long
#define pb push_back

using namespace std;

int main()
{
    ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);

    int t = 1;
    cin >> t;
    while(t-->0)
    {
        int n;
        cin >> n;

        vector<int> a(n);
        for(int i=0; i<n; i++) cin >> a[i];

        unordered_map<int, int> val;
        ll ans = 0;
        for(int i=n-1; i>=0; i--)
        {
            int x = a[i];

            if(x>0&&val[x-i]==0) val[x-i] = x;
            else if(val[x-i]!=0)
            {
                if(val[x-i] + x > 0) ans += val[x-i] + x;
                val.erase(x-i);
            }
        }

        cout << ans << "\n";
    }
}

这程序好像有点Bug,我给组数据试试?

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 33ms
memory: 4244kb

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