제출 #1290744

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1290744		Sofiatpc	Split the Attractions (IOI19_split)	C++20	7 / 100	48 ms	15760 KiB

split

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

using namespace std;

const int MAXN = 1e5+5;
vector<int> adj[MAXN];
int marc[MAXN];

vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
	vector<int> res; res.resize(n);

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

	int ini = 0;
	for(int i = 0; i < n; i++)
		if(adj[i].size() == 1){ini = i; break;}

	while(a--){
		marc[ini] = 1; res[ini] = 1;
		for(int viz : adj[ini])
			if(!marc[viz])ini = viz;
	}

	while(b--){
		marc[ini] = 1; res[ini] = 2;
		for(int viz : adj[ini])
			if(!marc[viz])ini = viz;
	}

	while(c--){
		marc[ini] = 1; res[ini] = 3;
		for(int viz : adj[ini])
			if(!marc[viz])ini = viz;
	}

	return res;
}

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