# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
590326 | penguinhacker | 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"
mt19937 rng(42);
map<bitset<100>, int> mp;
void encode(int n, int x) {
bitset<100> b;
for (int i=0; i<100; ++i)
b[i]=send(rng()%2);
mp[b]=x;
}
pair<int, int> decode(int n) {
bitset<100> b;
for (int i=0; i<100; ++i)
b[i]=receive();
int ans=mp[b];
return {ans, ans};
}