QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#717503	#6695. Matching	mhw	AC ✓	44ms	6724kb	C++23	1.1kb	2024-11-06 18:08:55	2024-11-06 18:08:55

Judging History

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

[2024-11-06 18:08:55]
评测

测评结果：AC
用时：44ms
内存：6724kb

查看

[2024-11-06 18:08:55]
提交

answer

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int, int>
#define inf 0x3f3f3f3f
#define db double
#define il inline
#define x first
#define y second
#define endl '\n'
const int N = 2e5 + 5;
const int mod = 998244353;
int a[N];
void solve()
{
    int n;
    cin >> n;
    map<int, vector<int>> mp;
    for (int i = 1; i <= n; i++) 
    {
        cin >> a[i];
        mp[a[i] - i].push_back(i);
    }
    int ans = 0;
    for (auto [x, v]: mp)
    {
        sort(v.begin(), v.end());
        int sz = v.size();
        for (int i = sz - 1; i >= 1; i -= 2)
        {
            if (a[v[i]] + a[v[i - 1]] > 0) ans += a[v[i]] + a[v[i - 1]];
        }
    }
    cout << ans << '\n';
}
signed main()
{
    // freopen("D:\\3022244240\\vscode\\txt\\in.txt", "r", stdin);
    // freopen("D:\\3022244240\\vscode\\txt\\out.txt", "w", stdout);
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    int T = 1;
    cin >> T;
    while (T--) solve();
    return 0;
}

/*
3
9
3 -5 5 6 7 -1 9 1 2
3
-5 -4 -3
3
1 10 100
*/

源文件, 语言: C++23

这程序好像有点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: 44ms

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:

result:

ok 5504 numbers