# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
926885 | 2024-02-14T03:49:52 Z | Nurislam | Game (IOI14_game) | C++17 | 0 ms | 0 KB |
#include<bits/stdc++.h> using namespace std; #include<bits/stdc++.h> #define int long long const int N = 1600; set<int> g[N]; void initialize(int n) { for(int i = 0; i < n; i++){ for(int j = i+1; j < n; j++){ g[i].insert(j); g[j].insert(i); } } } int hasEdge(int u, int v) { if(g[u].size() == 1)return 1; g[u].erase(v); g[v].erase(u); return 0; }