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;
//#include "sample_grader.cpp"
//
// --- Sample implementation for the task communication ---
//
// To compile this program with the sample grader, place:
// communication.h communication_sample.cpp sample_grader.cpp
// in a single folder, then open the terminal in this directory (right-click onto an empty spot in the directory,
// left click on "Open in terminal") and enter e.g.:
// g++ -std=c++17 communication_sample.cpp sample_grader.cpp
// in this folder. This will create a file a.out in the current directory which you can execute from the terminal
// as ./a.out
// See task statement or sample_grader.cpp for the input specification
//
void encode(int N, int X) {
mt19937 rnd(543);
int a[4][250];
for(int j=0;j<250;j++){
for(int i=1;i<=3;i++){
a[i][j]=rnd()%2;
}
}
for(int j=0;j<250;j++){
send(a[X][j]);
}
}
pair<int, int> decode(int N) {
mt19937 rnd(543);
int a[4][250];
for(int j=0;j<250;j++){
for(int i=1;i<=3;i++){
a[i][j]=rnd()%2;
}
}
for(int i=0;i<250;i++){
a[0][i]=receive();
}
int ans=0;
for(int i=1;i<=3;i++){
int last=-5;
int flag=1;
for(int j=0;j<250;j++){
if(a[0][j]!=a[i][j]){
if(j-last==1){
flag=0;
}
last=j;
}
}
if(flag){
ans=i;
}
}
return {ans, ans};
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |