oj.uz

Submission #301136

# Submission time Handle Problem Language Result Execution time Memory
301136 2020-09-17T16:49:34 Z andrew Carnival Tickets (IOI20_tickets) C++17
100 / 100
 1936 ms 161404 KB 
#include <bits/stdc++.h>
#include "tickets.h"


#define fi first
#define se second
#define pii pair <int, int>
#define pll pair <ll, ll>
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define p_b push_back

using namespace std;
typedef long long ll;
const ll inf = 1e18;

long long find_maximum(int k, std::vector<std::vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	std::vector<std::vector<int>> answer(n, vector <int> (m, -1));
	ll ans = 0;
    vector <ll> c(n);
    vector <vector <pll> > xx(n, vector <pll> (m));
    vector <vector <bool> > f(n, vector <bool> (m));
    set <pll> st;
    for(int i = 0; i < n; i++){
        for(int j = 0; j < m; j++){
            xx[i][j] = {x[i][j], j};
        }
        sort(all(xx[i]));
        for(int j = m - k; j < m; j++)ans += xx[i][j].fi;
        st.insert({-xx[i][0].fi - xx[i][m - k].fi, i});
    }

    ll t = k * (n / 2);
    while(t--){
        pll xe = *--st.end();
        ans += xe.fi;
        st.erase(xe);
        c[xe.se]++;
        if(c[xe.se] < k){
            st.insert({-xx[xe.se][c[xe.se]].fi - xx[xe.se][m - k + c[xe.se]].fi, xe.se});
        }
    }

    vector <pair <ll, pll> > vc;
    for(int i = 0; i < n; i++){
        for(int j = 0; j < c[i]; j++)vc.p_b({xx[i][j].fi, {i, xx[i][j].se}});
        for(int j = m - k + c[i]; j < m; j++)vc.p_b({xx[i][j].fi, {i, xx[i][j].se}});
    }

    sort(all(vc));
    reverse(all(vc));
    int M = k * (n / 2);
    for(auto i : vc){
        M--;
        f[i.se.fi][i.se.se] = 1;
        if(!M)break;
    }
    int uk = 0;
    for(int i = 0; i < n; i++){
        set <int> s;
        for(int j = 0; j < k; j++)s.insert(j);
        for(int j = 0; j < m; j++){
            if(f[i][j]){
                answer[i][j] = uk;
                s.erase(uk);
                (uk += 1) %= k;
            }
        }
        c[i] = sz(s);
        for(int j = 0; j < c[i]; j++){
            answer[i][xx[i][j].se] = *s.begin();
            s.erase(s.begin());
        }
    }

	allocate_tickets(answer);
	return ans;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 4 ms 640 KB Output is correct
5 Correct 33 ms 3860 KB Output is correct
6 Correct 835 ms 87160 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 4 ms 764 KB Output is correct
5 Correct 49 ms 4628 KB Output is correct
6 Correct 1073 ms 112156 KB Output is correct
7 Correct 1141 ms 115632 KB Output is correct
8 Correct 7 ms 1088 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 11 ms 1532 KB Output is correct
13 Correct 34 ms 4340 KB Output is correct
14 Correct 39 ms 4404 KB Output is correct
15 Correct 1256 ms 122728 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 7 ms 832 KB Output is correct
5 Correct 66 ms 6124 KB Output is correct
6 Correct 10 ms 1300 KB Output is correct
7 Correct 12 ms 1660 KB Output is correct
8 Correct 1936 ms 161372 KB Output is correct
9 Correct 1669 ms 157176 KB Output is correct
10 Correct 1721 ms 157096 KB Output is correct
11 Correct 1923 ms 161404 KB Output is correct

Subtask #5
12.0 / 12.0

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

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 3 ms 640 KB Output is correct
3 Correct 4 ms 640 KB Output is correct
4 Correct 5 ms 640 KB Output is correct
5 Correct 6 ms 640 KB Output is correct
6 Correct 5 ms 768 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 5 ms 760 KB Output is correct
10 Correct 6 ms 760 KB Output is correct
11 Correct 5 ms 832 KB Output is correct
12 Correct 5 ms 832 KB Output is correct
13 Correct 37 ms 3892 KB Output is correct
14 Correct 39 ms 3884 KB Output is correct
15 Correct 54 ms 4592 KB Output is correct
16 Correct 66 ms 6124 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 4 ms 752 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 52 ms 4840 KB Output is correct
21 Correct 57 ms 4844 KB Output is correct
22 Correct 60 ms 6000 KB Output is correct
23 Correct 61 ms 5996 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 3 ms 1024 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 4 ms 640 KB Output is correct
11 Correct 33 ms 3860 KB Output is correct
12 Correct 835 ms 87160 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 4 ms 764 KB Output is correct
17 Correct 49 ms 4628 KB Output is correct
18 Correct 1073 ms 112156 KB Output is correct
19 Correct 1141 ms 115632 KB Output is correct
20 Correct 7 ms 1088 KB Output is correct
21 Correct 0 ms 256 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 0 ms 256 KB Output is correct
24 Correct 11 ms 1532 KB Output is correct
25 Correct 34 ms 4340 KB Output is correct
26 Correct 39 ms 4404 KB Output is correct
27 Correct 1256 ms 122728 KB Output is correct
28 Correct 1 ms 256 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 7 ms 832 KB Output is correct
32 Correct 66 ms 6124 KB Output is correct
33 Correct 10 ms 1300 KB Output is correct
34 Correct 12 ms 1660 KB Output is correct
35 Correct 1936 ms 161372 KB Output is correct
36 Correct 1669 ms 157176 KB Output is correct
37 Correct 1721 ms 157096 KB Output is correct
38 Correct 1923 ms 161404 KB Output is correct
39 Correct 1 ms 256 KB Output is correct
40 Correct 3 ms 640 KB Output is correct
41 Correct 4 ms 640 KB Output is correct
42 Correct 5 ms 640 KB Output is correct
43 Correct 6 ms 640 KB Output is correct
44 Correct 5 ms 768 KB Output is correct
45 Correct 1 ms 384 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 5 ms 760 KB Output is correct
48 Correct 6 ms 760 KB Output is correct
49 Correct 5 ms 832 KB Output is correct
50 Correct 5 ms 832 KB Output is correct
51 Correct 37 ms 3892 KB Output is correct
52 Correct 39 ms 3884 KB Output is correct
53 Correct 54 ms 4592 KB Output is correct
54 Correct 66 ms 6124 KB Output is correct
55 Correct 2 ms 384 KB Output is correct
56 Correct 4 ms 752 KB Output is correct
57 Correct 2 ms 512 KB Output is correct
58 Correct 52 ms 4840 KB Output is correct
59 Correct 57 ms 4844 KB Output is correct
60 Correct 60 ms 6000 KB Output is correct
61 Correct 61 ms 5996 KB Output is correct
62 Correct 90 ms 10104 KB Output is correct
63 Correct 99 ms 10040 KB Output is correct
64 Correct 187 ms 15196 KB Output is correct
65 Correct 586 ms 47688 KB Output is correct
66 Correct 787 ms 59564 KB Output is correct
67 Correct 17 ms 1660 KB Output is correct
68 Correct 10 ms 1240 KB Output is correct
69 Correct 862 ms 87192 KB Output is correct
70 Correct 1345 ms 112040 KB Output is correct
71 Correct 1902 ms 161272 KB Output is correct
72 Correct 1575 ms 159140 KB Output is correct
73 Correct 1604 ms 125524 KB Output is correct
74 Correct 1431 ms 109868 KB Output is correct
75 Correct 1389 ms 110148 KB Output is correct