oj.uz

Submission #392715

# Submission time Handle Problem Language Result Execution time Memory
392715 2021-04-21T13:58:12 Z rocks03 Carnival Tickets (IOI20_tickets) C++14
100 / 100
 1060 ms 105592 KB 
//#pragma GCC target("avx2")
//#pragma GCC optimization("O3")
//#pragma GCC optimization("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define SZ(x) ((int)(x).size())
#define all(x) x.begin(), x.end()
#define rep(i, a, b) for(int i = (a); i < (b); i++)
#define per(i, a, b) for(int i = (a); i >= (b); i--)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void allocate_tickets(vector<vector<int>> _d);

struct Ticket{
    ll val; int x, y;
    bool operator<(const Ticket& oth) const{
        return val < oth.val;
    }
};
long long find_maximum(int K, vector<vector<int>> a){
    int N = SZ(a), M = SZ(a[0]);
    vector<int> l(N), r(N);
    ll ans = 0;
    vector<Ticket> ch;
    rep(i, 0, N){
        per(j, K - 1, 0){
            ans -= a[i][j];
            ch.pb({+a[i][j] + a[i][M+j-K], i, j});
        }
        l[i] = K - 1, r[i] = M;
    }
    sort(all(ch));
    int cnt = K * N / 2;
    while(cnt--){
        auto [val, x, y] = ch.back();
        ch.pop_back();
        ans += val;
        --l[x], --r[x];
    }
    vector<vector<int>> t(N, vector<int>(M, -1));
    rep(k, 0, K){
        vector<pii> v;
        rep(i, 0, N){
            v.pb({M - r[i], i});
        }
        sort(all(v));
        rep(x, 0, N / 2){
            auto [n, i] = v[x];
            t[i][l[i]--] = k;
        }
        rep(x, N / 2, N){
            auto [n, i] = v[x];
            t[i][r[i]++] = k;
        }
    }
    allocate_tickets(t);
    return ans;
}

Compilation message

tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:41:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   41 |         auto [val, x, y] = ch.back();
      |              ^
tickets.cpp:54:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   54 |             auto [n, i] = v[x];
      |                  ^
tickets.cpp:58:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   58 |             auto [n, i] = v[x];
      |                  ^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 716 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 31 ms 2580 KB Output is correct
6 Correct 677 ms 51736 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 2 ms 516 KB Output is correct
5 Correct 27 ms 2888 KB Output is correct
6 Correct 677 ms 66604 KB Output is correct
7 Correct 723 ms 72420 KB Output is correct
8 Correct 6 ms 716 KB Output is correct
9 Correct 1 ms 304 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 8 ms 968 KB Output is correct
13 Correct 24 ms 2780 KB Output is correct
14 Correct 24 ms 2884 KB Output is correct
15 Correct 760 ms 77160 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 4 ms 588 KB Output is correct
5 Correct 43 ms 4324 KB Output is correct
6 Correct 8 ms 936 KB Output is correct
7 Correct 8 ms 1100 KB Output is correct
8 Correct 1014 ms 85148 KB Output is correct
9 Correct 999 ms 83940 KB Output is correct
10 Correct 1006 ms 83892 KB Output is correct
11 Correct 1060 ms 85244 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 3 ms 460 KB Output is correct
3 Correct 3 ms 460 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 3 ms 460 KB Output is correct
6 Correct 3 ms 632 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 3 ms 460 KB Output is correct
10 Correct 4 ms 464 KB Output is correct
11 Correct 3 ms 588 KB Output is correct
12 Correct 3 ms 572 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 3 ms 460 KB Output is correct
3 Correct 3 ms 460 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 3 ms 460 KB Output is correct
6 Correct 3 ms 632 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 3 ms 460 KB Output is correct
10 Correct 4 ms 464 KB Output is correct
11 Correct 3 ms 588 KB Output is correct
12 Correct 3 ms 572 KB Output is correct
13 Correct 29 ms 3260 KB Output is correct
14 Correct 28 ms 3192 KB Output is correct
15 Correct 33 ms 3648 KB Output is correct
16 Correct 39 ms 4348 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 3 ms 588 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 30 ms 3264 KB Output is correct
21 Correct 35 ms 3704 KB Output is correct
22 Correct 33 ms 3596 KB Output is correct
23 Correct 38 ms 4156 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 716 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 31 ms 2580 KB Output is correct
12 Correct 677 ms 51736 KB Output is correct
13 Correct 1 ms 300 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 2 ms 516 KB Output is correct
17 Correct 27 ms 2888 KB Output is correct
18 Correct 677 ms 66604 KB Output is correct
19 Correct 723 ms 72420 KB Output is correct
20 Correct 6 ms 716 KB Output is correct
21 Correct 1 ms 304 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 8 ms 968 KB Output is correct
25 Correct 24 ms 2780 KB Output is correct
26 Correct 24 ms 2884 KB Output is correct
27 Correct 760 ms 77160 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 4 ms 588 KB Output is correct
32 Correct 43 ms 4324 KB Output is correct
33 Correct 8 ms 936 KB Output is correct
34 Correct 8 ms 1100 KB Output is correct
35 Correct 1014 ms 85148 KB Output is correct
36 Correct 999 ms 83940 KB Output is correct
37 Correct 1006 ms 83892 KB Output is correct
38 Correct 1060 ms 85244 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 3 ms 460 KB Output is correct
41 Correct 3 ms 460 KB Output is correct
42 Correct 3 ms 460 KB Output is correct
43 Correct 3 ms 460 KB Output is correct
44 Correct 3 ms 632 KB Output is correct
45 Correct 1 ms 204 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 3 ms 460 KB Output is correct
48 Correct 4 ms 464 KB Output is correct
49 Correct 3 ms 588 KB Output is correct
50 Correct 3 ms 572 KB Output is correct
51 Correct 29 ms 3260 KB Output is correct
52 Correct 28 ms 3192 KB Output is correct
53 Correct 33 ms 3648 KB Output is correct
54 Correct 39 ms 4348 KB Output is correct
55 Correct 1 ms 332 KB Output is correct
56 Correct 3 ms 588 KB Output is correct
57 Correct 2 ms 332 KB Output is correct
58 Correct 30 ms 3264 KB Output is correct
59 Correct 35 ms 3704 KB Output is correct
60 Correct 33 ms 3596 KB Output is correct
61 Correct 38 ms 4156 KB Output is correct
62 Correct 87 ms 8376 KB Output is correct
63 Correct 78 ms 8432 KB Output is correct
64 Correct 106 ms 11516 KB Output is correct
65 Correct 393 ms 37468 KB Output is correct
66 Correct 440 ms 45296 KB Output is correct
67 Correct 8 ms 1228 KB Output is correct
68 Correct 7 ms 972 KB Output is correct
69 Correct 680 ms 73008 KB Output is correct
70 Correct 848 ms 83936 KB Output is correct
71 Correct 1018 ms 105592 KB Output is correct
72 Correct 852 ms 91692 KB Output is correct
73 Correct 985 ms 96004 KB Output is correct
74 Correct 767 ms 70268 KB Output is correct
75 Correct 866 ms 82432 KB Output is correct