Submission #1290988

#	Time	Username	Problem	Language	Result	Execution time	Memory
1290988		gustavo_d	Split the Attractions (IOI19_split)	C++20	0 / 100	1 ms	336 KiB

split

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

const int MAXN = 1e5;

vector<int> adj[MAXN];
vector<int> res;
int n;
bool vis[MAXN];
vector<int> pre;

bool dfs(int v) {
	pre.push_back(v);
	vis[v] = true;
	for (int viz : adj[v]) {
		if (vis[viz]) continue;
		dfs(viz);
	}
}

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

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

	pre.reserve(n);
	res = vector<int> (n);

	dfs(0);

	for (int i=0; i<b; i++) res[pre[i]] = 2;
	res[pre[b]] = 1;
	for (int i=b+1; i<n; i++) res[pre[i]] = 3;

	return res;
}

Compilation message (stderr)

split.cpp: In function 'bool dfs(int)':
split.cpp:20:1: warning: no return statement in function returning non-void [-Wreturn-type]
   20 | }
      | ^

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