#include <stdio.h> #include <vector> #include <queue> #include <algorithm> #include <iostream> #include <string> #include <bitset> #include <map> #include <set> #include <tuple> #include <string.h> #include <math.h> #include <random> #include <functional> #include <assert.h> #include <math.h> using namespace std; using i64 = long long int; using ii = pair<int, int>; using ii64 = pair<i64, i64>; vector<int> counts; int total; void initialize(int n) { counts.resize(n + 1); total = n - 1; } int hasEdge(int u, int v) { int res = 0; if (counts[u] == total - 1 || counts[v] == total - 1) res = 1; counts[u]++; counts[v]++; return res; }