제출 #821413

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
821413		Baytoro	Split the Attractions (IOI19_split)	C++17	7 / 100	56 ms	13136 KiB

split

#include "split.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
using namespace std;
const int maxN=1e5+5;
vector<int> ans,g[maxN];
int used[maxN];
void dfs(int x, int &d, int c){
	if(d<=0) return;
	ans[x]=c;
	used[x]=1;
	for(auto it: g[x]){
		if(used[it]) continue;
		dfs(it,--d,c);
	}
}
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
	int m=p.size();
	ans.resize(n);
	int A=a,B=b,C=c;
	if(A>B) swap(A,B);
	if(B>C) swap(B,C);
	if(A>B) swap(A,B);
	bool ok=1;
	for(int i=0;i<m;i++){
		g[p[i]].push_back(q[i]);
		g[q[i]].push_back(p[i]);
	}
	for(int i=0;i<n;i++){
		if(g[i].size()==1 && ok){
			dfs(i,b,2);
			ok=0;
		}
		else if(g[i].size()==1 && !ok){
			dfs(i,a,1);
			break;
		}
	}
	if(ok){
		dfs(0,b,2);
		for(int i=0;i<n;i++){
			if(!used[i]){
				dfs(i,a,1);
				break;
			}
		}
	}
	for(int i=0;i<n;i++){
		if(!ans[i]) ans[i]=3;
	}
	return ans;
}

• Subtask 1: 7 / 7
• Subtask 2: 0 / 11
• Subtask 3: 0 / 22
• Subtask 4: 0 / 24
• Subtask 5: 0 / 36