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;
//
// --- 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
//
int len=50;
int t[100];
string s[3]={
"10011000010101110000111001010101100100110100101110",
"11001111000110101110110100000001101101001110010000",
"11010110010100001001100011111001100010010011010101"};
void encode(int N, int X) {
for (int i=0;i<len;i++) send(s[X-1][i]-'0');
}
pair<int, int> decode(int N) {
for (int i=0;i<len;i++) t[i]=receive();
vector<int> V;
for (int i=0;i<3;i++) {
int flag=1;
for (int j=1;j<len;j++) {
if (s[i][j-1]-'0'!=t[j-1]&&s[i][j]-'0'!=t[j]) { flag=0; break; }
}
if (flag) V.push_back(i+1);
}
if ((int)V.size()==1) V.push_back(1);
return make_pair(V[0],V[1]);
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |