QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#596259#6695. MatchingProaesAC ✓125ms12984kbC++201.2kb2024-09-28 15:25:322024-09-28 15:25:32

Judging History

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

  • [2024-09-28 15:25:32]
  • 评测
  • 测评结果:AC
  • 用时:125ms
  • 内存:12984kb
  • [2024-09-28 15:25:32]
  • 提交

answer

/**
 *    title:  g.cpp
 *    author:  Proaes Meluam
 *    created:  2024-09-27 13:40:01
**/
#include <bits/stdc++.h>
#ifdef LOCAL
#include "algo/debug.h" 
#else
#define debug(...) 42
#endif
using namespace std;
using ll = long long;
using ull = unsigned long long;
const double pi = acos(-1);
const double E = exp(1);
constexpr ll mod = 1e9 + 7;
// constexpr int inf = 0x3f3f3f3f;
constexpr ll inf = 0x3f3f3f3f3f3f3f3f;
int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    int tt = 1;
    cin >> tt;
    while (tt--) {
        int n;
        cin >> n;
        map<ll, multiset<ll>>mp;
        for (ll i = 1; i <= n; ++ i) {
            ll ai;
            cin >> ai;
            mp[i - ai].insert(-ai);
        }
        ll ans = 0;
        for (auto [p, st] : mp) {
            int cur = 1;
            ll pre = -1;
            for (auto i : st) {
                if (cur & 1) {
                    pre = -i;
                } else { // even
                    if (-i + pre > 0) {
                        ans += -i + pre;
                    } else {
                        break;
                    }
                }
                cur ++;
            }
        }
        cout << ans << "\n";
    }
}

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

详细

Test #1:

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

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: 125ms
memory: 12984kb

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