# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
110556 | ckodser | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++14 | 7086 ms | 5628 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#include <functional>
#define ll long long
#define pb push_back
#define mp make_pair
#define ld long double
#define F first
#define S second
#define pii pair<ll,ll>
using namespace :: std;
const ll mod=1e9+7;
const ll maxn=1000;
const ll inf=1e9+900;
ll f[maxn];
void bild(){
ll m=(1<<12);
ll cnt=1;
for(ll i=0;i<m;i++){
if(__builtin_popcount(i)==6){
f[cnt]=i;
cnt++;
}
}
}
int encode(int n, int x, int y) {
bild();
for(ll i=0;i<12;i++){
if(((f[x]>>i)&1)==0 && ((f[y]>>i)&1)==1){
return i+1;
}
}
}
#include<bits/stdc++.h>
#include <functional>
#define ll long long
#define pb push_back
#define mp make_pair
#define ld long double
#define F first
#define S second
#define pii pair<ll,ll>
using namespace :: std;
const ll mod=1e9+7;
const ll maxn=1000;
const ll inf=1e9+900;
ll f[maxn];
void bild(){
ll m=(1<<12);
ll cnt=1;
for(ll i=0;i<m;i++){
if(__builtin_popcount(i)==6){
f[cnt]=i;
cnt++;
}
}
}
int decode(int n, int q, int h) {
bild();
h--;
return ((f[q]>>h)&1);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |