제출 #726015

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
726015		alvingogo	Split the Attractions (IOI19_split)	C++14	0 / 100	1 ms	340 KiB

split

#include "split.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
	int m=p.size();
	vector<vector<int> > e(n);
	for(int i=0;i<m;i++){
		e[p[i]].push_back(q[i]);
		e[q[i]].push_back(p[i]);
	}
	vector<int> res;
	int rt=0;
	for(int i=0;i<n;i++){
		if(e[i].size()==1){
			rt=i;
			break;
		}
	}
	vector<int> gg;
	vector<int> vis(n),ans(n);
	for(int i=rt;!vis[i];){
		vis[i]=1;
		for(auto h:e[i]){
			if(!vis[h]){
				i=h;
				break;
			}
		}
	}
	for(int i=0;i<a;i++){
		ans[gg[i]]=1;
	}
	for(int i=a;i<a+b;i++){
		ans[gg[i]]=2;
	}
	for(int i=a+b;i<n;i++){
		ans[gg[i]]=3;
	}
	return res;
}

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