QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#697746#6695. MatchinghuzhaoxinAC ✓44ms6508kbC++231.1kb2024-11-01 15:34:492024-11-01 15:34:50

Judging History

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

  • [2024-11-01 15:34:50]
  • 评测
  • 测评结果:AC
  • 用时:44ms
  • 内存:6508kb
  • [2024-11-01 15:34:49]
  • 提交

answer

/*
*****************************
* 作者:huzhaoxin            	*
* 努力加油,努力赚钱娶媳妇回家 	*
* 时时刻刻爱老婆            	*
*****************************
*/
#include<bits/stdc++.h>
#define all(x) x.begin(),x.end() 
#define endl "\n"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
const double eps = 1e-9;
const long long mod = 1e9 + 7;
const long long inf = 2e12 + 7;
/*---------------------------------------------------------------------------*/
void solve() {
	ll n;
	cin>>n;
	vector<ll>x(n+1);
	for(int i=1;i<=n;i++)cin>>x[i],x[i]-=i;
	map<ll,vector<ll>>mp;
	for(int i=1;i<=n;i++){
		mp[x[i]].push_back(x[i]+i);
	}
	ll res=0;
	for(auto it:mp){
		vector<ll>tmp=it.second;
		if(tmp.size()>1)
		for(int i=tmp.size()-1;i>=1;i-=2){
			if(tmp[i]+tmp[i-1]>0){
				res+=tmp[i];
				res+=tmp[i-1];
			}
		}
	}
	cout<<res<<endl;
}
/*---------------------------------------------------------------------------*/
int main() {
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	ll T;
	for (cin >> T; T; T--)
	solve();
	return 0;
}

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

详细

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: 0
Accepted
time: 44ms
memory: 6508kb

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