제출 #1019114

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

split

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

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> tii;

#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define LSOne(s) ((s)&(-s))

ll INF=1e18+10;
int inf=1e9+10;
ll M=1e9+7;

vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
	vector<int> ans(n,0);
	vii d(n);
	int m=p.size();
	REP(i,0,m){
		d[p[i]].PB(q[i]);
		d[q[i]].PB(p[i]);
	}
	queue<int> pq;
	pq.push(0);
	REP(i,0,b){
		int k=pq.front();
		pq.pop();
		if(ans[k]!=0){
			i--;
			continue;
		}
		ans[k]=2;
		for(auto u:d[k])if(ans[u]==0)pq.push(u);
	}
	REP(i,0,n)if(ans[i]!=2){
		ans[i]=1;
		break;
	}
	REP(i,0,n)if(ans[i]==0)ans[i]=3;
	return ans;
}

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