oj.uz

답안 #156704

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
156704 2019-10-07T03:25:17 Z guangxuan Split the Attractions (IOI19_split) C++14
100 / 100
 194 ms 31116 KB 
#include "split.h"
#include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define SZ(X) (int)X.size()
#define PB push_back
#define ALL(X) X.begin(),X.end()
#define RI(X) scanf("%d",&X)
#define RII(X,Y) scanf("%d%d",&X,&Y)
#define RIII(X,Y,Z) scanf("%d%d%d",&X,&Y,&Z)
#define DRI(X) int X;scanf("%d",&X)
#define DRII(X,Y) int X,Y;scanf("%d%d",&X,&Y)
#define DRIII(X,Y,Z) int X,Y,Z;scanf("%d%d%d",&X,&Y,&Z)
#define MS0(X) memset(X,0,sizeof(X));
#define MS1(X) memset(X,-1,sizeof(X));
#define REP(I,N) for(int I=0;I<N;++I)
#define REPP(I,A,B) for(int I=A;I<B;++I)

using namespace std;
typedef pair<int,int> PII;
typedef long long LL;
typedef pair<LL,LL> PLL;

vector<int> adj[200009],adj2[200009];
bool isap[200009];
int num[200009],low[200009],p[200009],ss[200009];
int curt=0;
int N,E;
int piva,pivb;//piva is the AP, pivb is the place to find a subtree?
vector<PII> cci;
bool possible = 1;
vector<int> ans;
int nodesleft;

void dfs(int x,int par=-1){
	num[x]=low[x]=curt++;
	ss[x]=1;
	p[x]=par;
	int children=0;
	for(int i:adj[x]){
		if(i==par)continue;
		if(num[i]==-1){
			children++;
			dfs(i,x);
			ss[x]+=ss[i];
			low[x]=min(low[x],low[i]);
			if((par!=-1&&low[i]>=num[x])||(par==-1&&children>1)){
				isap[x]=1;
			}
			adj2[x].PB(i);
		}
		else{
			low[x]=min(low[x],num[i]);
		}
	}
}

void dfstree(int x,int v){
	if(nodesleft==0)return;
	if(ans[x]!=cci[2].S)return;
	ans[x]=v;
	nodesleft --;
	for(int i:adj2[x])dfstree(i,v);
}

void dfsfree(int x,int v){
	if(nodesleft==0)return;
	if(ans[x]!=cci[2].S)return;
	ans[x]=v;
	nodesleft --;
	for(int i:adj[x])dfsfree(i,v);
}

void solve(int x){
	while(1){
		bool bigchild=0;
		for(auto i:adj2[x]){
			if(ss[i]>=cci[0].F){
				bigchild=1;
				x = i;
				break;
			}
		}
		if(!bigchild)break;
	}
	//cout << "PIVOT" << x <<endl;
	if(isap[x]){
		if(p[x]!=-1){
			if(N-ss[x]>=cci[1].F){//big parent
				nodesleft = cci[0].F;
				dfstree(x,cci[0].S);
				nodesleft = cci[1].F;
				dfsfree(p[x],cci[1].S);
			}
			else{ //b is bottom.
				ans[x] = cci[1].S;
				nodesleft = cci[1].F-1;
				for(int i:adj2[x]){
					if(low[i]<num[x])continue;
					dfstree(i,cci[1].S);//down the tree only
					if(nodesleft==0)break;
				}
				for(int i:adj2[x]){
					if(low[i]>=num[x])continue;
					dfstree(i,cci[1].S);//down the tree only
					if(nodesleft==0)break;
				}
				nodesleft = cci[0].F;
				dfsfree(p[x],cci[0].S);
				if(nodesleft)possible = 0;
			}
		}
		else{
			possible = 0;//all children <a
		}
	}
	else{ //pick till enough~!
		ans[x]=cci[0].S;
		nodesleft = cci[0].F-1;
		for(int i:adj2[x]){
			dfstree(i,cci[0].S);//down the tree only
			if(nodesleft==0)break;
		}
		nodesleft = cci[1].F;//fill the rest!
		dfsfree(p[x],cci[1].S);
	}
}

vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
	N=n,E=SZ(p);
	cci.PB(MP(a,1));cci.PB(MP(b,2));cci.PB(MP(c,3));
	sort(ALL(cci));
	for(int i=0;i<E;i++) {
		adj[p[i]].PB(q[i]);
		adj[q[i]].PB(p[i]);
	}
	MS1(num);
	dfs(0,-1);
	for(int i=0;i<N;i++){
		ans.PB(cci[2].S);
	}
	solve(0);
	if(!possible){
		fill(ALL(ans),0);
	}
	return ans;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 10492 KB ok, correct split
2 Correct 11 ms 10616 KB ok, correct split
3 Correct 11 ms 10488 KB ok, correct split
4 Correct 11 ms 10488 KB ok, correct split
5 Correct 11 ms 10488 KB ok, correct split
6 Correct 11 ms 10532 KB ok, correct split
7 Correct 131 ms 30796 KB ok, correct split
8 Correct 121 ms 28068 KB ok, correct split
9 Correct 132 ms 27120 KB ok, correct split
10 Correct 128 ms 31116 KB ok, correct split
11 Correct 125 ms 30960 KB ok, correct split

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 10488 KB ok, correct split
2 Correct 11 ms 10492 KB ok, correct split
3 Correct 11 ms 10616 KB ok, correct split
4 Correct 140 ms 26600 KB ok, correct split
5 Correct 118 ms 20336 KB ok, correct split
6 Correct 134 ms 30960 KB ok, correct split
7 Correct 132 ms 27632 KB ok, correct split
8 Correct 156 ms 23952 KB ok, correct split
9 Correct 129 ms 21872 KB ok, correct split
10 Correct 76 ms 18804 KB ok, correct split
11 Correct 75 ms 18896 KB ok, correct split
12 Correct 81 ms 19276 KB ok, correct split

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 10488 KB ok, correct split
2 Correct 108 ms 20256 KB ok, correct split
3 Correct 43 ms 14456 KB ok, correct split
4 Correct 11 ms 10484 KB ok, correct split
5 Correct 126 ms 24816 KB ok, correct split
6 Correct 130 ms 24636 KB ok, correct split
7 Correct 131 ms 24304 KB ok, correct split
8 Correct 124 ms 25840 KB ok, correct split
9 Correct 128 ms 24048 KB ok, correct split
10 Correct 38 ms 13816 KB ok, no valid answer
11 Correct 55 ms 15476 KB ok, no valid answer
12 Correct 89 ms 19952 KB ok, no valid answer
13 Correct 102 ms 20208 KB ok, no valid answer
14 Correct 81 ms 19312 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 10488 KB ok, correct split
2 Correct 11 ms 10488 KB ok, no valid answer
3 Correct 10 ms 10488 KB ok, correct split
4 Correct 11 ms 10488 KB ok, correct split
5 Correct 11 ms 10616 KB ok, correct split
6 Correct 11 ms 10488 KB ok, correct split
7 Correct 11 ms 10488 KB ok, correct split
8 Correct 11 ms 10488 KB ok, correct split
9 Correct 13 ms 10872 KB ok, correct split
10 Correct 13 ms 10872 KB ok, correct split
11 Correct 11 ms 10488 KB ok, correct split
12 Correct 13 ms 10872 KB ok, correct split
13 Correct 11 ms 10492 KB ok, correct split
14 Correct 11 ms 10488 KB ok, correct split
15 Correct 11 ms 10488 KB ok, correct split
16 Correct 11 ms 10488 KB ok, correct split
17 Correct 10 ms 10488 KB ok, correct split
18 Correct 11 ms 10488 KB ok, correct split
19 Correct 11 ms 10616 KB ok, correct split
20 Correct 12 ms 10616 KB ok, correct split
21 Correct 13 ms 10876 KB ok, correct split
22 Correct 13 ms 10872 KB ok, correct split
23 Correct 12 ms 10872 KB ok, correct split
24 Correct 13 ms 10872 KB ok, correct split
25 Correct 13 ms 10872 KB ok, correct split
26 Correct 13 ms 10872 KB ok, correct split
27 Correct 13 ms 10872 KB ok, correct split
28 Correct 13 ms 10872 KB ok, correct split
29 Correct 11 ms 10616 KB ok, correct split
30 Correct 13 ms 10872 KB ok, correct split
31 Correct 12 ms 10616 KB ok, correct split
32 Correct 11 ms 10616 KB ok, correct split
33 Correct 11 ms 10488 KB ok, correct split
34 Correct 13 ms 10744 KB ok, correct split
35 Correct 13 ms 10744 KB ok, correct split
36 Correct 12 ms 10744 KB ok, correct split
37 Correct 14 ms 11000 KB ok, correct split
38 Correct 14 ms 10872 KB ok, correct split
39 Correct 13 ms 10872 KB ok, correct split
40 Correct 13 ms 10872 KB ok, correct split
41 Correct 12 ms 10616 KB ok, correct split
42 Correct 12 ms 10744 KB ok, correct split
43 Correct 13 ms 10872 KB ok, correct split
44 Correct 14 ms 10872 KB ok, correct split
45 Correct 14 ms 10872 KB ok, correct split
46 Correct 13 ms 10872 KB ok, correct split
47 Correct 13 ms 10876 KB ok, no valid answer
48 Correct 13 ms 10872 KB ok, correct split
49 Correct 13 ms 10972 KB ok, correct split
50 Correct 11 ms 10488 KB ok, no valid answer
51 Correct 11 ms 10488 KB ok, no valid answer
52 Correct 13 ms 10744 KB ok, no valid answer
53 Correct 13 ms 10872 KB ok, no valid answer
54 Correct 12 ms 10744 KB ok, no valid answer
55 Correct 13 ms 10744 KB ok, no valid answer
56 Correct 13 ms 10872 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 10492 KB ok, correct split
2 Correct 11 ms 10616 KB ok, correct split
3 Correct 11 ms 10488 KB ok, correct split
4 Correct 11 ms 10488 KB ok, correct split
5 Correct 11 ms 10488 KB ok, correct split
6 Correct 11 ms 10532 KB ok, correct split
7 Correct 131 ms 30796 KB ok, correct split
8 Correct 121 ms 28068 KB ok, correct split
9 Correct 132 ms 27120 KB ok, correct split
10 Correct 128 ms 31116 KB ok, correct split
11 Correct 125 ms 30960 KB ok, correct split
12 Correct 11 ms 10488 KB ok, correct split
13 Correct 11 ms 10492 KB ok, correct split
14 Correct 11 ms 10616 KB ok, correct split
15 Correct 140 ms 26600 KB ok, correct split
16 Correct 118 ms 20336 KB ok, correct split
17 Correct 134 ms 30960 KB ok, correct split
18 Correct 132 ms 27632 KB ok, correct split
19 Correct 156 ms 23952 KB ok, correct split
20 Correct 129 ms 21872 KB ok, correct split
21 Correct 76 ms 18804 KB ok, correct split
22 Correct 75 ms 18896 KB ok, correct split
23 Correct 81 ms 19276 KB ok, correct split
24 Correct 11 ms 10488 KB ok, correct split
25 Correct 108 ms 20256 KB ok, correct split
26 Correct 43 ms 14456 KB ok, correct split
27 Correct 11 ms 10484 KB ok, correct split
28 Correct 126 ms 24816 KB ok, correct split
29 Correct 130 ms 24636 KB ok, correct split
30 Correct 131 ms 24304 KB ok, correct split
31 Correct 124 ms 25840 KB ok, correct split
32 Correct 128 ms 24048 KB ok, correct split
33 Correct 38 ms 13816 KB ok, no valid answer
34 Correct 55 ms 15476 KB ok, no valid answer
35 Correct 89 ms 19952 KB ok, no valid answer
36 Correct 102 ms 20208 KB ok, no valid answer
37 Correct 81 ms 19312 KB ok, no valid answer
38 Correct 11 ms 10488 KB ok, correct split
39 Correct 11 ms 10488 KB ok, no valid answer
40 Correct 10 ms 10488 KB ok, correct split
41 Correct 11 ms 10488 KB ok, correct split
42 Correct 11 ms 10616 KB ok, correct split
43 Correct 11 ms 10488 KB ok, correct split
44 Correct 11 ms 10488 KB ok, correct split
45 Correct 11 ms 10488 KB ok, correct split
46 Correct 13 ms 10872 KB ok, correct split
47 Correct 13 ms 10872 KB ok, correct split
48 Correct 11 ms 10488 KB ok, correct split
49 Correct 13 ms 10872 KB ok, correct split
50 Correct 11 ms 10492 KB ok, correct split
51 Correct 11 ms 10488 KB ok, correct split
52 Correct 11 ms 10488 KB ok, correct split
53 Correct 11 ms 10488 KB ok, correct split
54 Correct 10 ms 10488 KB ok, correct split
55 Correct 11 ms 10488 KB ok, correct split
56 Correct 11 ms 10616 KB ok, correct split
57 Correct 12 ms 10616 KB ok, correct split
58 Correct 13 ms 10876 KB ok, correct split
59 Correct 13 ms 10872 KB ok, correct split
60 Correct 12 ms 10872 KB ok, correct split
61 Correct 13 ms 10872 KB ok, correct split
62 Correct 13 ms 10872 KB ok, correct split
63 Correct 13 ms 10872 KB ok, correct split
64 Correct 13 ms 10872 KB ok, correct split
65 Correct 13 ms 10872 KB ok, correct split
66 Correct 11 ms 10616 KB ok, correct split
67 Correct 13 ms 10872 KB ok, correct split
68 Correct 12 ms 10616 KB ok, correct split
69 Correct 11 ms 10616 KB ok, correct split
70 Correct 11 ms 10488 KB ok, correct split
71 Correct 13 ms 10744 KB ok, correct split
72 Correct 13 ms 10744 KB ok, correct split
73 Correct 12 ms 10744 KB ok, correct split
74 Correct 14 ms 11000 KB ok, correct split
75 Correct 14 ms 10872 KB ok, correct split
76 Correct 13 ms 10872 KB ok, correct split
77 Correct 13 ms 10872 KB ok, correct split
78 Correct 12 ms 10616 KB ok, correct split
79 Correct 12 ms 10744 KB ok, correct split
80 Correct 13 ms 10872 KB ok, correct split
81 Correct 14 ms 10872 KB ok, correct split
82 Correct 14 ms 10872 KB ok, correct split
83 Correct 13 ms 10872 KB ok, correct split
84 Correct 13 ms 10876 KB ok, no valid answer
85 Correct 13 ms 10872 KB ok, correct split
86 Correct 13 ms 10972 KB ok, correct split
87 Correct 11 ms 10488 KB ok, no valid answer
88 Correct 11 ms 10488 KB ok, no valid answer
89 Correct 13 ms 10744 KB ok, no valid answer
90 Correct 13 ms 10872 KB ok, no valid answer
91 Correct 12 ms 10744 KB ok, no valid answer
92 Correct 13 ms 10744 KB ok, no valid answer
93 Correct 13 ms 10872 KB ok, no valid answer
94 Correct 134 ms 23880 KB ok, correct split
95 Correct 188 ms 29944 KB ok, correct split
96 Correct 163 ms 28148 KB ok, correct split
97 Correct 46 ms 14584 KB ok, correct split
98 Correct 48 ms 14712 KB ok, correct split
99 Correct 70 ms 17400 KB ok, correct split
100 Correct 165 ms 24660 KB ok, correct split
101 Correct 151 ms 23400 KB ok, correct split
102 Correct 139 ms 22796 KB ok, correct split
103 Correct 142 ms 22384 KB ok, correct split
104 Correct 122 ms 22496 KB ok, correct split
105 Correct 67 ms 16632 KB ok, correct split
106 Correct 116 ms 22324 KB ok, correct split
107 Correct 106 ms 20340 KB ok, correct split
108 Correct 111 ms 20248 KB ok, correct split
109 Correct 194 ms 23924 KB ok, correct split
110 Correct 155 ms 24740 KB ok, correct split
111 Correct 162 ms 24772 KB ok, correct split
112 Correct 152 ms 23476 KB ok, correct split
113 Correct 160 ms 23472 KB ok, correct split
114 Correct 25 ms 12284 KB ok, correct split
115 Correct 24 ms 12024 KB ok, correct split
116 Correct 158 ms 24684 KB ok, correct split
117 Correct 151 ms 24688 KB ok, correct split
118 Correct 115 ms 21872 KB ok, correct split
119 Correct 120 ms 21744 KB ok, correct split
120 Correct 128 ms 26600 KB ok, correct split
121 Correct 108 ms 20340 KB ok, no valid answer
122 Correct 112 ms 20240 KB ok, no valid answer
123 Correct 171 ms 24948 KB ok, no valid answer
124 Correct 163 ms 24688 KB ok, no valid answer
125 Correct 105 ms 20848 KB ok, no valid answer
126 Correct 73 ms 18444 KB ok, no valid answer
127 Correct 128 ms 22044 KB ok, no valid answer