Submission #1290771

#	Time	Username	Problem	Language	Result	Execution time	Memory
1290771		julia_08	Split the Attractions (IOI19_split)	C++20	7 / 100	38 ms	16276 KiB

split

#include <bits/stdc++.h>
#include "split.h"

using namespace std;

const int MAXN = 2e5 + 10;

int marc[MAXN];

vector<int> adj[MAXN];

vector<int> ans, ord;

int n, t = 0;

void dfs(int v){

	marc[v] = 1;

	for(auto u : adj[v]){
		if(!marc[u]){
			dfs(u);
		}
	}

	ord.push_back(v);

}

vector<int> find_split(int n_, int a, int b, int c, vector<int> p, vector<int> q){

	n = n_;
	ans.resize(n);
	ord.clear();

	for(int i=0; i<n; i++) ans[i] = 0;

	for(int i=0; i<(n - 1); i++){
		adj[p[i]].push_back(q[i]);
		adj[q[i]].push_back(p[i]);
	}

	dfs(0);

	for(int i=0; i<a; i++) ans[ord[i]] = 1;

	for(int i=a; i<(a + b); i++) ans[ord[i]] = 2;

	for(int i=(a + b); i<n; i++) ans[ord[i]] = 3;

	return ans;

}

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