oj.uz

답안 #144246

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
144246 2019-08-16T11:38:47 Z TadijaSebez Split the Attractions (IOI19_split) C++14
100 / 100
 219 ms 27616 KB 
#include "split.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
const int N=100050;
int n,fir,sec,fm,sm;
vector<int> G[N],E[N];
void AddEdge(int u, int v){ G[u].pb(v);G[v].pb(u);}
int ans[N],sz[N],par[N];
bool was[N];
bool ok;
int ver,col;
void Tree(int u)
{
	sz[u]=1;
	was[u]=1;
	for(int v:G[u]) if(!was[v])
	{
		Tree(v);
		sz[u]+=sz[v];
		E[u].pb(v);
		par[v]=u;
	}
	if(sz[u]>=fir && n-sz[u]>=sec){ ok=1;ver=u;col=1;}
	if(sz[u]>=sec && n-sz[u]>=fir){ ok=1;ver=u;col=2;}
}
int Cen(int u){ for(int v:E[u]) if(sz[v]*2>n) return Cen(v);return u;}
int rem,mark;
void DFS(int u)
{
	if(rem>0) rem--,ans[u]=mark;
	for(int v:E[u]) if(v!=ver) DFS(v);
}
void Fill(){ for(int i=1;i<=n;i++) if(!ans[i]) ans[i]=fm^sm;}
vector<int> Answer(){ vector<int> ret;for(int i=1;i<=n;i++) ret.pb(ans[i]);return ret;}
int cnt,comp[N],csz[N];
vector<int> C[N];
void COMP(int u, int p, int c){ comp[u]=c;csz[c]++;for(int v:E[u]) if(v!=p) COMP(v,u,c);}
bool used[N],solved,can_use[N];
int node_cnt;
void Try(int u)
{
	used[u]=1;
	if(!solved)
	{
		node_cnt+=csz[u];
		can_use[u]=1;
		if(node_cnt>=fir) solved=1;
	}
	for(int v:C[u]) if(!used[v]) Try(v);
}
void DFS1(int u)
{
	if(fir>0)
	{
		ans[u]=fm;
		fir--;
	}
	else return;
	for(int v:G[u]) if(can_use[comp[v]] && !ans[v]) DFS1(v);
}
void DFS2(int u)
{
	if(sec>0)
	{
		ans[u]=sm;
		sec--;
	}
	else return;
	for(int v:G[u]) if(!ans[v]) DFS2(v);
}
vector<int> Solve()
{
	Tree(1);
	if(ok)
	{
		rem=col==1?fir:sec;
		mark=col==1?fm:sm;
		DFS(ver);
		rem=col==1?sec:fir;
		mark=col==1?sm:fm;
		DFS(1);
		Fill();
		return Answer();
	}
	int cen=Cen(1);
	for(int i=2;i<=n;i++) E[i].pb(par[i]);
	for(int v:E[cen]) COMP(v,cen,++cnt);
	for(int u=1;u<=n;u++) for(int v:G[u]) if(u!=cen && v!=cen) C[comp[u]].pb(comp[v]),C[comp[v]].pb(comp[u]);
	int start=-1;
	for(int i=1;i<=cnt;i++) if(!used[i])
	{
		node_cnt=0;
		Try(i);
		if(solved){ start=i;break;}
	}
	if(!solved) return vector<int>(n,0);
	for(int i=1;i<=n;i++) if(comp[i]==start){ DFS1(i);break;}
	DFS2(cen);
	Fill();
	return Answer();
}
vector<int> find_split(int _n, int a, int b, int c, vector<int> p, vector<int> q)
{
	n=_n;
	vector<pair<int,int>> v={{a,1},{b,2},{c,3}};
	sort(v.begin(),v.end());
	tie(fir,fm)=v[0];
	tie(sec,sm)=v[1];
	for(int i=0;i<p.size();i++) AddEdge(p[i]+1,q[i]+1);
	return Solve();
}

Compilation message

split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:110:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<p.size();i++) AddEdge(p[i]+1,q[i]+1);
              ~^~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 7416 KB ok, correct split
2 Correct 8 ms 7416 KB ok, correct split
3 Correct 8 ms 7416 KB ok, correct split
4 Correct 11 ms 7416 KB ok, correct split
5 Correct 9 ms 7416 KB ok, correct split
6 Correct 8 ms 7388 KB ok, correct split
7 Correct 127 ms 24564 KB ok, correct split
8 Correct 127 ms 22260 KB ok, correct split
9 Correct 127 ms 21620 KB ok, correct split
10 Correct 129 ms 24980 KB ok, correct split
11 Correct 138 ms 24948 KB ok, correct split

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 7416 KB ok, correct split
2 Correct 8 ms 7416 KB ok, correct split
3 Correct 9 ms 7388 KB ok, correct split
4 Correct 160 ms 20840 KB ok, correct split
5 Correct 112 ms 15764 KB ok, correct split
6 Correct 149 ms 24992 KB ok, correct split
7 Correct 126 ms 22132 KB ok, correct split
8 Correct 165 ms 18428 KB ok, correct split
9 Correct 125 ms 17204 KB ok, correct split
10 Correct 73 ms 14956 KB ok, correct split
11 Correct 74 ms 14828 KB ok, correct split
12 Correct 74 ms 14960 KB ok, correct split

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 7416 KB ok, correct split
2 Correct 114 ms 15816 KB ok, correct split
3 Correct 43 ms 10872 KB ok, correct split
4 Correct 8 ms 7416 KB ok, correct split
5 Correct 123 ms 19700 KB ok, correct split
6 Correct 126 ms 19532 KB ok, correct split
7 Correct 127 ms 19316 KB ok, correct split
8 Correct 126 ms 20724 KB ok, correct split
9 Correct 119 ms 19192 KB ok, correct split
10 Correct 43 ms 11512 KB ok, no valid answer
11 Correct 62 ms 13432 KB ok, no valid answer
12 Correct 103 ms 18548 KB ok, no valid answer
13 Correct 136 ms 19136 KB ok, no valid answer
14 Correct 102 ms 18288 KB ok, no valid answer

Subtask #4
24.0 / 24.0

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

Subtask #5
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 7416 KB ok, correct split
2 Correct 8 ms 7416 KB ok, correct split
3 Correct 8 ms 7416 KB ok, correct split
4 Correct 11 ms 7416 KB ok, correct split
5 Correct 9 ms 7416 KB ok, correct split
6 Correct 8 ms 7388 KB ok, correct split
7 Correct 127 ms 24564 KB ok, correct split
8 Correct 127 ms 22260 KB ok, correct split
9 Correct 127 ms 21620 KB ok, correct split
10 Correct 129 ms 24980 KB ok, correct split
11 Correct 138 ms 24948 KB ok, correct split
12 Correct 8 ms 7416 KB ok, correct split
13 Correct 8 ms 7416 KB ok, correct split
14 Correct 9 ms 7388 KB ok, correct split
15 Correct 160 ms 20840 KB ok, correct split
16 Correct 112 ms 15764 KB ok, correct split
17 Correct 149 ms 24992 KB ok, correct split
18 Correct 126 ms 22132 KB ok, correct split
19 Correct 165 ms 18428 KB ok, correct split
20 Correct 125 ms 17204 KB ok, correct split
21 Correct 73 ms 14956 KB ok, correct split
22 Correct 74 ms 14828 KB ok, correct split
23 Correct 74 ms 14960 KB ok, correct split
24 Correct 8 ms 7416 KB ok, correct split
25 Correct 114 ms 15816 KB ok, correct split
26 Correct 43 ms 10872 KB ok, correct split
27 Correct 8 ms 7416 KB ok, correct split
28 Correct 123 ms 19700 KB ok, correct split
29 Correct 126 ms 19532 KB ok, correct split
30 Correct 127 ms 19316 KB ok, correct split
31 Correct 126 ms 20724 KB ok, correct split
32 Correct 119 ms 19192 KB ok, correct split
33 Correct 43 ms 11512 KB ok, no valid answer
34 Correct 62 ms 13432 KB ok, no valid answer
35 Correct 103 ms 18548 KB ok, no valid answer
36 Correct 136 ms 19136 KB ok, no valid answer
37 Correct 102 ms 18288 KB ok, no valid answer
38 Correct 12 ms 7548 KB ok, correct split
39 Correct 8 ms 7416 KB ok, no valid answer
40 Correct 8 ms 7416 KB ok, correct split
41 Correct 8 ms 7416 KB ok, correct split
42 Correct 8 ms 7416 KB ok, correct split
43 Correct 8 ms 7416 KB ok, correct split
44 Correct 10 ms 7388 KB ok, correct split
45 Correct 8 ms 7388 KB ok, correct split
46 Correct 12 ms 7672 KB ok, correct split
47 Correct 11 ms 7672 KB ok, correct split
48 Correct 8 ms 7416 KB ok, correct split
49 Correct 15 ms 7672 KB ok, correct split
50 Correct 8 ms 7416 KB ok, correct split
51 Correct 8 ms 7416 KB ok, correct split
52 Correct 8 ms 7416 KB ok, correct split
53 Correct 9 ms 7416 KB ok, correct split
54 Correct 8 ms 7416 KB ok, correct split
55 Correct 8 ms 7416 KB ok, correct split
56 Correct 9 ms 7544 KB ok, correct split
57 Correct 9 ms 7544 KB ok, correct split
58 Correct 8 ms 7672 KB ok, correct split
59 Correct 10 ms 7672 KB ok, correct split
60 Correct 11 ms 7672 KB ok, correct split
61 Correct 12 ms 7672 KB ok, correct split
62 Correct 10 ms 7672 KB ok, correct split
63 Correct 11 ms 7800 KB ok, correct split
64 Correct 12 ms 7928 KB ok, correct split
65 Correct 11 ms 7800 KB ok, correct split
66 Correct 9 ms 7416 KB ok, correct split
67 Correct 10 ms 7672 KB ok, correct split
68 Correct 9 ms 7416 KB ok, correct split
69 Correct 8 ms 7416 KB ok, correct split
70 Correct 8 ms 7416 KB ok, correct split
71 Correct 11 ms 7800 KB ok, correct split
72 Correct 11 ms 7800 KB ok, correct split
73 Correct 11 ms 7800 KB ok, correct split
74 Correct 12 ms 7928 KB ok, correct split
75 Correct 12 ms 7928 KB ok, correct split
76 Correct 12 ms 7928 KB ok, correct split
77 Correct 12 ms 7672 KB ok, correct split
78 Correct 8 ms 7544 KB ok, correct split
79 Correct 10 ms 7548 KB ok, correct split
80 Correct 12 ms 7800 KB ok, correct split
81 Correct 12 ms 7672 KB ok, correct split
82 Correct 14 ms 7928 KB ok, correct split
83 Correct 11 ms 7800 KB ok, correct split
84 Correct 11 ms 7800 KB ok, no valid answer
85 Correct 11 ms 7672 KB ok, correct split
86 Correct 11 ms 7800 KB ok, correct split
87 Correct 8 ms 7416 KB ok, no valid answer
88 Correct 8 ms 7416 KB ok, no valid answer
89 Correct 11 ms 7672 KB ok, no valid answer
90 Correct 14 ms 7928 KB ok, no valid answer
91 Correct 10 ms 7676 KB ok, no valid answer
92 Correct 11 ms 7800 KB ok, no valid answer
93 Correct 16 ms 7672 KB ok, no valid answer
94 Correct 141 ms 20124 KB ok, correct split
95 Correct 174 ms 25592 KB ok, correct split
96 Correct 162 ms 23752 KB ok, correct split
97 Correct 43 ms 11384 KB ok, correct split
98 Correct 50 ms 11496 KB ok, correct split
99 Correct 67 ms 14072 KB ok, correct split
100 Correct 163 ms 21124 KB ok, correct split
101 Correct 156 ms 20084 KB ok, correct split
102 Correct 143 ms 19524 KB ok, correct split
103 Correct 124 ms 19184 KB ok, correct split
104 Correct 116 ms 19212 KB ok, correct split
105 Correct 92 ms 16376 KB ok, correct split
106 Correct 177 ms 27240 KB ok, correct split
107 Correct 142 ms 21216 KB ok, correct split
108 Correct 146 ms 20672 KB ok, correct split
109 Correct 211 ms 26236 KB ok, correct split
110 Correct 219 ms 27320 KB ok, correct split
111 Correct 216 ms 26196 KB ok, correct split
112 Correct 201 ms 27616 KB ok, correct split
113 Correct 195 ms 26476 KB ok, correct split
114 Correct 21 ms 9080 KB ok, correct split
115 Correct 20 ms 8824 KB ok, correct split
116 Correct 192 ms 27116 KB ok, correct split
117 Correct 202 ms 25968 KB ok, correct split
118 Correct 144 ms 18448 KB ok, correct split
119 Correct 123 ms 18336 KB ok, correct split
120 Correct 126 ms 22392 KB ok, correct split
121 Correct 207 ms 20600 KB ok, no valid answer
122 Correct 134 ms 19992 KB ok, no valid answer
123 Correct 218 ms 25792 KB ok, no valid answer
124 Correct 200 ms 25836 KB ok, no valid answer
125 Correct 126 ms 20948 KB ok, no valid answer
126 Correct 76 ms 18164 KB ok, no valid answer
127 Correct 154 ms 22000 KB ok, no valid answer