제출 #1290758

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

split

#include "split.h"
#include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+10;
vector<int>v[maxn];
int marc[maxn];
vector<int>ord;
void dfs(int u){
	ord.push_back(u);
	marc[u]++;
	for(int viz : v[u]){
		if(marc[viz]) continue;
		dfs(viz);
	}
}
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
	for(int i=0;i<p.size();i++){
		v[p[i]].push_back(q[i]);
		v[q[i]].push_back(p[i]);
	}
	dfs(1);
	vector<int>resp(n,0);
	for(int i=0;i<a;i++) resp[ord[i]]=1;
	for(int i=a;i<a+b;i++) resp[ord[i]]=2;
	for(int i=a+b;i<n;i++) resp[ord[i]]=3;
	return ord;
}

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