# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
156497 | MoNsTeR_CuBe | Split the Attractions (IOI19_split) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
}