Submission #156498

#	Time	Username	Problem	Language	Result	Execution time	Memory
156498		MoNsTeR_CuBe	Split the Attractions (IOI19_split)	C++17	0 / 100	2 ms	376 KiB

split

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

vector<int> find_split(int N, int a, int b, int c, vector<int> p, vector<int> q) {
	
	Graph.resize(N);
	
	for(int i = 0; i < (int)p.size(); i++){
		Graph[p[i]].push_back(q[i]);
		Graph[q[i]].push_back(p[i]);
	}
	
	vector< int > colouring(N);
	
	return colouring;
}

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