제출 #1193025

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1193025		Luvidi	Split the Attractions (IOI19_split)	C++20	0 / 100	593 ms	1114112 KiB

split

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

const int maxn=1e5;
vector<int> ad[maxn],pt;

void dfs(int v,int p){
	pt.push_back(v);
	for(int u:ad[v])if(u!=p)dfs(u,v);
}

vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
	for(int i=0;i<p.size();i++){
		ad[p[i]].push_back(q[i]);
		ad[q[i]].push_back(p[i]);
	}
	int rt;
	for(int i=0;i<n;i++)if(ad[i].size()==1)rt=i;
	dfs(rt,rt);
	vector<int> ans(n);
	for(int i=0;i<a;i++)ans[pt[i]]=1;
	for(int i=a;i<a+b;i++)ans[pt[i]]=2;
	for(int i=a+b;i<a+b+c;i++)ans[pt[i]]=3;
	return ans;
}

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