oj.uz

Submission #355452

# Submission time Handle Problem Language Result Execution time Memory
355452 2021-01-22T13:48:17 Z ryansee Carnival Tickets (IOI20_tickets) C++14
100 / 100
 1145 ms 173352 KB 
#include "tickets.h"
 
#include "bits/stdc++.h"
using namespace std;
 
#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define cbr cerr<<"hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ll(x.size())
#define all(x) (x).begin(), (x).end()
#define lbd(x,y) (lower_bound(all(x),y)-x.begin())
#define ubd(x,y) (upper_bound(all(x),y)-x.begin())
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());    //can be used by calling rng() or shuffle(A, A+n, rng)
inline long long rand(long long x, long long y) { return rng() % (y+1-x) + x; } //inclusivesss
string inline to_string(char c) {string s(1,c);return s;} template<typename T> inline T gcd(T a,T b){ return a==0?llabs(b):gcd(b%a,a); }
 
using ll=long long; 
using ld=long double;
#define FOR(i,s,e) for(ll i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
using pi=pair<ll,ll>; using spi=pair<ll,pi>; using dpi=pair<pi,pi>; 
 
long long LLINF = 1e18;
int INF = 1e9+1e6;
#define MAXN (200006)
 
int n, m;
ll ans, l=1e9;
 
long long find_maximum(int k, std::vector<std::vector<int>> x) {
	n = x.size(), m = x[0].size(), ans = l * (n/2) * k;
	vector<vector<int>> ret(n, vector<int>(m, -1));
	vector<vector<int>> f(n, vector<int>(m, -1));
	vector<tuple<ll,ll,ll,ll>> v;
	FOR(i,0,n-1) {
		FOR(j,0,k-1) {
			f[i][j] = 0;
			ans -= x[i][j];
		}
		ll co = m-1;
		DEC(j,k-1,0) {
			v.pb({x[i][j]-l+x[i][co], i, j, co});
			-- co;
		}
	}
	sort(all(v), [](tuple<ll,ll,ll,ll> x,tuple<ll,ll,ll,ll> y){
		if(get<0>(x) ^ get<0>(y)) return get<0>(x) > get<0>(y);
		else return get<2>(x) > get<2>(y);
	});
	FOR(ii,0,(n/2)*k-1) {
		ll i=get<1>(v[ii]), j=get<2>(v[ii]), k=get<3>(v[ii]);
		ans += get<0>(v[ii]);
		f[i][j] = -1, f[i][k] = 1;
	}
	vector<ll> fr(k, n/2), bk(k, n/2);
	FOR(i,0,n-1) {
		ll co=0, co2=m-1;
		vector<int> ind;
		FOR(K,0,k-1) ind.eb(K);
		sort(all(ind), [&](int x,int y){return fr[x]>fr[y];});
		for(auto K:ind) {
			if(fr[K] && f[i][co]==0) {
				ret[i][co]=K, -- fr[K], ++ co;
			} else {
				assert(bk[K] && f[i][co2] == 1);
				ret[i][co2]=K, -- bk[K], -- co2;
			}
		}
	}
	allocate_tickets(ret);
	return ans;
}

Subtask #1
11.0 / 11.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 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 2 ms 876 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 27 ms 2796 KB Output is correct
6 Correct 672 ms 60268 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 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 3 ms 704 KB Output is correct
5 Correct 29 ms 4064 KB Output is correct
6 Correct 747 ms 106000 KB Output is correct
7 Correct 800 ms 106032 KB Output is correct
8 Correct 5 ms 1128 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 364 KB Output is correct
12 Correct 8 ms 1388 KB Output is correct
13 Correct 26 ms 3936 KB Output is correct
14 Correct 27 ms 4188 KB Output is correct
15 Correct 861 ms 114380 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 4 ms 880 KB Output is correct
5 Correct 43 ms 6876 KB Output is correct
6 Correct 7 ms 1392 KB Output is correct
7 Correct 8 ms 1512 KB Output is correct
8 Correct 1134 ms 167996 KB Output is correct
9 Correct 1056 ms 165324 KB Output is correct
10 Correct 1028 ms 165332 KB Output is correct
11 Correct 1145 ms 167756 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 492 KB Output is correct
3 Correct 3 ms 492 KB Output is correct
4 Correct 3 ms 748 KB Output is correct
5 Correct 3 ms 748 KB Output is correct
6 Correct 3 ms 876 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 4 ms 748 KB Output is correct
10 Correct 3 ms 748 KB Output is correct
11 Correct 3 ms 876 KB Output is correct
12 Correct 3 ms 876 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 492 KB Output is correct
3 Correct 3 ms 492 KB Output is correct
4 Correct 3 ms 748 KB Output is correct
5 Correct 3 ms 748 KB Output is correct
6 Correct 3 ms 876 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 4 ms 748 KB Output is correct
10 Correct 3 ms 748 KB Output is correct
11 Correct 3 ms 876 KB Output is correct
12 Correct 3 ms 876 KB Output is correct
13 Correct 28 ms 3692 KB Output is correct
14 Correct 28 ms 3596 KB Output is correct
15 Correct 35 ms 4832 KB Output is correct
16 Correct 42 ms 6876 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 3 ms 748 KB Output is correct
19 Correct 2 ms 620 KB Output is correct
20 Correct 36 ms 4708 KB Output is correct
21 Correct 36 ms 5092 KB Output is correct
22 Correct 37 ms 6244 KB Output is correct
23 Correct 39 ms 6784 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 0 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 2 ms 876 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 3 ms 492 KB Output is correct
11 Correct 27 ms 2796 KB Output is correct
12 Correct 672 ms 60268 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 3 ms 704 KB Output is correct
17 Correct 29 ms 4064 KB Output is correct
18 Correct 747 ms 106000 KB Output is correct
19 Correct 800 ms 106032 KB Output is correct
20 Correct 5 ms 1128 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 364 KB Output is correct
24 Correct 8 ms 1388 KB Output is correct
25 Correct 26 ms 3936 KB Output is correct
26 Correct 27 ms 4188 KB Output is correct
27 Correct 861 ms 114380 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 4 ms 880 KB Output is correct
32 Correct 43 ms 6876 KB Output is correct
33 Correct 7 ms 1392 KB Output is correct
34 Correct 8 ms 1512 KB Output is correct
35 Correct 1134 ms 167996 KB Output is correct
36 Correct 1056 ms 165324 KB Output is correct
37 Correct 1028 ms 165332 KB Output is correct
38 Correct 1145 ms 167756 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 3 ms 492 KB Output is correct
41 Correct 3 ms 492 KB Output is correct
42 Correct 3 ms 748 KB Output is correct
43 Correct 3 ms 748 KB Output is correct
44 Correct 3 ms 876 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 4 ms 748 KB Output is correct
48 Correct 3 ms 748 KB Output is correct
49 Correct 3 ms 876 KB Output is correct
50 Correct 3 ms 876 KB Output is correct
51 Correct 28 ms 3692 KB Output is correct
52 Correct 28 ms 3596 KB Output is correct
53 Correct 35 ms 4832 KB Output is correct
54 Correct 42 ms 6876 KB Output is correct
55 Correct 1 ms 364 KB Output is correct
56 Correct 3 ms 748 KB Output is correct
57 Correct 2 ms 620 KB Output is correct
58 Correct 36 ms 4708 KB Output is correct
59 Correct 36 ms 5092 KB Output is correct
60 Correct 37 ms 6244 KB Output is correct
61 Correct 39 ms 6784 KB Output is correct
62 Correct 77 ms 9452 KB Output is correct
63 Correct 89 ms 9544 KB Output is correct
64 Correct 132 ms 16732 KB Output is correct
65 Correct 389 ms 48056 KB Output is correct
66 Correct 491 ms 63764 KB Output is correct
67 Correct 8 ms 1512 KB Output is correct
68 Correct 7 ms 1392 KB Output is correct
69 Correct 674 ms 60848 KB Output is correct
70 Correct 896 ms 102056 KB Output is correct
71 Correct 1136 ms 167832 KB Output is correct
72 Correct 969 ms 173352 KB Output is correct
73 Correct 1008 ms 116056 KB Output is correct
74 Correct 792 ms 107544 KB Output is correct
75 Correct 894 ms 100912 KB Output is correct