oj.uz

Submission #704635

# Submission time Handle Problem Language Result Execution time Memory
704635 2023-03-02T13:36:20 Z bebra Carnival Tickets (IOI20_tickets) C++17
100 / 100
 899 ms 77516 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;
}

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 1 ms 212 KB Output is correct
4 Correct 1 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 0 ms 212 KB Output is correct
2 Correct 1 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 21 ms 2700 KB Output is correct
6 Correct 494 ms 60396 KB Output is correct

Subtask #3
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 21 ms 2972 KB Output is correct
6 Correct 522 ms 67408 KB Output is correct
7 Correct 578 ms 70804 KB Output is correct
8 Correct 3 ms 596 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 6 ms 980 KB Output is correct
13 Correct 18 ms 2644 KB Output is correct
14 Correct 19 ms 2624 KB Output is correct
15 Correct 590 ms 72396 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 3 ms 424 KB Output is correct
5 Correct 35 ms 3328 KB Output is correct
6 Correct 5 ms 724 KB Output is correct
7 Correct 7 ms 1108 KB Output is correct
8 Correct 796 ms 75184 KB Output is correct
9 Correct 849 ms 70904 KB Output is correct
10 Correct 829 ms 70212 KB Output is correct
11 Correct 883 ms 75180 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 2 ms 468 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 3 ms 468 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 3 ms 468 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 2 ms 468 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 3 ms 468 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 3 ms 468 KB Output is correct
13 Correct 22 ms 2736 KB Output is correct
14 Correct 21 ms 2708 KB Output is correct
15 Correct 33 ms 3024 KB Output is correct
16 Correct 28 ms 3404 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 25 ms 3276 KB Output is correct
21 Correct 34 ms 3412 KB Output is correct
22 Correct 29 ms 3420 KB Output is correct
23 Correct 44 ms 3660 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 1 ms 212 KB Output is correct
4 Correct 1 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 0 ms 212 KB Output is correct
8 Correct 1 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 21 ms 2700 KB Output is correct
12 Correct 494 ms 60396 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 21 ms 2972 KB Output is correct
18 Correct 522 ms 67408 KB Output is correct
19 Correct 578 ms 70804 KB Output is correct
20 Correct 3 ms 596 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 6 ms 980 KB Output is correct
25 Correct 18 ms 2644 KB Output is correct
26 Correct 19 ms 2624 KB Output is correct
27 Correct 590 ms 72396 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 3 ms 424 KB Output is correct
32 Correct 35 ms 3328 KB Output is correct
33 Correct 5 ms 724 KB Output is correct
34 Correct 7 ms 1108 KB Output is correct
35 Correct 796 ms 75184 KB Output is correct
36 Correct 849 ms 70904 KB Output is correct
37 Correct 829 ms 70212 KB Output is correct
38 Correct 883 ms 75180 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 2 ms 468 KB Output is correct
41 Correct 3 ms 468 KB Output is correct
42 Correct 2 ms 468 KB Output is correct
43 Correct 2 ms 468 KB Output is correct
44 Correct 3 ms 468 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 2 ms 468 KB Output is correct
48 Correct 2 ms 468 KB Output is correct
49 Correct 2 ms 468 KB Output is correct
50 Correct 3 ms 468 KB Output is correct
51 Correct 22 ms 2736 KB Output is correct
52 Correct 21 ms 2708 KB Output is correct
53 Correct 33 ms 3024 KB Output is correct
54 Correct 28 ms 3404 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 25 ms 3276 KB Output is correct
59 Correct 34 ms 3412 KB Output is correct
60 Correct 29 ms 3420 KB Output is correct
61 Correct 44 ms 3660 KB Output is correct
62 Correct 65 ms 7648 KB Output is correct
63 Correct 60 ms 7640 KB Output is correct
64 Correct 105 ms 9320 KB Output is correct
65 Correct 295 ms 31016 KB Output is correct
66 Correct 373 ms 34272 KB Output is correct
67 Correct 9 ms 1216 KB Output is correct
68 Correct 6 ms 876 KB Output is correct
69 Correct 550 ms 62304 KB Output is correct
70 Correct 772 ms 69408 KB Output is correct
71 Correct 899 ms 77516 KB Output is correct
72 Correct 710 ms 75424 KB Output is correct
73 Correct 773 ms 74528 KB Output is correct
74 Correct 565 ms 68020 KB Output is correct
75 Correct 652 ms 67380 KB Output is correct