Submission #291749

#TimeUsernameProblemLanguageResultExecution timeMemory
291749amiratouGame (IOI14_game)C++14
100 / 100
606 ms50736 KiB
#include "game.h" #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> using namespace std; using namespace __gnu_pbds; //template <typename T> using ordered_set = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>; #define sz(x) (int)(x.size()) const int MX = 1500; gp_hash_table <int,bool> myset[MX]; //unordered_set<int> myset[MX]; void initialize(int n) { for (int i = 0; i < n; ++i) for (int j = i+1; j < n; ++j) myset[i][j]=1; } int hasEdge(int u, int v) { if(u>v)swap(u,v); myset[u].erase(v); if(!sz(myset[u])) return 1; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...