QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#178001#6695. Matchingvalue0#RE 1ms3688kbC++20695b2023-09-13 17:07:372023-09-13 17:07:37

Judging History

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

  • [2023-09-13 17:07:37]
  • 评测
  • 测评结果:RE
  • 用时:1ms
  • 内存:3688kb
  • [2023-09-13 17:07:37]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<ll,ll> pii;
#define fi first
#define se second
int n,m,k;
void solve()
{
	scanf("%d",&n);
	vector<int> a(n + 1);
	map<int,vector<ll>> q;
	for(int i = 1;i<=n;i++)
	{
		scanf("%d",&a[i]);
		int res = a[i] - i;
		q[res].push_back(a[i]);
	}
	ll ans = 0;
	for(auto &t : q)
	{
		vector<ll> &v = t.se;
		sort(v.begin(),v.end());
		for(int i = v.size()-1;i;i--)
		{
			ll a = v[i];
			ll b = v[i-1];
			if(a + b > 0)
			{
				ans += a + b;
				i --;
			}
		}
	}
	printf("%lld\n",ans);
	
}

int main()
{
	int t = 1;
	scanf("%d",&t);
	while(t--)
	{
		solve();
	}
	return 0;
	
}

详细

Test #1:

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

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
Runtime Error

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:


result: