oj.uz

답안 #1098903

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1098903 2024-10-10T09:58:24 Z not_amir Flight to the Ford (BOI22_communication) C++17
0 / 100
 674 ms 2704 KB 
#include <algorithm>

#include"communication.h"
//
// --- 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) {
    if(X == 1)
        for(int i = 0; i < 249; i++)
            send(0);
    else
        for(int i = 0; i < 249; i++)
            send(1);
}

std::pair<int, int> decode(int N) {
    int curr0 = 0, curr1 = 0;
    int max0 = 0, max1 = 0, last;
    for(int i = 0; i < 249; i++) {
        if(last = receive()) {
            curr0 = 0;
            curr1++;
        }
        else {
            curr0++;
            curr1 = 0;
        }
        max0 = std::max(curr0, max0);
        max1 = std::max(curr1, max1);
    }
    if(max0 == 0)
        return {2, 3};
    if(max1 < 2)
        return {1, 3};
    else
        return {2, 3};
}

Compilation message

communication.cpp: In function 'std::pair<int, int> decode(int)':
communication.cpp:29:17: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   29 |         if(last = receive()) {
      |            ~~~~~^~~~~~~~~~~

Subtask #1
0.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 159 ms 2704 KB Output is correct
2 Incorrect 106 ms 332 KB Not correct
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 85.0

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