oj.uz

답안 #557202

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
557202 2022-05-04T21:04:50 Z czhang2718 카니발 티켓 (IOI20_tickets) C++17
100 / 100
 1128 ms 132848 KB 
#include "tickets.h"
#include "bits/stdc++.h"

using namespace std;

#define rep(i,a,b) for(int i=a; i<=b; i++)
#define all(x) x.begin(),x.end()
#define sz(x) int(x.size())
#define pb push_back
typedef vector<int> vi;
typedef pair<int,int> pii;
#define f first
#define s second

const int N=1501;
bool use[N][N];

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;
	for (int i = 0; i < n; i++) {
		std::vector<int> row(m, -1);
		answer.push_back(row);
	}

	vector<int> cnt(n);
	vector<pii> inc;
	rep(i,0,n-1){
		rep(j,0,k-1){
			inc.pb({x[i][m-1-j]+x[i][k-1-j], i});
			use[i][j]=1;
		}
	}
	sort(all(inc), greater<pii>());

	rep(t,1,n*k/2){
		auto p=inc[t-1];
		// cout << "switch " << p.s << " " << k-1-cnt[p.s] << "->" << m-1-cnt[p.s] << '\n';
		use[p.s][k-1-cnt[p.s]]=0;
		use[p.s][m-1-cnt[p.s]]=1;
		cnt[p.s]++;
	}

	vector<pair<int, pii>> vec;
	rep(i,0,n-1) rep(j,0,m-1){
		if(use[i][j]) vec.pb({x[i][j], {i,j}});
	}
	sort(all(vec));
	long long sum=0;
	rep(i,1,n*k){
		if(i<=n*k/2) sum-=vec[i-1].f;
		else sum+=vec[i-1].f;
	}
	auto L=vec[n*k/2];

	vector<vi> big(n), small(n);
	vi v[3];
	rep(i,0,n-1){
		rep(j,0,m-1){
			if(!use[i][j]) continue;
			if(make_pair(x[i][j], make_pair(i,j))>=L) big[i].pb(j);
			else small[i].pb(j);
		}
		if(sz(big[i]) && sz(small[i])) v[2].pb(i);
		else if(sz(big[i])) v[1].pb(i);
		else v[0].pb(i);
	}

	rep(t,0,k-1){
		int a=0, b=0;
		vi put_back;

		// small
		int A=sz(v[0]);
		rep(i,1,min(A,n/2)){
			a++;
			int j=v[0].back();
			v[0].pop_back();
			answer[j][small[j].back()]=t;
			small[j].pop_back();
			if(sz(small[j])) put_back.pb(j);
		}
		for(int i:put_back) v[0].pb(i);

		// big
		put_back.clear();
		int B=sz(v[1]);
		rep(i,1,min(B,n/2)){
			b++;
			int j=v[1].back();
			v[1].pop_back();
			answer[j][big[j].back()]=t;
			big[j].pop_back();
			if(sz(big[j])) put_back.pb(j);
		}
		for(int i:put_back) v[1].pb(i);

		// both
		put_back.clear();
		rep(i,1,n/2-a){
			int j=v[2].back();
			v[2].pop_back();
			answer[j][small[j].back()]=t;
			small[j].pop_back();
			if(sz(small[j]) && sz(big[j])) put_back.pb(j);
			else if(sz(small[j])) v[0].pb(j);
			else v[1].pb(j);
		}

		rep(i,1,n/2-b){
			int j=v[2].back();
			v[2].pop_back();
			answer[j][big[j].back()]=t;
			big[j].pop_back();
			if(sz(small[j]) && sz(big[j])) put_back.pb(j);
			else if(sz(small[j])) v[0].pb(j);
			else v[1].pb(j);
		}
		for(int i:put_back) v[2].pb(i);
	}

	allocate_tickets(answer);
	return sum;
}
// dont know what to do without you

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 440 KB Output is correct
5 Correct 1 ms 852 KB Output is correct
6 Correct 3 ms 3028 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 23 ms 3252 KB Output is correct
6 Correct 522 ms 54244 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 3 ms 596 KB Output is correct
5 Correct 32 ms 3936 KB Output is correct
6 Correct 677 ms 75548 KB Output is correct
7 Correct 699 ms 85692 KB Output is correct
8 Correct 4 ms 916 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 7 ms 1428 KB Output is correct
13 Correct 23 ms 4024 KB Output is correct
14 Correct 23 ms 3724 KB Output is correct
15 Correct 758 ms 96672 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 3 ms 724 KB Output is correct
5 Correct 40 ms 5752 KB Output is correct
6 Correct 7 ms 1136 KB Output is correct
7 Correct 9 ms 3668 KB Output is correct
8 Correct 1122 ms 125440 KB Output is correct
9 Correct 1020 ms 132848 KB Output is correct
10 Correct 1012 ms 125492 KB Output is correct
11 Correct 1058 ms 124884 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 580 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 2 ms 704 KB Output is correct
5 Correct 3 ms 708 KB Output is correct
6 Correct 3 ms 708 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 3 ms 704 KB Output is correct
10 Correct 3 ms 724 KB Output is correct
11 Correct 3 ms 724 KB Output is correct
12 Correct 3 ms 724 KB Output is correct

Subtask #6
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 580 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 2 ms 704 KB Output is correct
5 Correct 3 ms 708 KB Output is correct
6 Correct 3 ms 708 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 3 ms 704 KB Output is correct
10 Correct 3 ms 724 KB Output is correct
11 Correct 3 ms 724 KB Output is correct
12 Correct 3 ms 724 KB Output is correct
13 Correct 24 ms 3744 KB Output is correct
14 Correct 21 ms 3804 KB Output is correct
15 Correct 38 ms 4544 KB Output is correct
16 Correct 42 ms 5736 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 3 ms 1092 KB Output is correct
19 Correct 2 ms 852 KB Output is correct
20 Correct 32 ms 4296 KB Output is correct
21 Correct 30 ms 4760 KB Output is correct
22 Correct 40 ms 5096 KB Output is correct
23 Correct 42 ms 5568 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 440 KB Output is correct
5 Correct 1 ms 852 KB Output is correct
6 Correct 3 ms 3028 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 308 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 23 ms 3252 KB Output is correct
12 Correct 522 ms 54244 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 3 ms 596 KB Output is correct
17 Correct 32 ms 3936 KB Output is correct
18 Correct 677 ms 75548 KB Output is correct
19 Correct 699 ms 85692 KB Output is correct
20 Correct 4 ms 916 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 7 ms 1428 KB Output is correct
25 Correct 23 ms 4024 KB Output is correct
26 Correct 23 ms 3724 KB Output is correct
27 Correct 758 ms 96672 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 3 ms 724 KB Output is correct
32 Correct 40 ms 5752 KB Output is correct
33 Correct 7 ms 1136 KB Output is correct
34 Correct 9 ms 3668 KB Output is correct
35 Correct 1122 ms 125440 KB Output is correct
36 Correct 1020 ms 132848 KB Output is correct
37 Correct 1012 ms 125492 KB Output is correct
38 Correct 1058 ms 124884 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 2 ms 580 KB Output is correct
41 Correct 2 ms 596 KB Output is correct
42 Correct 2 ms 704 KB Output is correct
43 Correct 3 ms 708 KB Output is correct
44 Correct 3 ms 708 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 468 KB Output is correct
47 Correct 3 ms 704 KB Output is correct
48 Correct 3 ms 724 KB Output is correct
49 Correct 3 ms 724 KB Output is correct
50 Correct 3 ms 724 KB Output is correct
51 Correct 24 ms 3744 KB Output is correct
52 Correct 21 ms 3804 KB Output is correct
53 Correct 38 ms 4544 KB Output is correct
54 Correct 42 ms 5736 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 3 ms 1092 KB Output is correct
57 Correct 2 ms 852 KB Output is correct
58 Correct 32 ms 4296 KB Output is correct
59 Correct 30 ms 4760 KB Output is correct
60 Correct 40 ms 5096 KB Output is correct
61 Correct 42 ms 5568 KB Output is correct
62 Correct 57 ms 9224 KB Output is correct
63 Correct 57 ms 9296 KB Output is correct
64 Correct 104 ms 14640 KB Output is correct
65 Correct 344 ms 43688 KB Output is correct
66 Correct 461 ms 55572 KB Output is correct
67 Correct 11 ms 3636 KB Output is correct
68 Correct 6 ms 1064 KB Output is correct
69 Correct 540 ms 58176 KB Output is correct
70 Correct 849 ms 79496 KB Output is correct
71 Correct 1128 ms 124984 KB Output is correct
72 Correct 996 ms 126836 KB Output is correct
73 Correct 972 ms 100996 KB Output is correct
74 Correct 739 ms 83440 KB Output is correct
75 Correct 790 ms 78472 KB Output is correct