oj.uz

Submission #603867

# Submission time Handle Problem Language Result Execution time Memory
603867 2022-07-24T12:55:06 Z shrimb Flight to the Ford (BOI22_communication) C++17
0 / 100
 4 ms 276 KB 
#include"communication.h"
#include"bits/stdc++.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> rnd = {1, 3, 5, 2, 3, 1, 5, 3, 2, 1, 1,2, 3, 4, 5, 3, 4, 3 ,1, 1, 2, 3, 4,1, 3, 5, 2, 3, 1, 5, 3, 2, 1, 1,2, 3, 4, 5, 3, 4, 3 ,1, 1, 2, 3, 4,1, 3, 5, 2, 3, 1, 5, 3, 2, 1, 1,2, 3, 4, 5, 3, 4, 3 ,1, 1, 2, 3, 4};
    for (int i : rnd) {
        for (int j = 1 ; j <= 5 ; j++) {
            if (!send(1) and j == i) send(X==2), j++;
        }
    }
}

std::pair<int, int> decode(int N) {
    vector<int> rnd = {1, 3, 5, 2, 3, 1, 5, 3, 2, 1, 1,2, 3, 4, 5, 3, 4, 3 ,1, 1, 2, 3, 4,1, 3, 5, 2, 3, 1, 5, 3, 2, 1, 1,2, 3, 4, 5, 3, 4, 3 ,1, 1, 2, 3, 4,1, 3, 5, 2, 3, 1, 5, 3, 2, 1, 1,2, 3, 4, 5, 3, 4, 3 ,1, 1, 2, 3, 4};
    for (int i : rnd) {
        for (int j = 1 ; j <= 5 ; j++) {
            if (!receive() and j == i) {
                return std::pair<int,int>{1, receive() ? 2 : 3};
            }
        }
    }
}

Compilation message

communication.cpp: In function 'std::pair<int, int> decode(int)':
communication.cpp:26:224: warning: control reaches end of non-void function [-Wreturn-type]
   26 |     vector<int> rnd = {1, 3, 5, 2, 3, 1, 5, 3, 2, 1, 1,2, 3, 4, 5, 3, 4, 3 ,1, 1, 2, 3, 4,1, 3, 5, 2, 3, 1, 5, 3, 2, 1, 1,2, 3, 4, 5, 3, 4, 3 ,1, 1, 2, 3, 4,1, 3, 5, 2, 3, 1, 5, 3, 2, 1, 1,2, 3, 4, 5, 3, 4, 3 ,1, 1, 2, 3, 4};
      |                                                                                                                                                                                                                                ^

Subtask #1
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 276 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 85.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 200 KB Not correct
2 Halted 0 ms 0 KB -