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 "communication.h"
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb emplace_back
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
typedef long long ll;
typedef pair<int,int> ii;
typedef pair<ii,ii> i4;
typedef vector<int> vi;
const int MOD=1000000007;
const int INF=1012345678;
const ll LLINF=1012345678012345678LL;
const double PI=3.1415926536;
const double EPS=1e-14;
void encode(int N, int X) {
int x=0;
if(X==1){
// [0101...][000 or 111]
// or [11]
}else{
x=1;
// [1010...][000 or 111]
// or [00]
}
for(int i=0;i<10;i++){
if(send(x)!=x){
send(x^1);
break;
}
x^=1;
}
}
pair<int, int> decode(int N) {
int x=receive();
int y=receive();
if(x==y){
if(x==1)return {1,1};
return {2,3};
}
if(x==1)return {2,3};
return {1,1};
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |