Submission #722948

#	Time	Username	Problem	Language	Result	Execution time	Memory
722948		The_Samurai	Flight to the Ford (BOI22_communication)	C++17	0 / 100	1018 ms	200 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) {
    vector<int> a(2);
    a[1] = (X / 2) % 2;
    a[0] = X % 2;
    for (int i = 0; i < 125; i++) {
        send(a[0]);
        send(a[1]);
    }
}

std::pair<int, int> decode(int N) {
    vector<pair<int, int>> a(2);
    for (int i = 0; i < 124; i++) {
        int x = receive();
        if (x == 0) a[0].first++;
        else a[0].second++;
        x = receive();
        if (x == 0) a[1].first++;
        else a[1].second++;
    }
    int ans = 0;
    if (a[0].first < a[0].second)
        ans += 1;
    if (a[1].first < a[1].second)
        ans += 2;
    int ans2 = ans;
    if (abs(a[0].first - a[0].second) > 50)
        ans2 ^= 1;
    if (abs(a[1].first - a[1].second) > 50)
        ans2 ^= 2;
    return {ans, ans2};
}

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