oj.uz

Submission #334093

# Submission time Handle Problem Language Result Execution time Memory
334093 2020-12-08T10:22:53 Z balbit Carnival Tickets (IOI20_tickets) C++14
100 / 100
 1057 ms 105744 KB 
#include <bits/stdc++.h>
#ifndef BALBIT
#include "tickets.h"
#endif // BALBIT
using namespace std;

#define ll long long
#define pii pair<int, int>
#define f first
#define s second

#define ALL(x) (x).begin(), (x).end()
#define SZ(x) (int)(x.size())
#define pb push_back

#ifdef BALBIT
#define bug(...) cerr<<"#"<<__LINE__<<": "<<#__VA_ARGS__<<": ", _do(__VA_ARGS__)
template<typename T> void _do(T && x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T && x, S && ...y){cerr<<x<<", "; _do(y...);}
#define IOS()
#else
#define IOS() ios::sync_with_stdio(0), cin.tie(0)
#define bug(...)
#define endl '\n'
#endif // BALBIT

#define REP(i,n) for (int i = 0; i<n;++i)
#define REP1(i,n) for (int i = 1; i<=n;++i)

const int maxn = 1505;
int n,m;
vector<vector<int> > ans;
int ntop[maxn], it0[maxn], it1[maxn];

#ifdef BALBIT
void allocate_tickets( std::vector<std::vector<int>> _d) {
    REP(i,n) REP(j,m) {
        cout<<_d[i][j]<<" \n"[j==m-1];
    }
}
#endif // BALBIT

long long find_maximum(int k, vector<vector<int>> x) {
    n = x.size();
    m = x[0].size();
    ll re = 0;
    vector<pair<ll ,int> > pq; //added value, position
    REP(i,n) {
        REP(j,k) {
            re -= x[i][j];
        }
        REP(j,k) {
            pq.pb({x[i][j] + x[i][m-k+j], i});
        }
    }
    fill(it0, it0+n, 0);
    fill(it1, it1+n, m-1);
    sort(ALL(pq), greater<pair<ll, int> > ());
    REP(i, n * k / 2) {
        re += pq[i].f; ntop[pq[i].s] ++;
    }
    bug(re);
    ans = vector<vector<int> > (n, vector<int>(m,-1));
    REP(cnt, k) {
        vector<pii> topleft;
        REP(i,n) topleft.pb({ntop[i], i});
        sort(ALL(topleft));
        REP(i,n) {
            int at = topleft[i].s;
            if (i < n/2) {
                // take bottom
                ans[at][it0[at]++] = cnt;
            }else{
                ans[at][it1[at]--] = cnt;
                --ntop[at];
            }
        }
    }
	allocate_tickets(ans);
	return re;
}

#ifdef BALBIT
signed main(){
    bug(1,2);
    find_maximum(2, {{0, 2, 5},{1, 1, 3}});
//    find_maximum(1, {{5, 9}, {1, 4}, {3, 6}, {2, 7}});
}
#endif

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 3 ms 748 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 3 ms 620 KB Output is correct
5 Correct 27 ms 3308 KB Output is correct
6 Correct 655 ms 73324 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 3 ms 620 KB Output is correct
5 Correct 28 ms 3044 KB Output is correct
6 Correct 769 ms 66832 KB Output is correct
7 Correct 789 ms 72592 KB Output is correct
8 Correct 4 ms 748 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 380 KB Output is correct
12 Correct 8 ms 1128 KB Output is correct
13 Correct 25 ms 2792 KB Output is correct
14 Correct 25 ms 2916 KB Output is correct
15 Correct 787 ms 77328 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 3 ms 644 KB Output is correct
5 Correct 39 ms 4448 KB Output is correct
6 Correct 6 ms 1004 KB Output is correct
7 Correct 8 ms 1260 KB Output is correct
8 Correct 1000 ms 105648 KB Output is correct
9 Correct 977 ms 103056 KB Output is correct
10 Correct 977 ms 103088 KB Output is correct
11 Correct 1057 ms 105744 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 3 ms 620 KB Output is correct
3 Correct 3 ms 620 KB Output is correct
4 Correct 3 ms 620 KB Output is correct
5 Correct 3 ms 748 KB Output is correct
6 Correct 3 ms 620 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 3 ms 620 KB Output is correct
10 Correct 3 ms 620 KB Output is correct
11 Correct 3 ms 620 KB Output is correct
12 Correct 3 ms 660 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 3 ms 620 KB Output is correct
3 Correct 3 ms 620 KB Output is correct
4 Correct 3 ms 620 KB Output is correct
5 Correct 3 ms 748 KB Output is correct
6 Correct 3 ms 620 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 3 ms 620 KB Output is correct
10 Correct 3 ms 620 KB Output is correct
11 Correct 3 ms 620 KB Output is correct
12 Correct 3 ms 660 KB Output is correct
13 Correct 27 ms 3308 KB Output is correct
14 Correct 27 ms 3436 KB Output is correct
15 Correct 32 ms 3684 KB Output is correct
16 Correct 38 ms 4448 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 3 ms 620 KB Output is correct
19 Correct 2 ms 492 KB Output is correct
20 Correct 33 ms 3368 KB Output is correct
21 Correct 34 ms 3808 KB Output is correct
22 Correct 37 ms 3804 KB Output is correct
23 Correct 37 ms 4188 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 3 ms 748 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 3 ms 620 KB Output is correct
11 Correct 27 ms 3308 KB Output is correct
12 Correct 655 ms 73324 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 0 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 3 ms 620 KB Output is correct
17 Correct 28 ms 3044 KB Output is correct
18 Correct 769 ms 66832 KB Output is correct
19 Correct 789 ms 72592 KB Output is correct
20 Correct 4 ms 748 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 380 KB Output is correct
24 Correct 8 ms 1128 KB Output is correct
25 Correct 25 ms 2792 KB Output is correct
26 Correct 25 ms 2916 KB Output is correct
27 Correct 787 ms 77328 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 3 ms 644 KB Output is correct
32 Correct 39 ms 4448 KB Output is correct
33 Correct 6 ms 1004 KB Output is correct
34 Correct 8 ms 1260 KB Output is correct
35 Correct 1000 ms 105648 KB Output is correct
36 Correct 977 ms 103056 KB Output is correct
37 Correct 977 ms 103088 KB Output is correct
38 Correct 1057 ms 105744 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 3 ms 620 KB Output is correct
41 Correct 3 ms 620 KB Output is correct
42 Correct 3 ms 620 KB Output is correct
43 Correct 3 ms 748 KB Output is correct
44 Correct 3 ms 620 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 3 ms 620 KB Output is correct
48 Correct 3 ms 620 KB Output is correct
49 Correct 3 ms 620 KB Output is correct
50 Correct 3 ms 660 KB Output is correct
51 Correct 27 ms 3308 KB Output is correct
52 Correct 27 ms 3436 KB Output is correct
53 Correct 32 ms 3684 KB Output is correct
54 Correct 38 ms 4448 KB Output is correct
55 Correct 1 ms 364 KB Output is correct
56 Correct 3 ms 620 KB Output is correct
57 Correct 2 ms 492 KB Output is correct
58 Correct 33 ms 3368 KB Output is correct
59 Correct 34 ms 3808 KB Output is correct
60 Correct 37 ms 3804 KB Output is correct
61 Correct 37 ms 4188 KB Output is correct
62 Correct 73 ms 8556 KB Output is correct
63 Correct 74 ms 8476 KB Output is correct
64 Correct 104 ms 11604 KB Output is correct
65 Correct 355 ms 37580 KB Output is correct
66 Correct 435 ms 45496 KB Output is correct
67 Correct 8 ms 1260 KB Output is correct
68 Correct 6 ms 1004 KB Output is correct
69 Correct 654 ms 73468 KB Output is correct
70 Correct 827 ms 84112 KB Output is correct
71 Correct 994 ms 105744 KB Output is correct
72 Correct 949 ms 91672 KB Output is correct
73 Correct 963 ms 96160 KB Output is correct
74 Correct 785 ms 70424 KB Output is correct
75 Correct 832 ms 82580 KB Output is correct