Submission #726002

#	Time	Username	Problem	Language	Result	Execution time	Memory
726002		alvingogo	Split the Attractions (IOI19_split)	C++14	11 / 100	75 ms	12620 KiB

split

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

vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
	int m=p.size();
	vector<vector<int> > e(n);
	for(int i=0;i<m;i++){
		e[p[i]].push_back(q[i]);
		e[q[i]].push_back(p[i]);
	}
	if(a==1){
		vector<int> ans(n);
		vector<int> vis(n);
		function<void(int)> dfs=[&](int x){
			vis[x]=1;
			ans[x]=2;
			b--;
			if(b==0){
				return;
			}
			for(auto h:e[x]){
				if(!vis[h]){
					dfs(h);
					if(b==0){
						return;
					}
				}
			}
		};
		dfs(0);
		for(int i=0;i<n;i++){
			if(!vis[i]){
				ans[i]=1;
				break;
			}
		}
		for(int i=0;i<n;i++){
			if(ans[i]==0){
				ans[i]=3;
			}
		}
		return ans;
	}
	vector<int> res;
	for(int i=0;i<n;i++){

	}
	return res;
}

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