제출 #147467

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

split

#include<bits/stdc++.h>
using namespace std;
int z,x,d,e,ka[10],zx,m,la[100009];
vector <int> pas,v[100009];
bool bo[100009];
void dfs(int w){
	if(ka[zx]==0) return;
	bo[w]=1;
	pas[w]=zx;
	ka[zx]--;
	if(ka[zx]==0) return;
	for(vector <int>::iterator it=v[w].begin(); it!=v[w].end(); it++){
		if(bo[(*it)]==1) continue;
		dfs((*it));
		if(ka[zx]==0) return;
	}
}
vector <int> find_split(int n, int a, int b, int c, vector <int> p, vector <int> q){
	pas.resize(n);
	ka[1]=a;
	ka[2]=b;
	ka[3]=c;
	zx=0;
	m=p.size();
	for(int h=0; h<m; h++){
		v[p[h]].push_back(q[h]);
		v[q[h]].push_back(p[h]);
	}
	for(int h=1; h<=n; h++) la[h]=h;
	for(int h=1; h<=n; h++){
		if(v[h].size()==1){
			zx++;
			swap(la[zx],la[h]);
		}
	}
	zx=0;
	for(int h=1; h<=n; h++){
		if(bo[h]==0){
			zx++;
			dfs(h);
		}
	}
	return pas;
}

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