QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#251469#6695. MatchingZsc10014#AC ✓50ms10836kbC++171.3kb2023-11-14 19:24:562023-11-14 19:24:57

Judging History

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

  • [2023-11-14 19:24:57]
  • 评测
  • 测评结果:AC
  • 用时:50ms
  • 内存:10836kb
  • [2023-11-14 19:24:56]
  • 提交

answer

#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<cstring>
#include<set>
#include<cmath>
#include<map>
#include<vector>
using namespace std;
#define int long long

inline int read()
{
    int x=0,f=1;
    char c=getchar();
    while(c<'0'||c>'9')
    {
       if(c=='-') f=-1;
        c=getchar();
    }
    while('0'<=c&&c<='9')
    {
       x=(x<<3) +(x<<1) +(c^48);
       c=getchar();
    }
    return x*f;
}

const int maxn = 100005;
int a[maxn];
vector<int> q[maxn];
map<int,int> mp;

signed main()
{
    int T=read();
    while(T--)
    {
        mp.clear();
        int n=read();
        int cnt=0;
        for(int i=1;i<=n;++i) a[i]=read();
        int temp;
        for(int i=1;i<=n;++i)
        {
            temp = a[i]-i;
            if( mp[temp]==0 ) mp[temp]=++cnt;
            temp = mp[temp];
            q[temp].push_back(a[i]);
        }

        int ans = 0;
        for(int i=1;i<=cnt;++i)
        {
            sort(q[i].begin(),q[i].end());
            int size = q[i].size();
            for(int j=size-1;j>=0;j-=2)
            {
                if(j<=0) break;
                if(q[i][j] + q[i][j-1] > 0 ) ans += q[i][j] + q[i][j-1];
            }
            q[i].clear();
        }
        printf("%lld\n",ans);
    }
    return 0;
}

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

詳細信息

Test #1:

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

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: 50ms
memory: 10836kb

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