제출 #1196763

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

split

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

vector<vector<int>> g;
vector<int> fo;

void dfs(int cur, int par){
	fo.push_back(cur);
	for (int next : g[cur]){
		if (next != par) dfs(next, cur);
	}
}

vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q){
	g.resize(n);
	for (int i=0; i<p.size(); 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){
			dfs(i, i);
			break;
		}
	}
	vector<int> res(n);
	for (int i=0; i<n; i++){
		if (i < a) res[fo[i]] = 1;
		else if (i < a+b) res[fo[i]] = 2;
		else res[fo[i]] = 3;
	}
	return res;
}

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