# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
868043 | TAhmed33 | 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>
using namespace std;
vector <string> arr = {
"1010",
"1001",
"0101",
"0100",
"0010",
"0001",
"0000"
};
map <string, vector <int>> x = {{0000, {1}},{0001, {1}},{0010, {1}},{0100, {1}},{0101, {1, 2, 3}},{0110, {2, 3}},{1000, {2, 3}},{1001, {1, 2, 3}},{1010, {1}},{1100, {2, 3}},{1101, {2, 3}},{1110, {2, 3}}};
void encode (int n, int x) {
if (x == 1) {
send(0); send(0); send(0); send(0);
} else if (x == 2) {
send(0); send(0); send(1); send(0);
} else {
send(1); send(1); send(0); send(0);
}
}
pair <int, int> decode (int n) {
string s; for (int i = 0; i < 4; i++) s += (char)(receive() + '0');
if (x[s].size() == 1) {
return {x[s].front(), x[s].front()};
} else {
return {x[s].front(), x[s].back()};
}
}
/*
0000
1100
0010
*/