oj.uz

답안 #599628

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
599628 2022-07-19T17:32:10 Z fvogel499 Flight to the Ford (BOI22_communication) C++17
0 / 100
 1 ms 404 KB 
#include <cassert>
#include "communication.h"
#include <vector>
//
// --- 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
//

std::vector<int> getGroup(std::vector<int> receipt = {}) {
    std::vector<int> over;
    for (int i = 0; i < (1<<4); i++) if (__builtin_popcount(i) <= 1) over.push_back(i);
    over.push_back(1+4);
    over.push_back(1+8);
    over.push_back(2+8);
    std::vector<int> who [1<<4];
    for (int i : over) who[i].push_back(1);
    for (int i : over) who[i^(1+2+4+8)].push_back(2);
    for (int i : over) who[i^(1+8)].push_back(3);
    for (int i = 0; i < (1<<4); i++) {
        while ((int)(who[i].size()) < 2) {
            who[i].push_back(1);
        }
    }
    int comp = 0;
    for (int i = 0; i < 4; i++) {
        int u = receipt.empty() ? receive() : receipt[i];
        if (u) {
            comp |= (1<<i);
        }
    }
    return who[comp];
}

std::vector<int> setGroup(int x) {
    std::vector<int> loc;
    if (x == 1) {
        loc.push_back(send(0));
        loc.push_back(send(0));
        loc.push_back(send(0));
        loc.push_back(send(0));
    }
    else if (x == 2) {
        loc.push_back(send(1));
        loc.push_back(send(1));
        loc.push_back(send(1));
        loc.push_back(send(1));
    }
    else {
        loc.push_back(send(1));
        loc.push_back(send(0));
        loc.push_back(send(0));
        loc.push_back(send(1));
    }
    return getGroup(loc);
}

void setRec(std::vector<int> gr, int x) {
    assert(!gr.empty());
    if (gr.size() == 1) {
        return;
    }
    std::vector<int> sp [3];
    int whereIsX = 0;
    for (int i : gr) {
        int mnv = 0;
        for (int j = 0; j < 3; j++) if (sp[j].size() < sp[mnv].size()) mnv = j;
        if (i == x) whereIsX = mnv;
        sp[mnv].push_back(i);
    }
    std::vector<int> resp = setGroup(whereIsX+1);
    std::vector<int> ng;
    for (int i : resp) for (int j : sp[i-1]) ng.push_back(j);\
    assert(ng.size() < gr.size());
    setRec(ng, x);
}

void encode(int N, int X) {
    assert(N == 3 && (X == 1 || X == 2 || X == 3));
    std::vector<int> gr;
    for (int i = 1; i <= N; i++) gr.push_back(i);
    setRec(gr, X);
}

std::pair<int, int> decode(int N) {
    std::vector<int> resp = getGroup();
    assert(resp.size() == 2);
    int x = resp[0];
    int y = resp[1];
    assert(x == 1 || x == 2 || x == 3);
    assert(y == 1 || y == 2 || y == 3);
    return std::make_pair(x, y);
}

Subtask #1
0.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 404 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 85.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 312 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -