oj.uz

Submission #581484

# Submission time Handle Problem Language Result Execution time Memory
581484 2022-06-22T16:55:05 Z MohamedFaresNebili Carnival Tickets (IOI20_tickets) C++14
100 / 100
 702 ms 57512 KB 
#include <bits/stdc++.h>
#include "tickets.h"
#include <ext/pb_ds/assoc_container.hpp>

        using namespace std;
        using namespace __gnu_pbds;

        using ll = long long;
        using pi = pair<ll, pair<ll, ll>>;
        using ii = pair<int, int>;

        #define pb push_back
        #define pp pop_back
        #define ff first
        #define ss second

        typedef tree<int, null_type, less<int>, rb_tree_tag,
            tree_order_statistics_node_update> indexed_set;

        ll find_maximum(int K, vector<vector<int>> A) {
            int N = A.size(), M = A[0].size(); ll res = 0;
            vector<vector<int>> S(N, vector<int> (M, -1));

            priority_queue<pair<ll, ll>> pq;
            int lf[N], rf[N]; vector<pair<ll, ll>> arr;

            for(int l = 0; l < N; l++) {
                lf[l] = K - 1;
                pq.push({A[l][M - 1] + A[l][K - 1], l});
                for(int i = 0; i < K; i++)
                    res -= A[l][i];
            }

            for(int l = 0; l < K * N / 2; l++) {
                res += pq.top().ff;
                int i = pq.top().ss; pq.pop();
                lf[i]--;
                if(lf[i] >= 0)
                    pq.push({A[i][lf[i]] + A[i][lf[i] + M - K], i});
            }

            for(int l = 0; l < N; l++)
                rf[l] = lf[l] + M - K + 1,
                arr.pb({M - rf[l], l});

            for(int R = 0; R < K; R++) {
                sort(arr.begin(), arr.end());
                for(int l = 0; l < N / 2; l++) {
                    int i = arr[l].ss;
                    S[i][lf[i]] = R; lf[i]--;
                }
                for(int l = N / 2; l < N; l++) {
                    int i = arr[l].ss;
                    S[i][rf[i]] = R; rf[i]++; arr[l].ff--;
                }
            }

            allocate_tickets(S);
            return res;
        }

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 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 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 1 ms 212 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 20 ms 2388 KB Output is correct
6 Correct 474 ms 51384 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 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 21 ms 2472 KB Output is correct
6 Correct 474 ms 56260 KB Output is correct
7 Correct 576 ms 57068 KB Output is correct
8 Correct 3 ms 468 KB Output is correct
9 Correct 1 ms 296 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 852 KB Output is correct
13 Correct 20 ms 2120 KB Output is correct
14 Correct 18 ms 2132 KB Output is correct
15 Correct 576 ms 57512 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 0 ms 212 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 27 ms 3280 KB Output is correct
6 Correct 4 ms 724 KB Output is correct
7 Correct 6 ms 980 KB Output is correct
8 Correct 701 ms 56212 KB Output is correct
9 Correct 666 ms 52308 KB Output is correct
10 Correct 689 ms 52456 KB Output is correct
11 Correct 702 ms 56256 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 468 KB Output is correct
5 Correct 2 ms 496 KB Output is correct
6 Correct 2 ms 492 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 476 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 468 KB Output is correct
5 Correct 2 ms 496 KB Output is correct
6 Correct 2 ms 492 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 476 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 23 ms 3132 KB Output is correct
14 Correct 21 ms 3208 KB Output is correct
15 Correct 30 ms 3148 KB Output is correct
16 Correct 26 ms 3276 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 3 ms 496 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 24 ms 2596 KB Output is correct
21 Correct 25 ms 3124 KB Output is correct
22 Correct 23 ms 2644 KB Output is correct
23 Correct 24 ms 3144 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 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 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 1 ms 212 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 20 ms 2388 KB Output is correct
12 Correct 474 ms 51384 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 21 ms 2472 KB Output is correct
18 Correct 474 ms 56260 KB Output is correct
19 Correct 576 ms 57068 KB Output is correct
20 Correct 3 ms 468 KB Output is correct
21 Correct 1 ms 296 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 852 KB Output is correct
25 Correct 20 ms 2120 KB Output is correct
26 Correct 18 ms 2132 KB Output is correct
27 Correct 576 ms 57512 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 3 ms 468 KB Output is correct
32 Correct 27 ms 3280 KB Output is correct
33 Correct 4 ms 724 KB Output is correct
34 Correct 6 ms 980 KB Output is correct
35 Correct 701 ms 56212 KB Output is correct
36 Correct 666 ms 52308 KB Output is correct
37 Correct 689 ms 52456 KB Output is correct
38 Correct 702 ms 56256 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 468 KB Output is correct
43 Correct 2 ms 496 KB Output is correct
44 Correct 2 ms 492 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 476 KB Output is correct
50 Correct 2 ms 468 KB Output is correct
51 Correct 23 ms 3132 KB Output is correct
52 Correct 21 ms 3208 KB Output is correct
53 Correct 30 ms 3148 KB Output is correct
54 Correct 26 ms 3276 KB Output is correct
55 Correct 2 ms 340 KB Output is correct
56 Correct 3 ms 496 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 24 ms 2596 KB Output is correct
59 Correct 25 ms 3124 KB Output is correct
60 Correct 23 ms 2644 KB Output is correct
61 Correct 24 ms 3144 KB Output is correct
62 Correct 55 ms 8412 KB Output is correct
63 Correct 73 ms 8396 KB Output is correct
64 Correct 73 ms 8584 KB Output is correct
65 Correct 256 ms 27044 KB Output is correct
66 Correct 311 ms 27672 KB Output is correct
67 Correct 8 ms 980 KB Output is correct
68 Correct 5 ms 804 KB Output is correct
69 Correct 537 ms 53360 KB Output is correct
70 Correct 663 ms 54396 KB Output is correct
71 Correct 686 ms 56148 KB Output is correct
72 Correct 569 ms 55508 KB Output is correct
73 Correct 669 ms 53916 KB Output is correct
74 Correct 483 ms 54140 KB Output is correct
75 Correct 588 ms 52480 KB Output is correct