# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
666368 | 2022-11-28T10:32:11 Z | mychecksedad | Flight to the Ford (BOI22_communication) | C++17 | 25 ms | 200 KB |
#include"communication.h" #include<bits/stdc++.h> using namespace std; void encode(int N, int X){ for(int j = 0; j < 2; ++j){ send(((1<<j)&X > 0)); send(((1<<j)&X > 0)); } } pair<int, int> decode(int N) { int a = 0, b = 0; int x[4]; for(int j = 0; j < 4; ++j) x[j] = receive(); if(x[0] == x[1]){ a += 1; b += 1; }else if(x[0] != x[1]){ a += 1; } if(x[2] == x[3]){ a += 2; b += 2; }else if(x[2] != x[3]){ b += 2; } if(x[0] != x[1] && x[2] != x[3]) a = b = 3; return {a, b}; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 200 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 25 ms | 200 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |