oj.uz

답안 #304993

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
304993 2020-09-22T11:06:44 Z Wu_Ren 카니발 티켓 (IOI20_tickets) C++14
100 / 100
 987 ms 90364 KB 
#include "tickets.h"
#include <bits/stdc++.h>
#define MP make_pair
using namespace std;
bool vis[1510];
void allocate_tickets( std::vector<std::vector<int>> _d);
long long find_maximum(int k, vector<vector<int> >x) {
	int n=x.size();
	int m=x[0].size();
	vector<vector<int> >answer(n,vector<int>(m,-1)),cnt(n,vector<int>(m));
	vector<pair<int,pair<int,int> > >tmp;
	for(int i=0;i<n;i++){
		for(int j=0;j<k;j++){
			cnt[i][j]=-1;
			tmp.push_back(MP(x[i][j]+x[i][m+j-k],MP(i,j)));
		}
	}
	nth_element(tmp.begin(),tmp.begin()+n*k/2,tmp.end());
	for(int i=n*k/2;i<n*k;i++){
		cnt[tmp[i].second.first][tmp[i].second.second]++;
		cnt[tmp[i].second.first][m+tmp[i].second.second-k]++;
	}
	long long ans=0;
	vector<queue<int> >add(n),del(n);
	for(int i=0;i<n;i++) for(int j=0;j<m;j++){
		if(cnt[i][j]<0){
			del[i].push(j);
			ans-=x[i][j];
		}
		if(cnt[i][j]>0){
			add[i].push(j);
			ans+=x[i][j];
		} 
	} 
	for(int j=0;j<k;j++){
		int delta=0;
		for(int i=0;i<n;i++){
			vis[i]=false;
			if(add[i].empty()){
				--delta;
				answer[i][del[i].front()]=j;
				del[i].pop();
				vis[i]=true;
			}
			else if(del[i].empty()){
				++delta;
				answer[i][add[i].front()]=j;
				add[i].pop();
				vis[i]=true;
			}
		}
		for(int i=0;i<n;i++){
			if(vis[i]) continue;
			if(delta<0){
				++delta;
				answer[i][add[i].front()]=j;
				add[i].pop();
			}
			else{
				--delta;
				answer[i][del[i].front()]=j;
				del[i].pop();
			}
		}
	}
	allocate_tickets(answer);
	return ans;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 768 KB Output is correct
6 Correct 4 ms 2816 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 4 ms 640 KB Output is correct
5 Correct 38 ms 3192 KB Output is correct
6 Correct 794 ms 62456 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 3 ms 640 KB Output is correct
5 Correct 28 ms 3708 KB Output is correct
6 Correct 671 ms 71984 KB Output is correct
7 Correct 699 ms 77616 KB Output is correct
8 Correct 4 ms 832 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 7 ms 1216 KB Output is correct
13 Correct 23 ms 3448 KB Output is correct
14 Correct 23 ms 3192 KB Output is correct
15 Correct 709 ms 83252 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 3 ms 640 KB Output is correct
5 Correct 37 ms 4216 KB Output is correct
6 Correct 6 ms 896 KB Output is correct
7 Correct 9 ms 3136 KB Output is correct
8 Correct 980 ms 88868 KB Output is correct
9 Correct 922 ms 84328 KB Output is correct
10 Correct 927 ms 84476 KB Output is correct
11 Correct 987 ms 90364 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 3 ms 640 KB Output is correct
3 Correct 3 ms 640 KB Output is correct
4 Correct 3 ms 640 KB Output is correct
5 Correct 3 ms 640 KB Output is correct
6 Correct 3 ms 696 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 3 ms 640 KB Output is correct
10 Correct 4 ms 640 KB Output is correct
11 Correct 3 ms 640 KB Output is correct
12 Correct 3 ms 640 KB Output is correct

Subtask #6
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 3 ms 640 KB Output is correct
3 Correct 3 ms 640 KB Output is correct
4 Correct 3 ms 640 KB Output is correct
5 Correct 3 ms 640 KB Output is correct
6 Correct 3 ms 696 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 3 ms 640 KB Output is correct
10 Correct 4 ms 640 KB Output is correct
11 Correct 3 ms 640 KB Output is correct
12 Correct 3 ms 640 KB Output is correct
13 Correct 32 ms 3320 KB Output is correct
14 Correct 32 ms 3192 KB Output is correct
15 Correct 34 ms 3452 KB Output is correct
16 Correct 38 ms 4340 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 3 ms 1024 KB Output is correct
19 Correct 2 ms 896 KB Output is correct
20 Correct 28 ms 3568 KB Output is correct
21 Correct 34 ms 3580 KB Output is correct
22 Correct 30 ms 4048 KB Output is correct
23 Correct 36 ms 3952 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 768 KB Output is correct
6 Correct 4 ms 2816 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 4 ms 640 KB Output is correct
11 Correct 38 ms 3192 KB Output is correct
12 Correct 794 ms 62456 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 3 ms 640 KB Output is correct
17 Correct 28 ms 3708 KB Output is correct
18 Correct 671 ms 71984 KB Output is correct
19 Correct 699 ms 77616 KB Output is correct
20 Correct 4 ms 832 KB Output is correct
21 Correct 0 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 0 ms 384 KB Output is correct
24 Correct 7 ms 1216 KB Output is correct
25 Correct 23 ms 3448 KB Output is correct
26 Correct 23 ms 3192 KB Output is correct
27 Correct 709 ms 83252 KB Output is correct
28 Correct 1 ms 256 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 3 ms 640 KB Output is correct
32 Correct 37 ms 4216 KB Output is correct
33 Correct 6 ms 896 KB Output is correct
34 Correct 9 ms 3136 KB Output is correct
35 Correct 980 ms 88868 KB Output is correct
36 Correct 922 ms 84328 KB Output is correct
37 Correct 927 ms 84476 KB Output is correct
38 Correct 987 ms 90364 KB Output is correct
39 Correct 0 ms 256 KB Output is correct
40 Correct 3 ms 640 KB Output is correct
41 Correct 3 ms 640 KB Output is correct
42 Correct 3 ms 640 KB Output is correct
43 Correct 3 ms 640 KB Output is correct
44 Correct 3 ms 696 KB Output is correct
45 Correct 1 ms 384 KB Output is correct
46 Correct 1 ms 512 KB Output is correct
47 Correct 3 ms 640 KB Output is correct
48 Correct 4 ms 640 KB Output is correct
49 Correct 3 ms 640 KB Output is correct
50 Correct 3 ms 640 KB Output is correct
51 Correct 32 ms 3320 KB Output is correct
52 Correct 32 ms 3192 KB Output is correct
53 Correct 34 ms 3452 KB Output is correct
54 Correct 38 ms 4340 KB Output is correct
55 Correct 1 ms 384 KB Output is correct
56 Correct 3 ms 1024 KB Output is correct
57 Correct 2 ms 896 KB Output is correct
58 Correct 28 ms 3568 KB Output is correct
59 Correct 34 ms 3580 KB Output is correct
60 Correct 30 ms 4048 KB Output is correct
61 Correct 36 ms 3952 KB Output is correct
62 Correct 87 ms 7788 KB Output is correct
63 Correct 88 ms 7800 KB Output is correct
64 Correct 106 ms 10604 KB Output is correct
65 Correct 379 ms 32608 KB Output is correct
66 Correct 428 ms 40520 KB Output is correct
67 Correct 9 ms 3136 KB Output is correct
68 Correct 6 ms 964 KB Output is correct
69 Correct 768 ms 62336 KB Output is correct
70 Correct 877 ms 72240 KB Output is correct
71 Correct 984 ms 88704 KB Output is correct
72 Correct 812 ms 86268 KB Output is correct
73 Correct 942 ms 85168 KB Output is correct
74 Correct 708 ms 71880 KB Output is correct
75 Correct 855 ms 71344 KB Output is correct