#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
//
void encode(int N, int X) {
int v;
bool floog;
if(X == 1){
send(1);
send(1);
send(1);
}
else if(X == 2){
if(send(0) != 0){
send(1);
send(0);
}
else{
send(0);
send(1);
}
}
else{
send(0);
send(0);
send(0);
}
}
std::pair<int, int> decode(int N) {
vector<int> v;
v.push_back(receive());
v.push_back(receive());
v.push_back(receive());
if(v == vector<int>{1,1,1}){
return make_pair(1,2);
}
else if(v == vector<int>{0,1,1}){
return make_pair(1,2);
}
else if(v == vector<int>{0,1,0}){
return make_pair(1,3);
}
else if(v == vector<int>{1,0,1}){
return make_pair(1,3);
}
else if(v == vector<int>{1,1,0}){
return make_pair(1,2);
}
else if(v == vector<int>{0,0,1}){
return make_pair(2,3);
}
else if(v == vector<int>{0,0,0}){
return make_pair(2,3);
}
else{
return make_pair(2,3);
}
}
Compilation message
communication.cpp: In function 'void encode(int, int)':
communication.cpp:18:9: warning: unused variable 'v' [-Wunused-variable]
18 | int v;
| ^
communication.cpp:19:10: warning: unused variable 'floog' [-Wunused-variable]
19 | bool floog;
| ^~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
9 ms |
1940 KB |
Output is correct |
2 |
Correct |
12 ms |
1660 KB |
Output is correct |
3 |
Correct |
18 ms |
1680 KB |
Output is correct |
4 |
Correct |
12 ms |
1676 KB |
Output is correct |
5 |
Correct |
15 ms |
1756 KB |
Output is correct |
6 |
Correct |
25 ms |
1760 KB |
Output is correct |
7 |
Correct |
36 ms |
1664 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
17 ms |
200 KB |
Not correct |
2 |
Halted |
0 ms |
0 KB |
- |