# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
722957 | The_Samurai | Flight to the Ford (BOI22_communication) | C++17 | 0 ms | 0 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"
#include "communication.h"
#include "sample_grader.cpp"
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
//
void encode(int N, int X) {
vector<int> a(2);
a[0] = X % 2;
a[1] = (X / 2) % 2;
for (int i = 0; i < 125; i++) {
send(a[0]);
send(a[1]);
}
}
std::pair<int, int> decode(int N) {
for (int i = 0; i < 124; i++) {
int now = receive();
now += receive() * 2;
if (now == 3) continue;
if (now == 0) return {1, 2};
if (now == 1) return {1, 3};
if (now == 2) return {2, 3};
}
return {3, 3};
}