Submission #428765

# Submission time Handle Problem Language Result Execution time Memory
428765 2021-06-15T14:20:21 Z Keshi Carnival Tickets (IOI20_tickets) C++17
100 / 100
1024 ms 67772 KB
//In the name of God
#include <bits/stdc++.h>
#include "tickets.h"
using namespace std;

typedef int ll;
typedef pair<ll, ll> pll;

const ll maxn = 1510;
const ll mod = 1e9 + 7;
const ll inf = 1e9;

#define fast_io ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define Mp make_pair
#define F first
#define S second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define Sz(x) ll((x).size())

ll cnt[maxn], cn[maxn];
vector<ll> c2[maxn];
bool vis[maxn][maxn];

long long find_maximum(int k, vector<vector<int>> a) {
	ll n = Sz(a);
	ll m = Sz(a[0]);
	vector<vector<int>> answer(n);
	long long ans = 0;
	vector<pll> vec;
	for(ll i = 0; i < n; i++){
		answer[i].resize(m, -1);
		cn[i] = m - 1;
		for(ll j = 0; j < k; j++){
			ans -= a[i][j];
			vec.pb(Mp(a[i][j] + a[i][m - k + j], i));
		}
	}
	sort(all(vec), greater<pll>());
	for(ll i = 0; i < n * k / 2; i++){
		if(cnt[vec[i].S] == k) continue;
		cnt[vec[i].S]++;
		ans += vec[i].F;
	}
	vector<pll> b;
	for(ll i = 0; i < n; i++){
		c2[cnt[i]].pb(i);
		b.pb(Mp(cnt[i], i));
	}
	for(ll i = 0; i < k; i++){
		sort(all(b), greater<pll>());
		for(ll j = 0; j < n / 2; j++){
			answer[b[j].S][cn[b[j].S]--] = i;
			b[j].F--;
		}
	}
	for(ll i = 0; i < n; i++){
		for(ll j = 0; j < m; j++){
			if(~answer[i][j]) vis[i][answer[i][j]] = 1;
		}
		cn[i] = 0;
		for(ll j = 0; j < k; j++){
			if(!vis[i][j]) answer[i][cn[i]++] = j;
		}
	}
	allocate_tickets(answer);
	return ans;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 2 ms 716 KB Output is correct
6 Correct 4 ms 2656 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 3 ms 608 KB Output is correct
5 Correct 36 ms 3660 KB Output is correct
6 Correct 678 ms 56556 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 3 ms 588 KB Output is correct
5 Correct 26 ms 3032 KB Output is correct
6 Correct 686 ms 59880 KB Output is correct
7 Correct 706 ms 63012 KB Output is correct
8 Correct 5 ms 716 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 8 ms 1108 KB Output is correct
13 Correct 23 ms 3100 KB Output is correct
14 Correct 29 ms 2584 KB Output is correct
15 Correct 711 ms 65372 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 3 ms 716 KB Output is correct
5 Correct 39 ms 4168 KB Output is correct
6 Correct 7 ms 988 KB Output is correct
7 Correct 9 ms 3404 KB Output is correct
8 Correct 976 ms 67772 KB Output is correct
9 Correct 947 ms 64496 KB Output is correct
10 Correct 950 ms 63664 KB Output is correct
11 Correct 1018 ms 67368 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 3 ms 588 KB Output is correct
3 Correct 3 ms 588 KB Output is correct
4 Correct 3 ms 672 KB Output is correct
5 Correct 4 ms 588 KB Output is correct
6 Correct 3 ms 716 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 4 ms 588 KB Output is correct
10 Correct 5 ms 632 KB Output is correct
11 Correct 4 ms 588 KB Output is correct
12 Correct 3 ms 608 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 3 ms 588 KB Output is correct
3 Correct 3 ms 588 KB Output is correct
4 Correct 3 ms 672 KB Output is correct
5 Correct 4 ms 588 KB Output is correct
6 Correct 3 ms 716 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 4 ms 588 KB Output is correct
10 Correct 5 ms 632 KB Output is correct
11 Correct 4 ms 588 KB Output is correct
12 Correct 3 ms 608 KB Output is correct
13 Correct 27 ms 3664 KB Output is correct
14 Correct 27 ms 3660 KB Output is correct
15 Correct 38 ms 3908 KB Output is correct
16 Correct 42 ms 4116 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 4 ms 972 KB Output is correct
19 Correct 2 ms 860 KB Output is correct
20 Correct 32 ms 3344 KB Output is correct
21 Correct 32 ms 3732 KB Output is correct
22 Correct 47 ms 3516 KB Output is correct
23 Correct 39 ms 3940 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 2 ms 716 KB Output is correct
6 Correct 4 ms 2656 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 3 ms 608 KB Output is correct
11 Correct 36 ms 3660 KB Output is correct
12 Correct 678 ms 56556 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 3 ms 588 KB Output is correct
17 Correct 26 ms 3032 KB Output is correct
18 Correct 686 ms 59880 KB Output is correct
19 Correct 706 ms 63012 KB Output is correct
20 Correct 5 ms 716 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 8 ms 1108 KB Output is correct
25 Correct 23 ms 3100 KB Output is correct
26 Correct 29 ms 2584 KB Output is correct
27 Correct 711 ms 65372 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 3 ms 716 KB Output is correct
32 Correct 39 ms 4168 KB Output is correct
33 Correct 7 ms 988 KB Output is correct
34 Correct 9 ms 3404 KB Output is correct
35 Correct 976 ms 67772 KB Output is correct
36 Correct 947 ms 64496 KB Output is correct
37 Correct 950 ms 63664 KB Output is correct
38 Correct 1018 ms 67368 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 3 ms 588 KB Output is correct
41 Correct 3 ms 588 KB Output is correct
42 Correct 3 ms 672 KB Output is correct
43 Correct 4 ms 588 KB Output is correct
44 Correct 3 ms 716 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 1 ms 460 KB Output is correct
47 Correct 4 ms 588 KB Output is correct
48 Correct 5 ms 632 KB Output is correct
49 Correct 4 ms 588 KB Output is correct
50 Correct 3 ms 608 KB Output is correct
51 Correct 27 ms 3664 KB Output is correct
52 Correct 27 ms 3660 KB Output is correct
53 Correct 38 ms 3908 KB Output is correct
54 Correct 42 ms 4116 KB Output is correct
55 Correct 1 ms 332 KB Output is correct
56 Correct 4 ms 972 KB Output is correct
57 Correct 2 ms 860 KB Output is correct
58 Correct 32 ms 3344 KB Output is correct
59 Correct 32 ms 3732 KB Output is correct
60 Correct 47 ms 3516 KB Output is correct
61 Correct 39 ms 3940 KB Output is correct
62 Correct 75 ms 9252 KB Output is correct
63 Correct 79 ms 9224 KB Output is correct
64 Correct 104 ms 10404 KB Output is correct
65 Correct 429 ms 30412 KB Output is correct
66 Correct 524 ms 34312 KB Output is correct
67 Correct 9 ms 3404 KB Output is correct
68 Correct 6 ms 972 KB Output is correct
69 Correct 694 ms 58040 KB Output is correct
70 Correct 844 ms 55680 KB Output is correct
71 Correct 976 ms 64524 KB Output is correct
72 Correct 938 ms 61788 KB Output is correct
73 Correct 1024 ms 61140 KB Output is correct
74 Correct 733 ms 54732 KB Output is correct
75 Correct 800 ms 54340 KB Output is correct