Submission #418356

#	Time	Username	Problem	Language	Result	Execution time	Memory
418356		Josia	Split the Attractions (IOI19_split)	C++14	18 / 100	126 ms	13856 KiB

split

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


int numberVisited = 0;
void DFS(vector<int> &result, vector<bool> &visited, vector<vector<int>> &graph, int v, int b) {
	if (visited[v] || numberVisited == b) {
		return;
	}
	visited[v] = 1;
	result[v] = 2;
	numberVisited ++;

	for (int i: graph[v]) {
		if (visited[i]) continue;
		DFS(result, visited, graph, i, b);
	}
}





vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
	vector<int> res(n, 0);
	

	vector<int> numEdges(n, 0);


	vector<vector<int>> graph(n);

	for (int i = 0; i<p.size(); i++) {
		numEdges[p[i]]++;
		numEdges[q[i]]++;
		graph[p[i]].push_back(q[i]);
		graph[q[i]].push_back(p[i]);
	}

	bool cycle = 1;
	bool path = 1;
	for (int i: numEdges) {
		if (i != 2) cycle = 0;
		if (i > 2) path = 0;
	}

	if (cycle) path = 0;

	if (cycle) {
		vector<bool> visited(n, 0);
		int v = 0;
		for (int i = 0; i<a; i++) {
			assert(!visited[v]);
			visited[v] = 1;
			res[v] = 1;
			for (int i: graph[v]) {
				if (visited[i]) continue;
				else {v = i; break;}
			}
		}
		for (int i = 0; i<b; i++) {
			assert(!visited[v]);
			visited[v] = 1;
			res[v] = 2;
			for (int i: graph[v]) {
				if (visited[i]) continue;
				else {v = i; break;}
			}
		}
		for (int i = 0; i<c; i++) {
			assert(!visited[v]);
			visited[v] = 1;
			res[v] = 3;
			for (int i: graph[v]) {
				if (visited[i]) continue;
				else {v = i; break;}
			}
		}
	}


	if (path) {
		vector<bool> visited(n, 0);
		int v = 0;

		for (int i = 0; i<n; i++) {
			if (numEdges[i] == 1) {v = i; break;}
		}

		for (int i = 0; i<a; i++) {
			assert(!visited[v]);
			visited[v] = 1;
			res[v] = 1;
			for (int i: graph[v]) {
				if (visited[i]) continue;
				else {v = i; break;}
			}
		}
		for (int i = 0; i<b; i++) {
			assert(!visited[v]);
			visited[v] = 1;
			res[v] = 2;
			for (int i: graph[v]) {
				if (visited[i]) continue;
				else {v = i; break;}
			}
		}
		for (int i = 0; i<c; i++) {
			assert(!visited[v]);
			visited[v] = 1;
			res[v] = 3;
			for (int i: graph[v]) {
				if (visited[i]) continue;
				else {v = i; break;}
			}
		}
	}


	if (a == 1) {
		res.assign(n, 3);
		vector<bool> v(n, 0);
		for (int i = 0; i<b; i++) {
			DFS(res, v, graph, 0, b);
		}

		for (int i = 0; i<n; i++) {
			if (!v[i]) {
				res[i] = 1;
				break;
			}
		}
	}


	return res;
}

Compilation message (stderr)

split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:34:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |  for (int i = 0; i<p.size(); i++) {
      |                  ~^~~~~~~~~

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