oj.uz

Submission #414640

# Submission time Handle Problem Language Result Execution time Memory
414640 2021-05-30T19:18:54 Z cfalas Carnival Tickets (IOI20_tickets) C++14
100 / 100
 2219 ms 110916 KB 
#include "tickets.h"
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define INF 10000000
#define MOD 1000000007
#define MID ((l+r)/2)
#define HASHMOD 2305843009213693951
#define ll long long
#define ull unsigned long long
#define F first
#define S second
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef map<int, int> mii;

#define EPS 1e-6
#define FOR(i,n) for(int i=0;i<((int)(n));i++)
#define FORi(i,a,b) for(int i=((int)(a));i<((int)(b));i++)
#define FOA(v, a) for(auto v : a)

#define MINUS 2*MOD+2
#define PLUS MOD+1

long long find_maximum(int k, std::vector<std::vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	vector<vi> answer(n);
	answer.assign(n, vector<int>(m, -1));

	ll ans=0;

	vector<priority_queue<ii> > minus(n), unused(n);
	FOR(i,n){
		vii b;
		FOR(j,m) b.push_back({x[i][j], j}), unused[i].push({x[i][j], j});
		sort(b.begin(), b.end());
		FOR(j,k){
			answer[i][b[j].S] = MINUS;
			ans-=x[i][b[j].S];
			minus[i].push({x[i][b[j].S], b[j].S});
			//unused[i].erase({x[i][b[j].S], b[j].S});
		}
	}
	set<ii> maxa;
	FOR(i,n){
		if(minus[i].size() && unused[i].size())
		maxa.insert({ - ((unused[i].top()).F + (minus[i].top()).F), i});
	}
	FOR(step, n*k/2){
		ans -= (*maxa.begin()).F;
		ll i = (*maxa.begin()).S;
		maxa.erase(maxa.begin());

		// change from - to unused
		answer[i][(minus[i].top()).S] = -1;
		//unused[i].insert(*minus[i].rbegin());
		minus[i].pop();

		// change from unused to +
		answer[i][(unused[i].top()).S] = PLUS;
		unused[i].pop();
		
		if(minus[i].size() && unused[i].size())
			maxa.insert({ - ((unused[i].top()).F + (minus[i].top()).F), i});

		/*
		cout<<ans<<endl;
		FOR(i,n){
			FOR(j,m){
				if(answer[i][j]>=MINUS) cout<<" - ";
				else if(answer[i][j]>=PLUS && answer[i][j]<=MINUS) cout<<" + ";
				else cout<<answer[i][j]<<" ";
			}
			cout<<endl;
		}
		cout<<endl;
		*/
	}
	cerr<<"HERE"<<endl;

	set<ii> pc;
	vector<queue<int> > plus(n);
	FOR(i,n){
		int p=0;
		FOR(j,m) if(answer[i][j]==PLUS) p++, plus[i].push(j);
		pc.insert({-p,i});
	}
	FOR(rnd,k){
		set<int> used;
		int cnt=0;
		set<ii> pc_n;
		FOA(v,pc){
			if(cnt>=n/2) break;
			int i = v.S;

			used.insert(i);
			answer[i][plus[i].front()] = rnd;
			plus[i].pop();

			ii v_n = v;
			v_n.F++;
			pc_n.insert(v_n);

			cnt++;
		}
		//cout<<endl;
		FOR(i,n/2) pc.erase(pc.begin());
		FOA(v, pc_n) pc.insert(v);

		/*
		FOR(i,n){
			FOR(j,m){
				if(answer[i][j]>=MINUS) cout<<" - ";
				else if(answer[i][j]>=PLUS && answer[i][j]<=MINUS) cout<<" + ";
				else cout<<answer[i][j]<<" ";
			}
			cout<<endl;
		}
		cout<<endl;
		*/

		FOR(i,n){
			if(!used.count(i)){
				if(minus[i].empty()) continue;
				ii v = minus[i].top();
				answer[i][v.S] = rnd;
				minus[i].pop();
			}
		}
		/*
		FOR(i,n){
			FOR(j,m) cout<<answer[i][j]<<" ";
			cout<<endl;
		}*/
	}
	
	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 332 KB Output is correct
5 Correct 1 ms 588 KB Output is correct
6 Correct 4 ms 1996 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 588 KB Output is correct
5 Correct 31 ms 3828 KB Output is correct
6 Correct 732 ms 76404 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 4 ms 588 KB Output is correct
5 Correct 44 ms 4412 KB Output is correct
6 Correct 1217 ms 91464 KB Output is correct
7 Correct 1368 ms 92752 KB Output is correct
8 Correct 7 ms 716 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 13 ms 1360 KB Output is correct
13 Correct 41 ms 4040 KB Output is correct
14 Correct 43 ms 3424 KB Output is correct
15 Correct 1452 ms 101556 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 5 ms 676 KB Output is correct
5 Correct 67 ms 5316 KB Output is correct
6 Correct 10 ms 972 KB Output is correct
7 Correct 14 ms 2468 KB Output is correct
8 Correct 2206 ms 106948 KB Output is correct
9 Correct 2063 ms 101000 KB Output is correct
10 Correct 2084 ms 100264 KB Output is correct
11 Correct 2161 ms 107532 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 588 KB Output is correct
3 Correct 3 ms 588 KB Output is correct
4 Correct 4 ms 588 KB Output is correct
5 Correct 4 ms 588 KB Output is correct
6 Correct 5 ms 588 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 5 ms 588 KB Output is correct
10 Correct 4 ms 588 KB Output is correct
11 Correct 5 ms 588 KB Output is correct
12 Correct 5 ms 588 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 588 KB Output is correct
3 Correct 3 ms 588 KB Output is correct
4 Correct 4 ms 588 KB Output is correct
5 Correct 4 ms 588 KB Output is correct
6 Correct 5 ms 588 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 5 ms 588 KB Output is correct
10 Correct 4 ms 588 KB Output is correct
11 Correct 5 ms 588 KB Output is correct
12 Correct 5 ms 588 KB Output is correct
13 Correct 31 ms 3784 KB Output is correct
14 Correct 32 ms 3808 KB Output is correct
15 Correct 57 ms 4504 KB Output is correct
16 Correct 67 ms 5216 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 4 ms 716 KB Output is correct
19 Correct 2 ms 588 KB Output is correct
20 Correct 53 ms 4336 KB Output is correct
21 Correct 55 ms 4204 KB Output is correct
22 Correct 82 ms 5048 KB Output is correct
23 Correct 65 ms 4932 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 332 KB Output is correct
5 Correct 1 ms 588 KB Output is correct
6 Correct 4 ms 1996 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 588 KB Output is correct
11 Correct 31 ms 3828 KB Output is correct
12 Correct 732 ms 76404 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 4 ms 588 KB Output is correct
17 Correct 44 ms 4412 KB Output is correct
18 Correct 1217 ms 91464 KB Output is correct
19 Correct 1368 ms 92752 KB Output is correct
20 Correct 7 ms 716 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 13 ms 1360 KB Output is correct
25 Correct 41 ms 4040 KB Output is correct
26 Correct 43 ms 3424 KB Output is correct
27 Correct 1452 ms 101556 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 5 ms 676 KB Output is correct
32 Correct 67 ms 5316 KB Output is correct
33 Correct 10 ms 972 KB Output is correct
34 Correct 14 ms 2468 KB Output is correct
35 Correct 2206 ms 106948 KB Output is correct
36 Correct 2063 ms 101000 KB Output is correct
37 Correct 2084 ms 100264 KB Output is correct
38 Correct 2161 ms 107532 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 3 ms 588 KB Output is correct
41 Correct 3 ms 588 KB Output is correct
42 Correct 4 ms 588 KB Output is correct
43 Correct 4 ms 588 KB Output is correct
44 Correct 5 ms 588 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 2 ms 332 KB Output is correct
47 Correct 5 ms 588 KB Output is correct
48 Correct 4 ms 588 KB Output is correct
49 Correct 5 ms 588 KB Output is correct
50 Correct 5 ms 588 KB Output is correct
51 Correct 31 ms 3784 KB Output is correct
52 Correct 32 ms 3808 KB Output is correct
53 Correct 57 ms 4504 KB Output is correct
54 Correct 67 ms 5216 KB Output is correct
55 Correct 2 ms 332 KB Output is correct
56 Correct 4 ms 716 KB Output is correct
57 Correct 2 ms 588 KB Output is correct
58 Correct 53 ms 4336 KB Output is correct
59 Correct 55 ms 4204 KB Output is correct
60 Correct 82 ms 5048 KB Output is correct
61 Correct 65 ms 4932 KB Output is correct
62 Correct 83 ms 10820 KB Output is correct
63 Correct 87 ms 10948 KB Output is correct
64 Correct 211 ms 13308 KB Output is correct
65 Correct 628 ms 45848 KB Output is correct
66 Correct 883 ms 51216 KB Output is correct
67 Correct 14 ms 2636 KB Output is correct
68 Correct 10 ms 1100 KB Output is correct
69 Correct 784 ms 76448 KB Output is correct
70 Correct 1410 ms 91800 KB Output is correct
71 Correct 2219 ms 107316 KB Output is correct
72 Correct 1884 ms 110916 KB Output is correct
73 Correct 2008 ms 102056 KB Output is correct
74 Correct 1302 ms 89648 KB Output is correct
75 Correct 1431 ms 95808 KB Output is correct