제출 #583771

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
583771		joelau	Split the Attractions (IOI19_split)	C++14	11 / 100	81 ms	12704 KiB

split

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

int N,M,A,B,C;
vector<int> lst[100005], ans;
queue<int> Q;

vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
	N = n, M = p.size(), A = a, B = b, C = c;
	for (int i = 0; i < M; ++i) lst[p[i]].push_back(q[i]), lst[q[i]].push_back(p[i]);
	ans.assign(N,3);
	ans[0] = 2;
	Q.push(0);
	int cnt = 1;
	while (!Q.empty() && cnt < B) {
		int u = Q.front(); Q.pop();
		for (int v: lst[u]) if (ans[v] == 3) {
			ans[v] = 2, cnt++;
			Q.push(v);
			if (cnt >= B) break;
		}
	}
	for (int i = 0; i < N; ++i) if (ans[i] == 3) {
		ans[i] = 1;
		break;
	}
	return ans;
}

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