oj.uz

Submission #622824

# Submission time Handle Problem Language Result Execution time Memory
622824 2022-08-04T15:49:10 Z someone Carnival Tickets (IOI20_tickets) C++14
100 / 100
 858 ms 97048 KB 
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

ll find_maximum(int k, vector<vector<int>> x) {
    ll n = x.size(), m = x[0].size(),
       sum = 0, need = k*n/2, id[n];

    int chosen[n][m];
    for(int i = 0; i < n; i++)
        for(int j = 0; j < m; j++)
            chosen[i][j] = 0;
    vector<vector<int>> s(n);
    priority_queue<pair<ll, ll>> change;
    for(int i = 0; i < n; i++) {
        id[i] = m-k;
        s[i].resize(m);
        sort(x[i].begin(), x[i].end());
        for(int j = 0; j < m; j++)
            s[i][j] = -1;
        for(int j = id[i]; j < m; j++) {
            sum += x[i][j];
            chosen[i][j] = 1;
        }
        change.push({- x[i][0] - x[i][m-k], i});
    }
    while(need--) {
        pair<ll, ll> pii = change.top();
        change.pop();
        sum += pii.first;
        ll lig = pii.second, rempl = id[lig] - (m-k);

        chosen[lig][rempl] = -1;
        if(rempl != id[lig])
            chosen[lig][id[lig]] = 0;

        id[lig]++;
        if(id[lig] < m)
            change.push({- x[lig][id[lig] - (m-k)] - x[lig][id[lig]], lig});
    }
    vector<int> inf[n], sup[n];
    for(int i = 0; i < n; i++)
        for(int j = 0; j < m; j++)
            if(chosen[i][j] == 1)
                sup[i].push_back(j);
            else if(chosen[i][j] == -1)
                inf[i].push_back(j);
    int mid = n/2;
    for(int i = 0; i < k; i++) {
        pair<int, int> iLig[n];
        for(int j = 0; j < n; j++)
            iLig[j] = {sup[j].size(), j};
        sort(iLig, iLig + n);
        for(int j = 0; j < mid; j++) {
            int lig = iLig[j].second;
            s[lig][inf[lig].back()] = i;
            inf[lig].pop_back();
        }
        for(int j = mid; j < n; j++) {
            int lig = iLig[j].second;
            s[lig][sup[lig].back()] = i;
            sup[lig].pop_back();
        }
    }
    allocate_tickets(s);
    return sum;
}

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 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 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 24 ms 2644 KB Output is correct
6 Correct 567 ms 60360 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 1 ms 212 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 21 ms 3200 KB Output is correct
6 Correct 538 ms 71788 KB Output is correct
7 Correct 586 ms 75084 KB Output is correct
8 Correct 4 ms 596 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 5 ms 980 KB Output is correct
13 Correct 18 ms 2764 KB Output is correct
14 Correct 17 ms 2772 KB Output is correct
15 Correct 588 ms 76788 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 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 3 ms 568 KB Output is correct
5 Correct 28 ms 4276 KB Output is correct
6 Correct 5 ms 936 KB Output is correct
7 Correct 6 ms 1208 KB Output is correct
8 Correct 813 ms 97048 KB Output is correct
9 Correct 790 ms 91464 KB Output is correct
10 Correct 781 ms 90596 KB Output is correct
11 Correct 858 ms 97040 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 2 ms 496 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 308 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 496 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 3 ms 564 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 2 ms 496 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 308 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 496 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 3 ms 564 KB Output is correct
13 Correct 24 ms 3596 KB Output is correct
14 Correct 23 ms 3632 KB Output is correct
15 Correct 26 ms 3912 KB Output is correct
16 Correct 37 ms 4268 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 3288 KB Output is correct
21 Correct 27 ms 3860 KB Output is correct
22 Correct 27 ms 3404 KB Output is correct
23 Correct 30 ms 3944 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 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 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 24 ms 2644 KB Output is correct
12 Correct 567 ms 60360 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 21 ms 3200 KB Output is correct
18 Correct 538 ms 71788 KB Output is correct
19 Correct 586 ms 75084 KB Output is correct
20 Correct 4 ms 596 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 300 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 5 ms 980 KB Output is correct
25 Correct 18 ms 2764 KB Output is correct
26 Correct 17 ms 2772 KB Output is correct
27 Correct 588 ms 76788 KB Output is correct
28 Correct 0 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 3 ms 568 KB Output is correct
32 Correct 28 ms 4276 KB Output is correct
33 Correct 5 ms 936 KB Output is correct
34 Correct 6 ms 1208 KB Output is correct
35 Correct 813 ms 97048 KB Output is correct
36 Correct 790 ms 91464 KB Output is correct
37 Correct 781 ms 90596 KB Output is correct
38 Correct 858 ms 97040 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 2 ms 468 KB Output is correct
41 Correct 2 ms 496 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 308 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 496 KB Output is correct
49 Correct 3 ms 468 KB Output is correct
50 Correct 3 ms 564 KB Output is correct
51 Correct 24 ms 3596 KB Output is correct
52 Correct 23 ms 3632 KB Output is correct
53 Correct 26 ms 3912 KB Output is correct
54 Correct 37 ms 4268 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 3288 KB Output is correct
59 Correct 27 ms 3860 KB Output is correct
60 Correct 27 ms 3404 KB Output is correct
61 Correct 30 ms 3944 KB Output is correct
62 Correct 65 ms 9444 KB Output is correct
63 Correct 64 ms 9420 KB Output is correct
64 Correct 87 ms 10884 KB Output is correct
65 Correct 296 ms 39608 KB Output is correct
66 Correct 343 ms 42404 KB Output is correct
67 Correct 7 ms 1236 KB Output is correct
68 Correct 5 ms 852 KB Output is correct
69 Correct 560 ms 82256 KB Output is correct
70 Correct 658 ms 89192 KB Output is correct
71 Correct 789 ms 96988 KB Output is correct
72 Correct 742 ms 81176 KB Output is correct
73 Correct 790 ms 93564 KB Output is correct
74 Correct 605 ms 73820 KB Output is correct
75 Correct 683 ms 86400 KB Output is correct