Submission #1138746

#TimeUsernameProblemLanguageResultExecution timeMemory
1138746adiyerMagic Show (APIO24_show)C++20
0 / 100
2 ms620 KiB
#include <bits/stdc++.h> #include "Alice.h" using namespace std; typedef long long ll; vector < pair < int, int > > Alice(){ ll x = setN(5000), k = 61; vector < pair < int, int > > g; for(int v = 2; v <= 61; v++) g.push_back({1, v}); for(int v = 2; v <= 61; v++){ if(!(x >> (v - 2) & 1) || k == 5000) continue; x -= (1ll << (v - 2)); for(ll j = 1; j <= 82 && k < 5000; j++) g.push_back({v, ++k}); if(!x) while(k < 5000) g.push_back({v, ++k}); } while(k < 5000) g.push_back({1, ++k}); return g; }
#include <bits/stdc++.h> #include "Bob.h" using namespace std; typedef long long ll; long long Bob(vector < pair < int, int > > V){ ll x = 0; vector < int > g[5050]; for(int i = 0; i < V.size(); i++){ g[V[i].first].push_back(V[i].second); g[V[i].second].push_back(V[i].first); } for(int v = 2; v <= 61; v++){ if(g[v].size() <= 1) continue; x |= (1ll << (v - 2)); } return x; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...