QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#623979#6695. MatchingLmR308AC ✓49ms5672kbC++171.1kb2024-10-09 14:33:572024-10-09 14:33:57

Judging History

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

  • [2024-10-09 14:33:57]
  • 评测
  • 测评结果:AC
  • 用时:49ms
  • 内存:5672kb
  • [2024-10-09 14:33:57]
  • 提交

answer

#include <bits/stdc++.h>

using namespace std;

#define int128 __int128_t
#define int long long
#define PII pair<int, int>
#define PDD pair<double, double>
#define fi first    
#define se second
#define lowbit(x) x & -x
#define all(x) x.begin(), x.end()
#define INF 0x3f3f3f3f3f3f3f3f
#define ls(x) x << 1
#define rs(x) x << 1 | 1
#define ull unsigned long long
std::mt19937_64 rng(std::chrono::steady_clock::now().time_since_epoch().count());

const int N = 1e6 + 10, M = 5e6 + 10, mod = 998244353;
const double eps = 1e-8;

int t, n, m, k;	
string sr;

void solve() {
	cin >> n;
	map<int, vector<int>> mp;
	for (int i = 1; i <= n; i++) {
		int x;
		cin >> x;
		mp[i - x].push_back(x);
	}
	int res = 0;
	for (auto [ke, va] : mp) {
		sort(all(va));
		for (int i = va.size() - 1; i >= 1; i -= 2) {
			int te = va[i] + va[i - 1];
			if (te >= 0) res += te;
			else break;
		}
	}
	cout << res << "\n";
}

signed main() {
	cin.tie(nullptr)->sync_with_stdio(false);
	//cout.setf(ios::fixed), cout.precision(8);
	t = 1;
	cin >> t;
	while (t--) {
		solve();
	}
	return 0;
}	

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 49ms
memory: 5672kb

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