Submission #722969

#	Time	Username	Problem	Language	Result	Execution time	Memory
722969		The_Samurai	Flight to the Ford (BOI22_communication)	C++17	0 / 100	964 ms	1684 KiB

communication

#include "bits/stdc++.h"
#include "communication.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) {

    for (int i = 0; i < 31; i++) {
        for (int j = 0; j < 4; j++) {
            X ^= j;
            vector<int> a(2);
            a[0] = X % 2;
            a[1] = (X / 2) % 2;
            send(a[0]);
            send(a[1]);
            X ^= j;
        }
    }
}

std::pair<int, int> decode(int N) {
    for (int i = 0; i < 31; i++) {
        for (int j = 0; j < 4; j++) {
            int now = 0;
            now += receive();
            now += receive() * 2;
            now ^= j;
            if (now == 3) continue;
            if (now == 0) return {1, 2};
            if (now == 1) return {1, 3};
            if (now == 2) return {2, 3};
        }
    }
}

Compilation message (stderr)

communication.cpp: In function 'std::pair<int, int> decode(int)':
communication.cpp:44:1: warning: control reaches end of non-void function [-Wreturn-type]
   44 | }
      | ^

• Subtask 1: 0 / 15
• Subtask 2: 0 / 85