oj.uz

Submission #675492

# Submission time Handle Problem Language Result Execution time Memory
675492 2022-12-27T10:54:02 Z VodkaInTheJar Carnival Tickets (IOI20_tickets) C++14
100 / 100
 689 ms 76288 KB 
#include <bits/stdc++.h>
#include <cstdio>
#pragma GCC optimize("O3")
#define endl '\n'

using namespace std;

void allocate_tickets(vector <vector <int> > r);
long long find_maximum(int k, vector <vector <int> > x) {
    int n = (int)x.size(), m = (int)x[0].size();
    vector <int> taken(n, k);
    long long ans = 0;
    int balance = 0; 
    priority_queue <pair <int, int> > pq; 
    for (int i = 0; i < n; i++) {
        for (int j = m - k; j < m; j++)
            ans += x[i][j];

        taken[i] = k;
        balance += k; 
        pq.push({-x[i][m-k]-x[i][0], i});
    }

    while (balance > 0) {
        pair <int, int> curr = pq.top();
        pq.pop();

        ans += curr.first;
        balance -= 2; 
        taken[curr.second]--;
        if (taken[curr.second] != 0)
            pq.push({-x[curr.second][m-taken[curr.second]]-x[curr.second][k-taken[curr.second]], curr.second});
    }

    vector <vector <int> > r(n, vector <int> (m, -1));
    vector <int> cnt0(n, 0), cnt1(n, 0);
    for (int i = 0; i < k; i++) {
        vector <pair <int, int> > v;
        for (int j = 0; j < n; j++)
            v.push_back({(taken[j] - cnt1[j]) - (k - taken[j] - cnt0[j]), j});

        sort (v.begin(), v.end());
        for (int j = 0; j < n / 2; j++)
            r[v[j].second][cnt0[v[j].second]] = i, cnt0[v[j].second]++;

        for (int j = n / 2; j < n; j++)
            r[v[j].second][m-taken[v[j].second]+cnt1[v[j].second]] = i, cnt1[v[j].second]++;
    }

    allocate_tickets(r);
/*
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++)
            cout << r[i][j] << " ";

        cout << endl; 
    }
  */  

    return ans; 
}

/*
int n, m, k;
int main() {
    cin >> n >> m >> k;
    vector <vector <int> > x(n, vector <int> (m));
    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
            cin >> x[i][j];

    cout << find_maximum(k, x) << endl;
}
*/

Subtask #1
11.0 / 11.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 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 724 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 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 19 ms 2376 KB Output is correct
6 Correct 435 ms 51372 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 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 440 KB Output is correct
5 Correct 19 ms 2520 KB Output is correct
6 Correct 459 ms 56692 KB Output is correct
7 Correct 503 ms 57228 KB Output is correct
8 Correct 3 ms 468 KB Output is correct
9 Correct 0 ms 300 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 6 ms 852 KB Output is correct
13 Correct 18 ms 2136 KB Output is correct
14 Correct 17 ms 2100 KB Output is correct
15 Correct 536 ms 57776 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 0 ms 212 KB Output is correct
4 Correct 2 ms 440 KB Output is correct
5 Correct 28 ms 3272 KB Output is correct
6 Correct 5 ms 724 KB Output is correct
7 Correct 6 ms 952 KB Output is correct
8 Correct 689 ms 76096 KB Output is correct
9 Correct 659 ms 71084 KB Output is correct
10 Correct 627 ms 71064 KB Output is correct
11 Correct 689 ms 76288 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 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 444 KB Output is correct
5 Correct 2 ms 440 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 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 2 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 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 444 KB Output is correct
5 Correct 2 ms 440 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 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 2 ms 468 KB Output is correct
13 Correct 19 ms 3260 KB Output is correct
14 Correct 20 ms 3148 KB Output is correct
15 Correct 22 ms 3140 KB Output is correct
16 Correct 30 ms 3272 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 21 ms 2612 KB Output is correct
21 Correct 25 ms 3176 KB Output is correct
22 Correct 23 ms 2584 KB Output is correct
23 Correct 25 ms 3152 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 1 ms 212 KB Output is correct
3 Correct 0 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 1 ms 724 KB Output is correct
7 Correct 0 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 340 KB Output is correct
11 Correct 19 ms 2376 KB Output is correct
12 Correct 435 ms 51372 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 2 ms 440 KB Output is correct
17 Correct 19 ms 2520 KB Output is correct
18 Correct 459 ms 56692 KB Output is correct
19 Correct 503 ms 57228 KB Output is correct
20 Correct 3 ms 468 KB Output is correct
21 Correct 0 ms 300 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 6 ms 852 KB Output is correct
25 Correct 18 ms 2136 KB Output is correct
26 Correct 17 ms 2100 KB Output is correct
27 Correct 536 ms 57776 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 2 ms 440 KB Output is correct
32 Correct 28 ms 3272 KB Output is correct
33 Correct 5 ms 724 KB Output is correct
34 Correct 6 ms 952 KB Output is correct
35 Correct 689 ms 76096 KB Output is correct
36 Correct 659 ms 71084 KB Output is correct
37 Correct 627 ms 71064 KB Output is correct
38 Correct 689 ms 76288 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 2 ms 340 KB Output is correct
41 Correct 2 ms 340 KB Output is correct
42 Correct 2 ms 444 KB Output is correct
43 Correct 2 ms 440 KB Output is correct
44 Correct 2 ms 468 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 212 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 2 ms 468 KB Output is correct
51 Correct 19 ms 3260 KB Output is correct
52 Correct 20 ms 3148 KB Output is correct
53 Correct 22 ms 3140 KB Output is correct
54 Correct 30 ms 3272 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 2 ms 468 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 21 ms 2612 KB Output is correct
59 Correct 25 ms 3176 KB Output is correct
60 Correct 23 ms 2584 KB Output is correct
61 Correct 25 ms 3152 KB Output is correct
62 Correct 50 ms 8372 KB Output is correct
63 Correct 51 ms 8412 KB Output is correct
64 Correct 74 ms 8520 KB Output is correct
65 Correct 244 ms 33112 KB Output is correct
66 Correct 280 ms 33508 KB Output is correct
67 Correct 6 ms 980 KB Output is correct
68 Correct 4 ms 724 KB Output is correct
69 Correct 457 ms 73104 KB Output is correct
70 Correct 567 ms 74108 KB Output is correct
71 Correct 652 ms 75984 KB Output is correct
72 Correct 582 ms 60480 KB Output is correct
73 Correct 650 ms 73292 KB Output is correct
74 Correct 501 ms 59064 KB Output is correct
75 Correct 567 ms 71896 KB Output is correct