답안 #1099060

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1099060 2024-10-10T12:55:41 Z razivo Flight to the Ford (BOI22_communication) C++17
0 / 100
2 ms 332 KB
#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
//
int t = 30;
int get(int X, int i) {
    return (X>>i)%2;
}
int sen(int i,int c) {
    for (int j = 0; j < c; ++j) {
        send(i);
    }
}
void encode(int N, int X) {
    if(X==1) {
        sen(1,t);
        sen(0,t);
        sen(0,t);
    }else if(X==2) {

        sen(0,t);

        sen(1,t);

        sen(0,t);
    }else {

        sen(0,t);

        sen(0,t);

        sen(1,t);
    }
}

std::pair<int, int> decode(int N) {
    int count1=0;
    for (int i = 0; i < t; ++i) {
        if(receive()==1) count1++;
    }
    int count2=0;
    for (int i = 0; i < t; ++i) {
        if(receive()==1) count2++;
    }
    int count3=0;
    for (int i = 0; i < t; ++i) {
        if(receive()==1) count3++;
    }
    if(count1<=count2&&count1<=count3) {
        return {3,2};
    }
    if(count2<=count1&&count2<=count3) {
        return {3,1};
    }
    if(count3<=count2&&count3<=count1) {
        return {1,2};
    }
}

Compilation message

communication.cpp: In function 'int sen(int, int)':
communication.cpp:22:1: warning: no return statement in function returning non-void [-Wreturn-type]
   22 | }
      | ^
communication.cpp: In function 'std::pair<int, int> decode(int)':
communication.cpp:67:1: warning: control reaches end of non-void function [-Wreturn-type]
   67 | }
      | ^
# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 332 KB Not correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 320 KB Not correct
2 Halted 0 ms 0 KB -