제출 #1051813

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

split

#include <bits/stdc++.h>

#include "split.h"

#define F first
#define S second

using namespace std;

typedef long long ll;

const int N = 1e5 + 7;

int n;
int siz[N];
bool bio[N];
vector <int> no;
vector <int> adj[N];

void ldfs(int x) {
	bio[x] = 1;
	no.push_back(x);
	for (auto y : adj[x]) {
		if (bio[y]) continue;
		ldfs(y);
	}
}

vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
	n = a+b+c;
	vector <int> res(n, 0);
	for (int i = 0; i < n-1; i++) {
		adj[p[i]].push_back(q[i]);
		adj[q[i]].push_back(p[i]);
	}
	int mxdeg = 0;
	for (int i = 0; i < n; i++) mxdeg = max(mxdeg, (int)adj[i].size());
	if (mxdeg <= 2) {
		ldfs(0);
		for (int i = a; i < a+b; i++) res[no[i]] = 1;
		for (int i = a+b; i < n; i++) res[no[i]] = 2;
		return res;
	}
	if (a == 1) {
		ldfs(0);
		for (int i = 0; i < b; i++) res[no[i]] = 1;
		for (int i = b; i < n-1; i++) res[no[i]] = 2;
		return res;
	}
	return res;
}

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