Submission #810421

#	Time	Username	Problem	Language	Result	Execution time	Memory
810421		NothingXD	Split the Attractions (IOI19_split)	C++17	7 / 100	62 ms	15480 KiB

split

#include "split.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef double ld;

void debug_out(){cerr<<endl;}
template<typename Head, typename... Tail> 
void debug_out(Head H, Tail... T){
	cerr << H << ' ';
	debug_out(T...);
}

#define debug(...) cerr << "(" << #__VA_ARGS__ << "): ", debug_out(__VA_ARGS__)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define MP(x, y) make_pair(x, y)

const int maxn = 1e5 + 10;

int n, m, a, b, c;
vector<int> g[maxn];
vector<int> going;
bool vis[maxn];

void dfs(int v){
	vis[v] = true;
	going.push_back(v);
	for (auto u: g[v]){
		if (!vis[u]) dfs(u);
	}
}

vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
	
	m = p.size();
	for (int i = 0; i < m; i++){
		g[p[i]].push_back(q[i]);
		g[q[i]].push_back(p[i]);
	}

	if (m == n) dfs(0);
	else{
		for (int i = 0; i < n; i++){
			if (g[i].size() == 1){
				dfs(i);
				break;
			}
		}
	}
	vector<int> res(n, 3);
	for (int i = 0; i < a; i++){
		res[going[i]] = 1;
	}
	for (int i = a; i < a + b; i++){
		res[going[i]] = 2;
	}
	return res;
}

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