# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
156497 | 2019-10-06T08:29:53 Z | MoNsTeR_CuBe | Split the Attractions (IOI19_split) | C++17 | 0 ms | 0 KB |
#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]); } return colouring; }