Submission #1098909

#TimeUsernameProblemLanguageResultExecution timeMemory
1098909not_amirFlight to the Ford (BOI22_communication)C++17
15 / 100
24 ms3064 KiB
#include <algorithm> #include"communication.h" // // --- 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) { if(X == 1) { send(0); send(0); send(0); send(0); } if(X == 2) { send(1); send(1); send(1); send(1); } if(X == 3) { send(1); send(0); send(0); send(1); } } std::pair<int, int> decode(int N) { int curr0 = 0, curr1 = 0; int max0 = 0, max1 = 0; for(int i = 0; i < 4; i++) { if(receive()) { curr0 = 0; curr1++; } else { curr0++; curr1 = 0; } max0 = std::max(curr0, max0); max1 = std::max(curr1, max1); } if(max0 == 1 && max1 == 1) return {1, 2}; if(max0 == 4) return {1, 3}; if(max1 == 4) return {2, 3}; if(max0 > 1) return {1, 3}; if(max1 > 1) return {2, 3}; if(max0 == 1) return {1, 3}; if(max1 == 1) return {2, 3}; }

Compilation message (stderr)

communication.cpp: In function 'std::pair<int, int> decode(int)':
communication.cpp:66:1: warning: control reaches end of non-void function [-Wreturn-type]
   66 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...