oj.uz

답안 #906339

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
906339 2024-01-14T04:32:25 Z Darren0724 Flight to the Ford (BOI22_communication) C++17
15 / 100
 993 ms 3392 KB 
#include"communication.h"
#include<bits/stdc++.h>
using namespace std;
//#include "sample_grader.cpp"
//
// --- 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
//
const int K=250;
void encode(int N, int X) {
    mt19937 rnd(543);
    int a[4][K];
    for(int i=1;i<=3;i++){
        for(int j=0;j<K;j++){
            a[i][j]=rnd()%2;
        } 
    }
    for(int j=0;j<K;j++){
        send(a[X][j]);
    }
}

pair<int, int> decode(int N) {
    mt19937 rnd(543);
    int a[4][K];
    for(int i=1;i<=3;i++){
        for(int j=0;j<K;j++){
            a[i][j]=rnd()%2;
        } 
    }
    for(int i=0;i<K;i++){
        a[0][i]=receive();
    }
    vector<int> ans;
    for(int i=1;i<=3;i++){
        int last=-5;
        int flag=1;
        for(int j=0;j<K;j++){
            if(a[0][j]!=a[i][j]){
                if(j-last==1){
                    flag=0;
                }
                last=j;
            }
        }
        if(flag){
            ans.push_back(i);
        }
    }
    if(ans.size()<2)ans.push_back(2);
    return {ans[0], ans[1]};
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 110 ms 2760 KB Output is correct
2 Correct 146 ms 2840 KB Output is correct
3 Correct 261 ms 2764 KB Output is correct
4 Correct 97 ms 2724 KB Output is correct
5 Correct 142 ms 2816 KB Output is correct
6 Correct 467 ms 3392 KB Output is correct
7 Correct 993 ms 2996 KB Output is correct

Subtask #2
0.0 / 85.0

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