oj.uz

Submission #300642

# Submission time Handle Problem Language Result Execution time Memory
300642 2020-09-17T10:51:41 Z MarcoMeijer Carnival Tickets (IOI20_tickets) C++14
100 / 100
 1184 ms 80880 KB 
#include <bits/stdc++.h>
#include "tickets.h"

using namespace std;

#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define RE(a,b) REP(a,0,b)
#define FOR(a,b) for(auto& a:b)
#define pb push_back
#define fi first
#define se second
#define all(a) a.begin(), a.end()

typedef long long ll;
typedef pair<int,int> ii;
typedef pair<ll,ll> lll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef vector<ii> vii;

const int INF=1e9;
const int MX=1505;

int n, k, m;
vvi X;
vvi answer;
vvll dp;
vvll dpOpt;
ll cost[MX][MX];
int big[MX];
int ticketBig[MX], ticketSmall[MX];

void searchDp(int x, int y) {
    if(x == 0) return;
    int opt = dpOpt[x][y];
    big[x-1] = opt;
    searchDp(x-1, y-opt);
}

ll find_maximum(int _k, vvi _x) {
    k = _k; X = _x;
    n = X.size();
    m = X[0].size();
    int totBig = (n/2)*k;

    // fill cost
    RE(i,n) {
        ll sm = 0;
        RE(j,k) sm -= X[i][j];
        RE(j,k+1) {
            cost[i][j] = sm;
            if(j == k) break;
            sm += X[i][k-1-j];
            sm += X[i][m-1-j];
        }
    }

    // fill big
    priority_queue<lll> pq;
    RE(i,n) big[i] = 0;
    RE(i,n) pq.push({cost[i][big[i]+1] - cost[i][big[i]], i});
    RE(i,totBig) {
        int x = pq.top().se; pq.pop();
        big[x]++;
        if(big[x] != k) pq.push({cost[x][big[x]+1] - cost[x][big[x]], x});
    }

    // create answer
    ll ans = 0;
    answer.assign(n,vi(m,-1));
    RE(i,n) ticketBig[i]=m-1, ticketSmall[i]=0;
    RE(i,k) {
        vii best;
        RE(j,n) best.pb({big[j], j});
        sort(all(best), greater<ii>());
        RE(j,n/2) {
            int x = best[j].se;
            ans += X[x][ticketBig[x]];
            big[x]--;
            answer[x][ticketBig[x]--] = i;
        }
        RE(j,n/2) {
            int x = best[j+n/2].se;
            ans -= X[x][ticketSmall[x]];
            answer[x][ticketSmall[x]++] = i;
        }
    }

    allocate_tickets(answer);
    return ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 640 KB Output is correct
5 Correct 2 ms 1664 KB Output is correct
6 Correct 6 ms 6912 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 3 ms 768 KB Output is correct
5 Correct 42 ms 3960 KB Output is correct
6 Correct 743 ms 66388 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 3 ms 896 KB Output is correct
5 Correct 38 ms 4344 KB Output is correct
6 Correct 761 ms 76408 KB Output is correct
7 Correct 756 ms 79292 KB Output is correct
8 Correct 4 ms 1024 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 8 ms 1664 KB Output is correct
13 Correct 26 ms 4864 KB Output is correct
14 Correct 27 ms 3456 KB Output is correct
15 Correct 782 ms 79896 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 6 ms 896 KB Output is correct
5 Correct 41 ms 4728 KB Output is correct
6 Correct 9 ms 896 KB Output is correct
7 Correct 11 ms 7168 KB Output is correct
8 Correct 1184 ms 80880 KB Output is correct
9 Correct 986 ms 76512 KB Output is correct
10 Correct 1022 ms 75608 KB Output is correct
11 Correct 1085 ms 80868 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 3 ms 768 KB Output is correct
3 Correct 4 ms 768 KB Output is correct
4 Correct 3 ms 896 KB Output is correct
5 Correct 4 ms 896 KB Output is correct
6 Correct 3 ms 896 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 640 KB Output is correct
9 Correct 3 ms 896 KB Output is correct
10 Correct 4 ms 896 KB Output is correct
11 Correct 4 ms 896 KB Output is correct
12 Correct 3 ms 896 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 3 ms 768 KB Output is correct
3 Correct 4 ms 768 KB Output is correct
4 Correct 3 ms 896 KB Output is correct
5 Correct 4 ms 896 KB Output is correct
6 Correct 3 ms 896 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 640 KB Output is correct
9 Correct 3 ms 896 KB Output is correct
10 Correct 4 ms 896 KB Output is correct
11 Correct 4 ms 896 KB Output is correct
12 Correct 3 ms 896 KB Output is correct
13 Correct 37 ms 3960 KB Output is correct
14 Correct 31 ms 4096 KB Output is correct
15 Correct 36 ms 4352 KB Output is correct
16 Correct 40 ms 4728 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 4 ms 1792 KB Output is correct
19 Correct 3 ms 1664 KB Output is correct
20 Correct 30 ms 4344 KB Output is correct
21 Correct 35 ms 4344 KB Output is correct
22 Correct 33 ms 4608 KB Output is correct
23 Correct 52 ms 4600 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 640 KB Output is correct
5 Correct 2 ms 1664 KB Output is correct
6 Correct 6 ms 6912 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 3 ms 768 KB Output is correct
11 Correct 42 ms 3960 KB Output is correct
12 Correct 743 ms 66388 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 3 ms 896 KB Output is correct
17 Correct 38 ms 4344 KB Output is correct
18 Correct 761 ms 76408 KB Output is correct
19 Correct 756 ms 79292 KB Output is correct
20 Correct 4 ms 1024 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 8 ms 1664 KB Output is correct
25 Correct 26 ms 4864 KB Output is correct
26 Correct 27 ms 3456 KB Output is correct
27 Correct 782 ms 79896 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 6 ms 896 KB Output is correct
32 Correct 41 ms 4728 KB Output is correct
33 Correct 9 ms 896 KB Output is correct
34 Correct 11 ms 7168 KB Output is correct
35 Correct 1184 ms 80880 KB Output is correct
36 Correct 986 ms 76512 KB Output is correct
37 Correct 1022 ms 75608 KB Output is correct
38 Correct 1085 ms 80868 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 3 ms 768 KB Output is correct
41 Correct 4 ms 768 KB Output is correct
42 Correct 3 ms 896 KB Output is correct
43 Correct 4 ms 896 KB Output is correct
44 Correct 3 ms 896 KB Output is correct
45 Correct 1 ms 384 KB Output is correct
46 Correct 1 ms 640 KB Output is correct
47 Correct 3 ms 896 KB Output is correct
48 Correct 4 ms 896 KB Output is correct
49 Correct 4 ms 896 KB Output is correct
50 Correct 3 ms 896 KB Output is correct
51 Correct 37 ms 3960 KB Output is correct
52 Correct 31 ms 4096 KB Output is correct
53 Correct 36 ms 4352 KB Output is correct
54 Correct 40 ms 4728 KB Output is correct
55 Correct 1 ms 384 KB Output is correct
56 Correct 4 ms 1792 KB Output is correct
57 Correct 3 ms 1664 KB Output is correct
58 Correct 30 ms 4344 KB Output is correct
59 Correct 35 ms 4344 KB Output is correct
60 Correct 33 ms 4608 KB Output is correct
61 Correct 52 ms 4600 KB Output is correct
62 Correct 94 ms 9060 KB Output is correct
63 Correct 86 ms 9080 KB Output is correct
64 Correct 132 ms 11256 KB Output is correct
65 Correct 516 ms 35440 KB Output is correct
66 Correct 533 ms 39872 KB Output is correct
67 Correct 12 ms 7168 KB Output is correct
68 Correct 9 ms 896 KB Output is correct
69 Correct 757 ms 66464 KB Output is correct
70 Correct 999 ms 76072 KB Output is correct
71 Correct 1094 ms 80828 KB Output is correct
72 Correct 852 ms 78476 KB Output is correct
73 Correct 1087 ms 77960 KB Output is correct
74 Correct 764 ms 74708 KB Output is correct
75 Correct 993 ms 74316 KB Output is correct