QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#364020#6695. Matchingwudibaolong#AC ✓64ms6724kbC++14647b2024-03-24 10:07:492024-03-24 10:07:49

Judging History

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

  • [2024-03-24 10:07:49]
  • 评测
  • 测评结果:AC
  • 用时:64ms
  • 内存:6724kb
  • [2024-03-24 10:07:49]
  • 提交

answer

#include <bits/stdc++.h>
#define int long long
using namespace std;

const int N = 1e5 + 5;

int a[N] = {0};

void solve() {
	int n;
	cin >> n;
	for (int i = 1; i <= n; ++i) cin >> a[i], a[i] -= i;
	map<int,priority_queue<int>> m;
	for (int i = 1; i <= n; ++i) m[a[i]].push(a[i] + i);
	int ans = 0;
	for (auto x:m) {
		auto& t = x.second;
		while (t.size() >= 2) {
			int aa = t.top();
			t.pop();
			int bb = t.top();
			t.pop();
			if (aa + bb < 0) break;
			ans += aa + bb;
		}
	}
	cout << ans << '\n';
}

signed main() {
	ios::sync_with_stdio(false), cin.tie(nullptr);
	int T; cin >> T;
	while (T--) solve();
}

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

詳細信息

Test #1:

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

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: 64ms
memory: 6724kb

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