oj.uz

Submission #29709

# Submission time Handle Problem Language Result Execution time Memory
29709 2017-07-20T11:21:07 Z PrOAhMeT Question (Grader is different from the original contest) (CEOI14_question_grader) C++14
0 / 100
 1419 ms 27480 KB 
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define LL long long
#define st first
#define nd second
#define endl '\n'
using namespace std;

static int cnt=0;

int encode (int n, int x, int y) {

	assert(1);
	/*//cout<<"hi "<<n<<" "<<x<<" "<<y<<endl;
	srand(1203);
	vector<int> v;
 	for(int i=1;i<=n;++i)
 		v.pb(i);
 	random_shuffle(v.begin(),v.end());
	int a[n+1];
	for(int i=0;i<n;++i)
		a[v[i]]=i;
	int c=1;
	for(int i=0;;++i) {
		if((a[x]&(1<<i))!=(a[y]&(1<<i))) {
			return c+((a[x]&(1<<i))?1:0);
		}
		c+=2;
	}*/

}
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define LL long long
#define st first
#define nd second
#define endl '\n'
using namespace std;

int decode (int n, int q, int h) {

	//cout<<"out "<<n<<" "<<q<<" "<<h<<endl;
	srand(1203);
	vector<int> v;
 	for(int i=1;i<=n;++i)
 		v.pb(i);
 	random_shuffle(v.begin(),v.end());
 	int a[n+1];
	for(int i=0;i<n;++i)
		a[v[i]]=i;
	q=a[q];
	int xx=(h-1)/2,yy=!(h&1);
	int k=(q&(1<<xx));
	if(k) k=1;
	if(k==yy) return 1;
	else return 0;

}

Compilation message

encoder.cpp: In function 'int encode(int, int, int)':
encoder.cpp:33:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
encoder.cpp: At global scope:
encoder.cpp:11:12: warning: 'cnt' defined but not used [-Wunused-variable]
 static int cnt=0;
            ^

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 1103 ms 27480 KB wrong answer
2 Incorrect 1419 ms 27480 KB wrong answer