# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
656541 | 2022-11-08T00:15:57 Z | definitelynotmee | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++ | 0 ms | 0 KB |
#include<bits/stdc++.h> #define mp make_pair #define mt make_tuple #define all(x) x.begin(), x.end() #define ff first #define ss second using namespace std; template <typename T> using matrix = vector<vector<T>>; typedef unsigned int uint; typedef unsigned long long ull; typedef long long ll; typedef pair<int,int> pii; typedef pair<ll,ll> pll; const ll INFL = (1LL<<62)-1; const int INF = (1<<30)-1; const double EPS = 1e-7; const int MOD = 1e9 + 7; const int RANDOM = chrono::high_resolution_clock::now().time_since_epoch().count(); const int MAXN = 1e6+1; int encode (int n, int x, int y) { vector<int> v(n+1); int id = 1; for(uint i = 0; id <= n; i++){ if(popcount(i) == 6){ v[id] = i; id++; } } for(int i = 0; i < 12; i++){ if(bool(x&(1<<i)) && !bool(y&(1<<i))) return i+1; } }