oj.uz

Submission #704634

# Submission time Handle Problem Language Result Execution time Memory
704634 2023-03-02T13:35:27 Z bebra Carnival Tickets (IOI20_tickets) C++17
100 / 100
 839 ms 97288 KB 
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
 
#define dbg(x) cerr << #x << ": " << x << endl;
 
 
ll find_maximum(int k, vector<vector<int>> x) {
    int n = x.size();
    int m = x[0].size();

    vector<vector<int>> res(n, vector<int>(m, -1));
    vector<vector<int>> sign(n, vector<int>(m));
    vector<vector<int>> minus_sign(n);
    vector<vector<int>> plus_sign(n);

    priority_queue<pair<int, int>> pq;

    vector<int> first(n, k - 1);
    vector<int> last(n, m - 1);

    ll ans = 0;
    for (int i = 0; i < n; ++i) {
        pq.emplace(x[i][first[i]] + x[i][last[i]], i);
        for (int j = 0; j < k; ++j) {
            sign[i][j] = -1;
            ans -= x[i][j];
        }
    }

    for (int t = 0; t < n * k / 2; ++t) {
        auto [value, i] = pq.top();
        pq.pop();
        ans += value;

        sign[i][first[i]] = 0;
        sign[i][last[i]] = 1;

        if (first[i] > 0) {
            --first[i];
            --last[i];
            pq.emplace(x[i][first[i]] + x[i][last[i]], i);
        }
    }

    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            if (sign[i][j] == 1) plus_sign[i].push_back(j);
            else if (sign[i][j] == -1) minus_sign[i].push_back(j);
        }
    }

    for (int t = 0; t < k; ++t) {
        vector<int> p(n);
        iota(p.begin(), p.end(), 0);
        sort(p.begin(), p.end(), [&](int lhs, int rhs) {
            return plus_sign[lhs].size() < plus_sign[rhs].size();
        });

        for (int i = 0; i < n / 2; ++i) {
            res[p[i]][minus_sign[p[i]].back()] = t;
            minus_sign[p[i]].pop_back();
        }
        for (int i = n / 2; i < n; ++i) {
            res[p[i]][plus_sign[p[i]].back()] = t;
            plus_sign[p[i]].pop_back();
        }
    }
    
    allocate_tickets(res);
    return ans;
}
 
 
// int main() {
 //    int n, m, k;
 //    cin >> n >> m >> k;
 
 //    vector<vector<int>> a(n, vector<int>(m));
 //    for (int i = 0; i < n; ++i) {
 //        for (int j = 0; j < m; ++j) {
 //            cin >> a[i][j];
 //        }
 //    }
 
 //    cout << find_maximum(k, a) << '\n';
// }


/*
4 3 2
0 3 4 
0 0 2 
1 2 4 
0 4 4 

right:
15
*/

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 852 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 20 ms 2680 KB Output is correct
6 Correct 510 ms 60392 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 272 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 20 ms 3156 KB Output is correct
6 Correct 544 ms 69048 KB Output is correct
7 Correct 563 ms 72228 KB Output is correct
8 Correct 3 ms 596 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 296 KB Output is correct
12 Correct 6 ms 948 KB Output is correct
13 Correct 20 ms 2756 KB Output is correct
14 Correct 19 ms 2772 KB Output is correct
15 Correct 628 ms 76868 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 28 ms 4236 KB Output is correct
6 Correct 5 ms 852 KB Output is correct
7 Correct 7 ms 1236 KB Output is correct
8 Correct 839 ms 97028 KB Output is correct
9 Correct 753 ms 91408 KB Output is correct
10 Correct 763 ms 90700 KB Output is correct
11 Correct 832 ms 97288 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 3 ms 564 KB Output is correct
11 Correct 2 ms 436 KB Output is correct
12 Correct 3 ms 500 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 3 ms 564 KB Output is correct
11 Correct 2 ms 436 KB Output is correct
12 Correct 3 ms 500 KB Output is correct
13 Correct 24 ms 3512 KB Output is correct
14 Correct 22 ms 3592 KB Output is correct
15 Correct 34 ms 3840 KB Output is correct
16 Correct 28 ms 4260 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 3 ms 596 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 23 ms 3336 KB Output is correct
21 Correct 33 ms 3788 KB Output is correct
22 Correct 28 ms 3492 KB Output is correct
23 Correct 30 ms 4000 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 852 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 20 ms 2680 KB Output is correct
12 Correct 510 ms 60392 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 272 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 20 ms 3156 KB Output is correct
18 Correct 544 ms 69048 KB Output is correct
19 Correct 563 ms 72228 KB Output is correct
20 Correct 3 ms 596 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 ms 296 KB Output is correct
24 Correct 6 ms 948 KB Output is correct
25 Correct 20 ms 2756 KB Output is correct
26 Correct 19 ms 2772 KB Output is correct
27 Correct 628 ms 76868 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 28 ms 4236 KB Output is correct
33 Correct 5 ms 852 KB Output is correct
34 Correct 7 ms 1236 KB Output is correct
35 Correct 839 ms 97028 KB Output is correct
36 Correct 753 ms 91408 KB Output is correct
37 Correct 763 ms 90700 KB Output is correct
38 Correct 832 ms 97288 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 3 ms 468 KB Output is correct
41 Correct 2 ms 468 KB Output is correct
42 Correct 3 ms 468 KB Output is correct
43 Correct 2 ms 468 KB Output is correct
44 Correct 2 ms 468 KB Output is correct
45 Correct 1 ms 300 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 2 ms 468 KB Output is correct
48 Correct 3 ms 564 KB Output is correct
49 Correct 2 ms 436 KB Output is correct
50 Correct 3 ms 500 KB Output is correct
51 Correct 24 ms 3512 KB Output is correct
52 Correct 22 ms 3592 KB Output is correct
53 Correct 34 ms 3840 KB Output is correct
54 Correct 28 ms 4260 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 3 ms 596 KB Output is correct
57 Correct 2 ms 468 KB Output is correct
58 Correct 23 ms 3336 KB Output is correct
59 Correct 33 ms 3788 KB Output is correct
60 Correct 28 ms 3492 KB Output is correct
61 Correct 30 ms 4000 KB Output is correct
62 Correct 58 ms 9372 KB Output is correct
63 Correct 59 ms 9380 KB Output is correct
64 Correct 81 ms 10896 KB Output is correct
65 Correct 280 ms 39612 KB Output is correct
66 Correct 322 ms 42396 KB Output is correct
67 Correct 6 ms 1236 KB Output is correct
68 Correct 5 ms 924 KB Output is correct
69 Correct 546 ms 82160 KB Output is correct
70 Correct 617 ms 89084 KB Output is correct
71 Correct 801 ms 97052 KB Output is correct
72 Correct 684 ms 81396 KB Output is correct
73 Correct 754 ms 93584 KB Output is correct
74 Correct 557 ms 74012 KB Output is correct
75 Correct 700 ms 86472 KB Output is correct