#include "split.h"
#include <vector>
#include <iostream>
#include <algorithm>
#include <cassert>
using namespace std;
const int nmax=100005;
pair<int,int> col[5];
vector<int> res;
vector<int> v[nmax],ad[nmax],arb[nmax];
int l[nmax],r[nmax],rep[nmax],w[nmax],pond[nmax],big[nmax],q[nmax],viz[nmax],valid[nmax],tt[nmax];
int nr,x,sum,p,u,i,j,k,nod,A,act,gasit,n,cen;
void dfs(int x)
{
rep[++nr]=x;l[x]=nr;
w[x]=1;
for(int i=0;i<arb[x].size();i++)
if(!w[arb[x][i]])
{
tt[arb[x][i]]=x;
dfs(arb[x][i]);
w[x]+=w[arb[x][i]];
big[x]=max(big[x],w[arb[x][i]]);
}
r[x]=nr;
}
void bfs(int x)
{
q[u=1]=x;sum=pond[x];viz[x]=1;
for(p=1;p<=u;p++)
{
x=q[p];
for(i=0;i<ad[x].size();i++)
{
nod=ad[x][i];
if(!viz[nod])
{
viz[nod]=1;
sum+=pond[nod];
q[++u]=nod;
if(sum>=A)
{
for(j=1;j<=u;j++)
{
act=q[j];
for(k=l[act];k<=r[act];k++)
valid[rep[k]]=1;
gasit=1;
return;
}
}
}
}
}
}
void coloreaza(int cate,int C)
{
int start=0;
for(i=0;i<n;i++)
{
if(valid[i])
start=i;
viz[i]=0;
}
q[u=1]=start;viz[start]=1;
for(p=1;p<=u;p++)
{
x=q[p];
res[x]=C;
if(p==cate) return;
for(i=0;i<v[x].size();i++)
if(valid[v[x][i]]&&(!viz[v[x][i]]))
{
q[++u]=v[x][i];
viz[v[x][i]]=1;
}
}
}
vector<int> find_split(int N, int a, int b, int c, vector<int> p, vector<int> q) {
n=N;
res.resize(n);
for(i=0;i<n;i++)
res[i]=0;
col[0]={a,1};
col[1]={b,2};
col[2]={c,3};
sort(col,col+3);
A=col[0].first;
int m=p.size();
for(i=0;i<m;i++)
{
v[p[i]].push_back(q[i]);
v[q[i]].push_back(p[i]);
}
for(i=0;i<n;i++)
arb[i]=v[i];
dfs(0);
for(i=0;i<n;i++)
arb[i].clear();
for(i=1;i<n;i++)
{
arb[tt[i]].push_back(i);
arb[i].push_back(tt[i]);
}
for(i=0;i<n;i++)
if(n-w[i]<=n/2&&big[i]<=n/2)
cen=i;
for(i=0;i<n;i++)
w[i]=0;
nr=0;
dfs(cen);
for(i=0;i<arb[cen].size();i++)
{
x=arb[cen][i];
for(j=l[x];j<=r[x];j++)
{
nod=rep[j];
tt[nod]=x;
}
pond[x]=w[x];
if(pond[x]>=A&&(!gasit))
{
gasit=1;
for(j=l[x];j<=r[x];j++)
{
valid[rep[j]]=1;
}
}
}
for(i=0;i<m;i++)
if(p[i]!=cen&&q[i]!=cen)
{
ad[tt[p[i]]].push_back(tt[q[i]]);
ad[tt[q[i]]].push_back(tt[p[i]]);
}
if(!gasit)
for(int it=0;it<v[cen].size()&&(!gasit);it++)
{
if(!viz[v[cen][it]])
bfs(v[cen][it]);
}
if(!gasit) return res;
coloreaza(col[0].first,col[0].second);
for(i=0;i<n;i++)
valid[i]^=1;
coloreaza(col[1].first,col[1].second);
for(i=0;i<n;i++)
if(!res[i])
res[i]=col[2].second;
return res;
}
Compilation message
split.cpp: In function 'void dfs(int)':
split.cpp:17:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0;i<arb[x].size();i++)
~^~~~~~~~~~~~~~
split.cpp: In function 'void bfs(int)':
split.cpp:33:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(i=0;i<ad[x].size();i++)
~^~~~~~~~~~~~~
split.cpp: In function 'void coloreaza(int, int)':
split.cpp:71:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(i=0;i<v[x].size();i++)
~^~~~~~~~~~~~
split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:112:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(i=0;i<arb[cen].size();i++)
~^~~~~~~~~~~~~~~~
split.cpp:137:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int it=0;it<v[cen].size()&&(!gasit);it++)
~~^~~~~~~~~~~~~~
split.cpp:147:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
for(i=0;i<n;i++)
^~~
split.cpp:150:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
return res;
^~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
8 ms |
7416 KB |
ok, correct split |
2 |
Correct |
9 ms |
7416 KB |
ok, correct split |
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 |
156 ms |
24736 KB |
ok, correct split |
8 |
Correct |
158 ms |
23276 KB |
ok, correct split |
9 |
Correct |
156 ms |
23000 KB |
ok, correct split |
10 |
Correct |
162 ms |
24844 KB |
ok, correct split |
11 |
Correct |
172 ms |
24940 KB |
ok, correct split |
# |
Verdict |
Execution time |
Memory |
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 |
168 ms |
23540 KB |
ok, correct split |
5 |
Correct |
155 ms |
20640 KB |
ok, correct split |
6 |
Correct |
159 ms |
24752 KB |
ok, correct split |
7 |
Correct |
165 ms |
23232 KB |
ok, correct split |
8 |
Correct |
235 ms |
24196 KB |
ok, correct split |
9 |
Correct |
159 ms |
20448 KB |
ok, correct split |
10 |
Correct |
117 ms |
20464 KB |
ok, correct split |
11 |
Correct |
101 ms |
20276 KB |
ok, correct split |
12 |
Correct |
100 ms |
20336 KB |
ok, correct split |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
9 ms |
7416 KB |
ok, correct split |
2 |
Correct |
140 ms |
20704 KB |
ok, correct split |
3 |
Correct |
51 ms |
12792 KB |
ok, correct split |
4 |
Correct |
9 ms |
7416 KB |
ok, correct split |
5 |
Correct |
158 ms |
21964 KB |
ok, correct split |
6 |
Correct |
148 ms |
21740 KB |
ok, correct split |
7 |
Correct |
167 ms |
21868 KB |
ok, correct split |
8 |
Correct |
146 ms |
22336 KB |
ok, correct split |
9 |
Correct |
152 ms |
21724 KB |
ok, correct split |
10 |
Correct |
43 ms |
11768 KB |
ok, no valid answer |
11 |
Correct |
64 ms |
13944 KB |
ok, no valid answer |
12 |
Correct |
114 ms |
20184 KB |
ok, no valid answer |
13 |
Correct |
136 ms |
20472 KB |
ok, no valid answer |
14 |
Correct |
101 ms |
19488 KB |
ok, no valid answer |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
11 ms |
7416 KB |
ok, correct split |
2 |
Correct |
13 ms |
7416 KB |
ok, no valid answer |
3 |
Correct |
10 ms |
7416 KB |
ok, correct split |
4 |
Correct |
9 ms |
7416 KB |
ok, correct split |
5 |
Correct |
9 ms |
7416 KB |
ok, correct split |
6 |
Correct |
8 ms |
7416 KB |
ok, correct split |
7 |
Correct |
8 ms |
7416 KB |
ok, correct split |
8 |
Correct |
8 ms |
7416 KB |
ok, correct split |
9 |
Correct |
11 ms |
7800 KB |
ok, correct split |
10 |
Correct |
12 ms |
7800 KB |
ok, correct split |
11 |
Correct |
9 ms |
7416 KB |
ok, correct split |
12 |
Correct |
12 ms |
7800 KB |
ok, correct split |
13 |
Correct |
9 ms |
7416 KB |
ok, correct split |
14 |
Correct |
9 ms |
7416 KB |
ok, correct split |
15 |
Correct |
9 ms |
7416 KB |
ok, correct split |
16 |
Correct |
8 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 |
11 ms |
7420 KB |
ok, correct split |
20 |
Correct |
9 ms |
7544 KB |
ok, correct split |
21 |
Correct |
10 ms |
7800 KB |
ok, correct split |
22 |
Correct |
11 ms |
7800 KB |
ok, correct split |
23 |
Correct |
11 ms |
7800 KB |
ok, correct split |
24 |
Correct |
11 ms |
7800 KB |
ok, correct split |
25 |
Correct |
10 ms |
7800 KB |
ok, correct split |
26 |
Incorrect |
12 ms |
7928 KB |
invalid split: #1=1, #2=800, #3=1599 |
27 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
8 ms |
7416 KB |
ok, correct split |
2 |
Correct |
9 ms |
7416 KB |
ok, correct split |
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 |
156 ms |
24736 KB |
ok, correct split |
8 |
Correct |
158 ms |
23276 KB |
ok, correct split |
9 |
Correct |
156 ms |
23000 KB |
ok, correct split |
10 |
Correct |
162 ms |
24844 KB |
ok, correct split |
11 |
Correct |
172 ms |
24940 KB |
ok, correct split |
12 |
Correct |
8 ms |
7416 KB |
ok, correct split |
13 |
Correct |
8 ms |
7416 KB |
ok, correct split |
14 |
Correct |
8 ms |
7416 KB |
ok, correct split |
15 |
Correct |
168 ms |
23540 KB |
ok, correct split |
16 |
Correct |
155 ms |
20640 KB |
ok, correct split |
17 |
Correct |
159 ms |
24752 KB |
ok, correct split |
18 |
Correct |
165 ms |
23232 KB |
ok, correct split |
19 |
Correct |
235 ms |
24196 KB |
ok, correct split |
20 |
Correct |
159 ms |
20448 KB |
ok, correct split |
21 |
Correct |
117 ms |
20464 KB |
ok, correct split |
22 |
Correct |
101 ms |
20276 KB |
ok, correct split |
23 |
Correct |
100 ms |
20336 KB |
ok, correct split |
24 |
Correct |
9 ms |
7416 KB |
ok, correct split |
25 |
Correct |
140 ms |
20704 KB |
ok, correct split |
26 |
Correct |
51 ms |
12792 KB |
ok, correct split |
27 |
Correct |
9 ms |
7416 KB |
ok, correct split |
28 |
Correct |
158 ms |
21964 KB |
ok, correct split |
29 |
Correct |
148 ms |
21740 KB |
ok, correct split |
30 |
Correct |
167 ms |
21868 KB |
ok, correct split |
31 |
Correct |
146 ms |
22336 KB |
ok, correct split |
32 |
Correct |
152 ms |
21724 KB |
ok, correct split |
33 |
Correct |
43 ms |
11768 KB |
ok, no valid answer |
34 |
Correct |
64 ms |
13944 KB |
ok, no valid answer |
35 |
Correct |
114 ms |
20184 KB |
ok, no valid answer |
36 |
Correct |
136 ms |
20472 KB |
ok, no valid answer |
37 |
Correct |
101 ms |
19488 KB |
ok, no valid answer |
38 |
Correct |
11 ms |
7416 KB |
ok, correct split |
39 |
Correct |
13 ms |
7416 KB |
ok, no valid answer |
40 |
Correct |
10 ms |
7416 KB |
ok, correct split |
41 |
Correct |
9 ms |
7416 KB |
ok, correct split |
42 |
Correct |
9 ms |
7416 KB |
ok, correct split |
43 |
Correct |
8 ms |
7416 KB |
ok, correct split |
44 |
Correct |
8 ms |
7416 KB |
ok, correct split |
45 |
Correct |
8 ms |
7416 KB |
ok, correct split |
46 |
Correct |
11 ms |
7800 KB |
ok, correct split |
47 |
Correct |
12 ms |
7800 KB |
ok, correct split |
48 |
Correct |
9 ms |
7416 KB |
ok, correct split |
49 |
Correct |
12 ms |
7800 KB |
ok, correct split |
50 |
Correct |
9 ms |
7416 KB |
ok, correct split |
51 |
Correct |
9 ms |
7416 KB |
ok, correct split |
52 |
Correct |
9 ms |
7416 KB |
ok, correct split |
53 |
Correct |
8 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 |
11 ms |
7420 KB |
ok, correct split |
57 |
Correct |
9 ms |
7544 KB |
ok, correct split |
58 |
Correct |
10 ms |
7800 KB |
ok, correct split |
59 |
Correct |
11 ms |
7800 KB |
ok, correct split |
60 |
Correct |
11 ms |
7800 KB |
ok, correct split |
61 |
Correct |
11 ms |
7800 KB |
ok, correct split |
62 |
Correct |
10 ms |
7800 KB |
ok, correct split |
63 |
Incorrect |
12 ms |
7928 KB |
invalid split: #1=1, #2=800, #3=1599 |
64 |
Halted |
0 ms |
0 KB |
- |