# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
603528 | 2022-07-24T07:50:00 Z | Abdulmohsen1284 | Flight to the Ford (BOI22_communication) | C++17 | 31 ms | 200 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 // #include <bits/stdc++.h> using namespace std; void encode(int N, int X) { long long bef=-1; while(0==0) { long long val=send((1&X)); if(bef==val) break; bef=val; } bef=-1; while(0==0) { long long val=0; if(X&2==2) val=1; if(bef==val) break; bef=val; } } std::pair<int, int> decode(int N) { long long bef=-1; pair <int,int> r; r.first=3; r.second=0; while(0==0) { long long val=receive(); if(bef==val) break; bef=val; } r.second+=bef; bef=-1; while(0==0) { long long val=receive(); if(bef==val) break; bef=val; } r.second+=bef*2; return r; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 4 ms | 200 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 31 ms | 200 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |