oj.uz

답안 #723013

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
723013 2023-04-13T07:24:42 Z The_Samurai Flight to the Ford (BOI22_communication) C++17
0 / 100
 45 ms 1804 KB 
#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 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;
    }
}

// 01 -> 10 ->
// 10 -> 01 ->
// 11 -> 00 ->
std::pair<int, int> decode(int N) {
    ::srand(::time(0));
    for (int j = 0; j < 4; j++) {
        int now = 0;
        now += receive();
        now += receive() * 2;
//        cout << j << ' ' << now << endl;
        if (j == 0) {
            if (now == 2) return {2, 3};
            else if (now == 1) return {1, 3};
            else if (now == 0) return {1, 2};
        } else if (j == 1) {
            if (now == 3) return {2, 3};
            else if (now == 0) return {1, 3};
            else if (now == 1) return {1, 2};
        } else if (j == 2) {
            if (now == 0) return {2, 3};
            else if (now == 3) return {1, 3};
            else if (now == 2) return {1, 2};
        } else {
            if (now == 1) return {2, 3};
            else if (now == 2) return {1, 3};
            else if (now == 3) return {1, 2};
        }
    }
    return {rand() % 3 + 1, rand() % 3 + 1};
}
// sampleni ochirdinmi?

Subtask #1
0.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 1680 KB Output is correct
2 Correct 12 ms 1692 KB Output is correct
3 Correct 21 ms 1804 KB Output is correct
4 Incorrect 5 ms 200 KB Not correct
5 Halted 0 ms 0 KB -

Subtask #2
0.0 / 85.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 45 ms 200 KB Not correct
2 Halted 0 ms 0 KB -