제출 #1237216

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1237216		Sir_Ahmed_Imran	Split the Attractions (IOI19_split)	C++17	18 / 100	53 ms	15760 KiB

split

#include "split.h"
#include <bits/stdc++.h>
using namespace std;
#define MAXN 200001
#define nl '\n'
#define ff first
#define ss second
#define ll long long
#define ld long double
#define terminator main
#define pll pair<ll,ll>
#define add insert
#define append push_back
#define pii pair<int,int>
#define all(x) (x).begin(),(x).end()

vector<int> t;
int vis[MAXN];
vector<int> a[MAXN];

void dfs(int v){
	vis[v] = 1;
	t.append(v);
	for(auto & i : a[v])
		if(!vis[i]) dfs(i);
}

vector<int> find_split(int n, int x, int y, int z, vector<int> p, vector<int> q) {
	for(int i = 0; i < p.size(); i++){
		a[p[i]].append(q[i]);
		a[q[i]].append(p[i]);
	}
	int s = 0;
	for(int i = 0; i < n; i++)
		if(a[i].size() < 2) s = i;
	dfs(s);
	vector<int> ans(n);
	for(int i = 0; i < x; i++)
		ans[t[i]] = 1;
	for(int i = x; i < x + y; i++)
		ans[t[i]] = 2;
	for(int i = x + y; i < n; i++)
		ans[t[i]] = 3;
	return ans;
}

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