//https://ioinformatics.org/files/ioi2014problem3.pdf #include <bits/stdc++.h> using namespace std; vector<int> a; void initialize(int n) { for (int i = 0 ; i < n; i++) { a.push_back(0); } } int hasEdge(int u,int v) { if (a[max(u,v)]==max(u,v)) { return 1; } else{ a[u]++; a[v]++; return 0; } }