# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
320264 | tasfiq4 | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++14 | 3 ms | 656 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>
using namespace std;
typedef pair<int,int > pii;
typedef long long int lld;
#define pi acos(-1)
#define fr(i,m,n) for(i=m;i<n;i++)
#define fu(i,m,n) for(i=m;i>=n;i--)
#define vec vector<int>
#define pb push_back
#define pp pop_back()
#define ft first
#define sd second
#define all(v) v.begin(),v.end()
#define mom(ara) memset(ara,0,sizeof(ara));
#define m1m(ara) memset(ara,-1,sizeof(ara));
#define endl "\n"
#define eps 1.19209e-07
bool did=false;
int encode (int n, int x, int y) {
vec code[1000];
int mask,i,j,cnt=1,z;
vec h;
fr(i,0,12) if(i<6) h.pb(1);
else h.pb(0);
if(!did){
do
{
fr(i,0,12)
{
code[cnt].pb(h[i]);
}
cnt++;
}while(next_permutation(all(h)));
did=true;
}
fr(i,0,12)
{
if(code[x][i]==1 && code[y][i]==0) return i+1;
}
}
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int > pii;
typedef long long int lld;
#define pi acos(-1)
#define fr(i,m,n) for(i=m;i<n;i++)
#define fu(i,m,n) for(i=m;i>=n;i--)
#define vec vector<int>
#define pb push_back
#define pp pop_back()
#define ft first
#define sd second
#define all(v) v.begin(),v.end()
#define mom(ara) memset(ara,0,sizeof(ara));
#define m1m(ara) memset(ara,-1,sizeof(ara));
#define endl "\n"
#define eps 1.19209e-07
bool did=false;
int decode (int n, int q, int h) {
vec code[1000];
int mask,i,j,cnt=1,z;
vec g;
fr(i,0,12) if(i<6) g.pb(1);
else g.pb(0);
if(!did){
do
{
fr(i,0,12)
{
code[cnt].pb(g[i]);
}
cnt++;
}while(next_permutation(all(g)));
did=true;
}
if(code[q][h-1]==1) return 1;
else return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |