제출 #1099094

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1099094		LIA	Flight to the Ford (BOI22_communication)	C++17	0 / 100	5 ms	332 KiB

communication

#include "communication.h"
#include <bits/stdc++.h>
using namespace std;

void encode(int N, int X) {
    if (X == 1) {
        for (int i = 0; i < 4; ++i) {
            send(0);
        }
    } else if (X == 2) {
        for (int i = 0; i < 4; ++i) {
            send(1);
        }
    } else if (X == 3) {
        send(1);
        send(0);
        send(0);
        send(1);
    }
}

pair<int, int> decode(int N) {
    vector<int> receivedSignals;
    for (int i = 0; i < 4; ++i) {
        receivedSignals.push_back(receive());
    }

    int count0 = 0, count1 = 0;
    for (int signal : receivedSignals) {
        if (signal == 0) {
            count0++;
            count1 = 0;
        } else {
            count1++;
            count0 = 0;
        }
    }
    if (count0 == 1 && count1 == 1) return {1, 2};
    if (count1 > 1)return {2, 3};

    if (count0 > 1)return {1, 3};
    if (count0 == 1)return {1, 3};
    if (count0 == 4)return {1, 3};
    if (count1 == 1)return {2, 3};
    if (count1 == 4)return {2, 3};


    return {1, 2};
}

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