oj.uz

Submission #747293

# Submission time Handle Problem Language Result Execution time Memory
747293 2023-05-24T04:06:38 Z CSQ31 Carnival Tickets (IOI20_tickets) C++17
100 / 100
 939 ms 107508 KB 
#include "tickets.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
int mark[2000][2000];
vector<pii>tic[2000];
long long find_maximum(int k, std::vector<std::vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	vii answer(n);
	ll ans = 0;
	for(int i=0;i<n;i++)answer[i].assign(m,-1);
	
	vector<int>idx(n,k-1); //all k are minus
	priority_queue<pii>pq;
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			tic[i].pb({x[i][j],j});
		}
		sort(all(tic[i]));
		for(int j=0;j<k;j++){
			ans-=tic[i][j].fi;
			mark[i][tic[i][j].se] = -1;
		}
		pq.push({tic[i][m-1].fi + tic[i][k-1].fi,i});
	}
	
	for(int i=0;i<n*k/2;i++){
		ans+=pq.top().fi;
		int v = pq.top().se;
		int j = idx[v];
		
		pq.pop();
		mark[v][tic[v][j].se] = 0;
		mark[v][tic[v][m-(k-j)].se] = 1;
		idx[v]--;
		j--;
		if(j>=0){
			pq.push({tic[v][j].fi + tic[v][m-(k-j)].fi,v});
		}
		
	}
	/*
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			cout<<mark[i][j]<<" ";	
		}
		cout<<'\n';
	}*/
	
	vector<int>colsum(m,0);
	vii row(n);
	for(int i=0;i<n;i++){
		int z = 0;
		for(int j=0;j<m;j++){
			//cout<<mark[i][j]<<" ";
			if(mark[i][j]){
				colsum[z++]+=mark[i][j];
				row[i].pb(j);
			}
		}
		//cout<<'\n';
	}
	for(int i=0;i<n;i++){
		vector<int>pos,neg;
		for(int j=0;j<sz(row[i]);j++){
			int jj = row[i][j];
			if(mark[i][jj] == -1 && colsum[j] < 0)neg.pb(j);
			if(mark[i][jj] == 1  && colsum[j] > 0)pos.pb(j);
		}
		while(!neg.empty() && !pos.empty()){
			int v = neg.back();
			int u = pos.back();
			neg.pop_back();
			pos.pop_back();
			swap(row[i][v],row[i][u]);
			colsum[v]+=2;
			colsum[u]-=2;
		}
	}
	for(int i=0;i<n;i++){
		for(int j=0;j<sz(row[i]);j++){
				answer[i][row[i][j]] = j;
		}
	}
	allocate_tickets(answer);
	return ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 356 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 1620 KB Output is correct
6 Correct 4 ms 6928 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 4 ms 980 KB Output is correct
5 Correct 24 ms 5864 KB Output is correct
6 Correct 776 ms 85480 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 3 ms 980 KB Output is correct
5 Correct 27 ms 5596 KB Output is correct
6 Correct 547 ms 97856 KB Output is correct
7 Correct 577 ms 98540 KB Output is correct
8 Correct 4 ms 1108 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 10 ms 1876 KB Output is correct
13 Correct 20 ms 5740 KB Output is correct
14 Correct 19 ms 4080 KB Output is correct
15 Correct 619 ms 105200 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 352 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 3 ms 1004 KB Output is correct
5 Correct 31 ms 6696 KB Output is correct
6 Correct 5 ms 1108 KB Output is correct
7 Correct 13 ms 7380 KB Output is correct
8 Correct 840 ms 103376 KB Output is correct
9 Correct 855 ms 98324 KB Output is correct
10 Correct 939 ms 96584 KB Output is correct
11 Correct 775 ms 103232 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 356 KB Output is correct
2 Correct 3 ms 980 KB Output is correct
3 Correct 3 ms 980 KB Output is correct
4 Correct 3 ms 980 KB Output is correct
5 Correct 2 ms 936 KB Output is correct
6 Correct 3 ms 980 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 2 ms 980 KB Output is correct
10 Correct 3 ms 1004 KB Output is correct
11 Correct 3 ms 1004 KB Output is correct
12 Correct 3 ms 980 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 356 KB Output is correct
2 Correct 3 ms 980 KB Output is correct
3 Correct 3 ms 980 KB Output is correct
4 Correct 3 ms 980 KB Output is correct
5 Correct 2 ms 936 KB Output is correct
6 Correct 3 ms 980 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 2 ms 980 KB Output is correct
10 Correct 3 ms 1004 KB Output is correct
11 Correct 3 ms 1004 KB Output is correct
12 Correct 3 ms 980 KB Output is correct
13 Correct 23 ms 5868 KB Output is correct
14 Correct 24 ms 6012 KB Output is correct
15 Correct 28 ms 6264 KB Output is correct
16 Correct 29 ms 6700 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 4 ms 1900 KB Output is correct
19 Correct 2 ms 1620 KB Output is correct
20 Correct 26 ms 5752 KB Output is correct
21 Correct 27 ms 6172 KB Output is correct
22 Correct 27 ms 6100 KB Output is correct
23 Correct 28 ms 6476 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 356 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 1620 KB Output is correct
6 Correct 4 ms 6928 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 4 ms 980 KB Output is correct
11 Correct 24 ms 5864 KB Output is correct
12 Correct 776 ms 85480 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 3 ms 980 KB Output is correct
17 Correct 27 ms 5596 KB Output is correct
18 Correct 547 ms 97856 KB Output is correct
19 Correct 577 ms 98540 KB Output is correct
20 Correct 4 ms 1108 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 10 ms 1876 KB Output is correct
25 Correct 20 ms 5740 KB Output is correct
26 Correct 19 ms 4080 KB Output is correct
27 Correct 619 ms 105200 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 352 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 3 ms 1004 KB Output is correct
32 Correct 31 ms 6696 KB Output is correct
33 Correct 5 ms 1108 KB Output is correct
34 Correct 13 ms 7380 KB Output is correct
35 Correct 840 ms 103376 KB Output is correct
36 Correct 855 ms 98324 KB Output is correct
37 Correct 939 ms 96584 KB Output is correct
38 Correct 775 ms 103232 KB Output is correct
39 Correct 1 ms 356 KB Output is correct
40 Correct 3 ms 980 KB Output is correct
41 Correct 3 ms 980 KB Output is correct
42 Correct 3 ms 980 KB Output is correct
43 Correct 2 ms 936 KB Output is correct
44 Correct 3 ms 980 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 596 KB Output is correct
47 Correct 2 ms 980 KB Output is correct
48 Correct 3 ms 1004 KB Output is correct
49 Correct 3 ms 1004 KB Output is correct
50 Correct 3 ms 980 KB Output is correct
51 Correct 23 ms 5868 KB Output is correct
52 Correct 24 ms 6012 KB Output is correct
53 Correct 28 ms 6264 KB Output is correct
54 Correct 29 ms 6700 KB Output is correct
55 Correct 1 ms 468 KB Output is correct
56 Correct 4 ms 1900 KB Output is correct
57 Correct 2 ms 1620 KB Output is correct
58 Correct 26 ms 5752 KB Output is correct
59 Correct 27 ms 6172 KB Output is correct
60 Correct 27 ms 6100 KB Output is correct
61 Correct 28 ms 6476 KB Output is correct
62 Correct 61 ms 13260 KB Output is correct
63 Correct 65 ms 13544 KB Output is correct
64 Correct 76 ms 14716 KB Output is correct
65 Correct 289 ms 51068 KB Output is correct
66 Correct 325 ms 53612 KB Output is correct
67 Correct 11 ms 7380 KB Output is correct
68 Correct 5 ms 1056 KB Output is correct
69 Correct 575 ms 87076 KB Output is correct
70 Correct 655 ms 96820 KB Output is correct
71 Correct 739 ms 104812 KB Output is correct
72 Correct 613 ms 107508 KB Output is correct
73 Correct 712 ms 101136 KB Output is correct
74 Correct 549 ms 99720 KB Output is correct
75 Correct 624 ms 93336 KB Output is correct