oj.uz

Submission #428475

# Submission time Handle Problem Language Result Execution time Memory
428475 2021-06-15T12:08:57 Z MarcoMeijer Carnival Tickets (IOI20_tickets) C++14
100 / 100
 991 ms 78876 KB 
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;

// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
#define sz size()
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }

const ll INF = 1e18;

typedef tuple<ll,int,int> T;

ll find_maximum(int k, vector<vi> x) {
	int n = x.size(); // colors
	int m = x[0].size(); // tickets per color
    int N = n*k/2;

    // sort x
    vector<vi> y = x;
    RE(i,n) sort(all(y[i]));
    vector<vi> sx(n,vi());
    RE(i,n) RE(j,m) sx[i].pb(j);
    RE(i,n) {
        sort(all(sx[i]),[&](int a, int b) {
            return x[i][a] < x[i][b];
        });
    }

    vi negCnt; negCnt.assign(n,0);

    ll ans = 0;
    RE(i,n) RE(l,k) ans += y[i][m-1-l];

    priority_queue<T,vector<T>,greater<T>> pq;
    RE(i,n)
        pq.push({y[i][0]+y[i][m-k],i,0});
    
    RE(i,N) {
        T p = pq.top(); pq.pop();
        ll delta; int a, b;
        tie(delta, a, b) = p;
        ans -= delta;
        negCnt[a]++;
        b++;
        if(b != k)
            pq.push({y[a][b]+y[a][m-k+b],a,b});
    }

    // reconstruct the answer
	vector<vi> answer(n,vi(m,-1));
    vi nextNeg, nextPos;
    RE(i,n/2) RE(j,k) nextNeg.pb(j);
    RE(i,n) {
        int len = negCnt[i];
        vi used; used.assign(k,0);
        RE(j,len)
            answer[i][sx[i][j]] = nextNeg.back(), used[nextNeg.back()] = 1, nextNeg.pop_back();
        RE(j,k)
            if(!used[j])
                nextPos.pb(j);
        REP(j,m-k+len,m)
            answer[i][sx[i][j]] = nextPos.back(), nextPos.pop_back();
    }
	allocate_tickets(answer);

	return ans;
}

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 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 4 ms 880 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 29 ms 3256 KB Output is correct
6 Correct 774 ms 72448 KB Output is correct

Subtask #3
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 3 ms 460 KB Output is correct
5 Correct 26 ms 3532 KB Output is correct
6 Correct 656 ms 77644 KB Output is correct
7 Correct 740 ms 78024 KB Output is correct
8 Correct 4 ms 588 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 7 ms 1100 KB Output is correct
13 Correct 25 ms 3048 KB Output is correct
14 Correct 23 ms 2800 KB Output is correct
15 Correct 678 ms 78644 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 3 ms 460 KB Output is correct
5 Correct 36 ms 3348 KB Output is correct
6 Correct 6 ms 948 KB Output is correct
7 Correct 7 ms 1228 KB Output is correct
8 Correct 991 ms 78820 KB Output is correct
9 Correct 872 ms 74328 KB Output is correct
10 Correct 840 ms 73784 KB Output is correct
11 Correct 919 ms 78876 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 460 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 3 ms 460 KB Output is correct
11 Correct 3 ms 460 KB Output is correct
12 Correct 3 ms 460 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 460 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 3 ms 460 KB Output is correct
11 Correct 3 ms 460 KB Output is correct
12 Correct 3 ms 460 KB Output is correct
13 Correct 29 ms 3268 KB Output is correct
14 Correct 32 ms 3240 KB Output is correct
15 Correct 45 ms 3400 KB Output is correct
16 Correct 35 ms 3300 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 3 ms 560 KB Output is correct
19 Correct 2 ms 460 KB Output is correct
20 Correct 29 ms 3528 KB Output is correct
21 Correct 32 ms 4008 KB Output is correct
22 Correct 31 ms 3540 KB Output is correct
23 Correct 34 ms 4128 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 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 4 ms 880 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 29 ms 3256 KB Output is correct
12 Correct 774 ms 72448 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 3 ms 460 KB Output is correct
17 Correct 26 ms 3532 KB Output is correct
18 Correct 656 ms 77644 KB Output is correct
19 Correct 740 ms 78024 KB Output is correct
20 Correct 4 ms 588 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 7 ms 1100 KB Output is correct
25 Correct 25 ms 3048 KB Output is correct
26 Correct 23 ms 2800 KB Output is correct
27 Correct 678 ms 78644 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 3 ms 460 KB Output is correct
32 Correct 36 ms 3348 KB Output is correct
33 Correct 6 ms 948 KB Output is correct
34 Correct 7 ms 1228 KB Output is correct
35 Correct 991 ms 78820 KB Output is correct
36 Correct 872 ms 74328 KB Output is correct
37 Correct 840 ms 73784 KB Output is correct
38 Correct 919 ms 78876 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 460 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 3 ms 460 KB Output is correct
49 Correct 3 ms 460 KB Output is correct
50 Correct 3 ms 460 KB Output is correct
51 Correct 29 ms 3268 KB Output is correct
52 Correct 32 ms 3240 KB Output is correct
53 Correct 45 ms 3400 KB Output is correct
54 Correct 35 ms 3300 KB Output is correct
55 Correct 1 ms 332 KB Output is correct
56 Correct 3 ms 560 KB Output is correct
57 Correct 2 ms 460 KB Output is correct
58 Correct 29 ms 3528 KB Output is correct
59 Correct 32 ms 4008 KB Output is correct
60 Correct 31 ms 3540 KB Output is correct
61 Correct 34 ms 4128 KB Output is correct
62 Correct 82 ms 10436 KB Output is correct
63 Correct 89 ms 10432 KB Output is correct
64 Correct 95 ms 10560 KB Output is correct
65 Correct 363 ms 41088 KB Output is correct
66 Correct 432 ms 41608 KB Output is correct
67 Correct 7 ms 1228 KB Output is correct
68 Correct 6 ms 972 KB Output is correct
69 Correct 718 ms 75980 KB Output is correct
70 Correct 837 ms 73336 KB Output is correct
71 Correct 971 ms 75188 KB Output is correct
72 Correct 786 ms 73012 KB Output is correct
73 Correct 870 ms 72396 KB Output is correct
74 Correct 729 ms 71296 KB Output is correct
75 Correct 817 ms 70928 KB Output is correct