oj.uz

답안 #893514

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
893514 2023-12-27T06:06:42 Z Faisal_Saqib Split the Attractions (IOI19_split) C++17
40 / 100
 81 ms 29012 KB 
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int N=1e5+2;
vector<int> ma[N],ch[N],ans;
bool vis[N];
int n;
int sz[N],up[N],h[N];
pair<int,int> comp[3];
bool f=0;
void df1(int x,int p)
{
	vis[x]=1;
	if(comp[p].first>0)
	{
		ans[x]=comp[p].second;
		comp[p].first--;
	}
	for(int y:ch[x])
		if(ans[y]==comp[2].second and !vis[y])
			df1(y,p);
}
void df2(int x,int p)
{
	if(comp[p].first==0)
		return;
	vis[x]=1;
	if(comp[p].first>0)
	{
		ans[x]=comp[p].second;
		comp[p].first--;
	}
	for(int y:ma[x])
		if(!vis[y] and ans[y]==comp[2].second)
			df2(y,p);
}
void dfs_ch(int x)
{
	vis[x]=1;
	for(int y:ma[x])
	{
		if(!vis[y])
		{
			dfs_ch(y);
			ch[x].push_back(y);
		}
	}
}
void dfs(int x,int q=-1)
{
	sz[x]=1;
	bool p=1;
	for(int y:ma[x])
		if(vis[y])
			up[x]=min(up[x],h[y]);
	for(int y:ch[x])
	{
		up[y]=h[y]=h[x]+1;
		dfs(y,x);
		p&=(sz[y]<comp[0].first);
		sz[x]+=sz[y];
		up[x]=min(up[x],up[y]);
	}
	if(p and !f and sz[x]>=comp[0].first)
	{
		int P1=sz[x];
		int P2=n-P1;
		vector<int> b;
		for(int y:ch[x])
		{
			if(up[y]<h[x] and (P1-sz[y])>=comp[0].first)
				P1-=sz[y],P2+=sz[y];
			else
				b.push_back(y);
		}	
		if(P2>=comp[1].first and P1>=comp[0].first)
		{
			for(int i=0;i<n;i++)
				vis[i]=0;
			vis[x]=1;
			ans[x]=comp[0].second;
			comp[0].first--;
			for(auto i:b)
				df1(i,0);
			for(int i=0;i<n;i++)
				if(ans[i]==comp[2].second)
				{
					df2(i,1);
					f=1;
					break;
				}
		}
		if(P2>=comp[0].first and P1>=comp[1].first and !f)
		{
			for(int i=0;i<n;i++)
				vis[i]=0;
			vis[x]=1;
			ans[x]=comp[1].second;
			comp[1].first--;
			for(auto i:b)
				df1(i,1);
			for(int i=0;i<n;i++)
				if(ans[i]==comp[2].second)
				{
					df2(i,0);
					f=1;
					break;
				}
		}
	}
}
vector<int> find_split(int n1, int a, int b, int c, vector<int> p, vector<int> q)
{
	n=n1;
	comp[0]={a,1},comp[1]={b,2},comp[2]={c,3};
	sort(comp,comp+3);
	int m=p.size();
	for(int i=0;i<m;i++)
		ma[p[i]].push_back(q[i]),ma[q[i]].push_back(p[i]);
	ans.resize(n,comp[2].second);
	for(int j=0;j<1;j++)
	{
		for(int i=0;i<n;i++)
			vis[i]=0;
		h[j]=0;
		dfs_ch(j);
		for(int i=0;i<n;i++)
		{
			ans[i]=comp[2].second;;
			vis[i]=0;
		}
		dfs(j);
		if(f)
			return ans;	
	}
	if(!f)
		for(int i=0;i<n;i++)
			ans[i]=0;
	return ans;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 6236 KB ok, correct split
2 Correct 2 ms 6236 KB ok, correct split
3 Correct 1 ms 6232 KB ok, correct split
4 Correct 1 ms 5980 KB ok, correct split
5 Correct 2 ms 6236 KB ok, correct split
6 Correct 2 ms 6236 KB ok, correct split
7 Correct 65 ms 28292 KB ok, correct split
8 Correct 63 ms 24148 KB ok, correct split
9 Correct 66 ms 22868 KB ok, correct split
10 Correct 61 ms 29012 KB ok, correct split
11 Correct 71 ms 29008 KB ok, correct split

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 6236 KB ok, correct split
2 Correct 1 ms 6236 KB ok, correct split
3 Correct 2 ms 6236 KB ok, correct split
4 Correct 68 ms 21416 KB ok, correct split
5 Correct 55 ms 13392 KB ok, correct split
6 Correct 61 ms 29008 KB ok, correct split
7 Correct 61 ms 26192 KB ok, correct split
8 Correct 81 ms 16212 KB ok, correct split
9 Correct 49 ms 15196 KB ok, correct split
10 Correct 37 ms 12632 KB ok, correct split
11 Correct 34 ms 12632 KB ok, correct split
12 Correct 36 ms 12628 KB ok, correct split

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 6232 KB ok, correct split
2 Correct 48 ms 13392 KB ok, correct split
3 Correct 18 ms 9308 KB ok, correct split
4 Correct 2 ms 5980 KB ok, correct split
5 Correct 63 ms 19580 KB ok, correct split
6 Correct 61 ms 19028 KB ok, correct split
7 Correct 71 ms 18788 KB ok, correct split
8 Correct 64 ms 21332 KB ok, correct split
9 Correct 55 ms 18524 KB ok, correct split
10 Correct 15 ms 8540 KB ok, no valid answer
11 Correct 23 ms 9816 KB ok, no valid answer
12 Correct 38 ms 13292 KB ok, no valid answer
13 Correct 45 ms 13392 KB ok, no valid answer
14 Correct 34 ms 12904 KB ok, no valid answer

Subtask #4
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 6232 KB ok, correct split
2 Correct 1 ms 6236 KB ok, no valid answer
3 Correct 2 ms 6236 KB ok, correct split
4 Correct 2 ms 6232 KB ok, correct split
5 Correct 2 ms 6236 KB ok, correct split
6 Correct 2 ms 5980 KB ok, correct split
7 Correct 2 ms 5976 KB ok, correct split
8 Correct 1 ms 6236 KB ok, correct split
9 Correct 3 ms 6488 KB ok, correct split
10 Correct 3 ms 6492 KB ok, correct split
11 Correct 2 ms 6236 KB ok, correct split
12 Correct 3 ms 6492 KB ok, correct split
13 Correct 2 ms 5980 KB ok, correct split
14 Correct 2 ms 6236 KB ok, correct split
15 Correct 2 ms 6488 KB ok, correct split
16 Correct 2 ms 6236 KB ok, correct split
17 Correct 2 ms 6232 KB ok, correct split
18 Correct 2 ms 6236 KB ok, correct split
19 Correct 2 ms 6236 KB ok, correct split
20 Correct 2 ms 6232 KB ok, correct split
21 Correct 2 ms 6492 KB ok, correct split
22 Correct 2 ms 6492 KB ok, correct split
23 Correct 2 ms 6492 KB ok, correct split
24 Correct 3 ms 6488 KB ok, correct split
25 Correct 3 ms 6492 KB ok, correct split
26 Incorrect 3 ms 6236 KB jury found a solution, contestant did not
27 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 6236 KB ok, correct split
2 Correct 2 ms 6236 KB ok, correct split
3 Correct 1 ms 6232 KB ok, correct split
4 Correct 1 ms 5980 KB ok, correct split
5 Correct 2 ms 6236 KB ok, correct split
6 Correct 2 ms 6236 KB ok, correct split
7 Correct 65 ms 28292 KB ok, correct split
8 Correct 63 ms 24148 KB ok, correct split
9 Correct 66 ms 22868 KB ok, correct split
10 Correct 61 ms 29012 KB ok, correct split
11 Correct 71 ms 29008 KB ok, correct split
12 Correct 2 ms 6236 KB ok, correct split
13 Correct 1 ms 6236 KB ok, correct split
14 Correct 2 ms 6236 KB ok, correct split
15 Correct 68 ms 21416 KB ok, correct split
16 Correct 55 ms 13392 KB ok, correct split
17 Correct 61 ms 29008 KB ok, correct split
18 Correct 61 ms 26192 KB ok, correct split
19 Correct 81 ms 16212 KB ok, correct split
20 Correct 49 ms 15196 KB ok, correct split
21 Correct 37 ms 12632 KB ok, correct split
22 Correct 34 ms 12632 KB ok, correct split
23 Correct 36 ms 12628 KB ok, correct split
24 Correct 2 ms 6232 KB ok, correct split
25 Correct 48 ms 13392 KB ok, correct split
26 Correct 18 ms 9308 KB ok, correct split
27 Correct 2 ms 5980 KB ok, correct split
28 Correct 63 ms 19580 KB ok, correct split
29 Correct 61 ms 19028 KB ok, correct split
30 Correct 71 ms 18788 KB ok, correct split
31 Correct 64 ms 21332 KB ok, correct split
32 Correct 55 ms 18524 KB ok, correct split
33 Correct 15 ms 8540 KB ok, no valid answer
34 Correct 23 ms 9816 KB ok, no valid answer
35 Correct 38 ms 13292 KB ok, no valid answer
36 Correct 45 ms 13392 KB ok, no valid answer
37 Correct 34 ms 12904 KB ok, no valid answer
38 Correct 2 ms 6232 KB ok, correct split
39 Correct 1 ms 6236 KB ok, no valid answer
40 Correct 2 ms 6236 KB ok, correct split
41 Correct 2 ms 6232 KB ok, correct split
42 Correct 2 ms 6236 KB ok, correct split
43 Correct 2 ms 5980 KB ok, correct split
44 Correct 2 ms 5976 KB ok, correct split
45 Correct 1 ms 6236 KB ok, correct split
46 Correct 3 ms 6488 KB ok, correct split
47 Correct 3 ms 6492 KB ok, correct split
48 Correct 2 ms 6236 KB ok, correct split
49 Correct 3 ms 6492 KB ok, correct split
50 Correct 2 ms 5980 KB ok, correct split
51 Correct 2 ms 6236 KB ok, correct split
52 Correct 2 ms 6488 KB ok, correct split
53 Correct 2 ms 6236 KB ok, correct split
54 Correct 2 ms 6232 KB ok, correct split
55 Correct 2 ms 6236 KB ok, correct split
56 Correct 2 ms 6236 KB ok, correct split
57 Correct 2 ms 6232 KB ok, correct split
58 Correct 2 ms 6492 KB ok, correct split
59 Correct 2 ms 6492 KB ok, correct split
60 Correct 2 ms 6492 KB ok, correct split
61 Correct 3 ms 6488 KB ok, correct split
62 Correct 3 ms 6492 KB ok, correct split
63 Incorrect 3 ms 6236 KB jury found a solution, contestant did not
64 Halted 0 ms 0 KB -