# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
580528 | 2022-06-21T11:51:59 Z | haojiandan | Flight to the Ford (BOI22_communication) | C++17 | 83 ms | 1704 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 // int len=50; int t[100]; string s[3]={ "10011000010101110000111001010101100100110100101110", "11001111000110101110110100000001101101001110010000", "11010110010100001001100011111001100010010011010101"}; void encode(int N, int X) { for (int i=0;i<len;i++) send(s[X-1][i]-'0'); } pair<int, int> decode(int N) { for (int i=0;i<len;i++) t[i]=receive(); for (int i=0;i<3;i++) { int flag=1; for (int j=1;j<len;j++) { if (s[i][j-1]-'0'!=t[j-1]&&s[i][j]-'0'!=t[j]) { flag=0; break; } } if (flag) return make_pair(i+1,1); } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 47 ms | 1604 KB | Output is correct |
2 | Correct | 83 ms | 1704 KB | Output is correct |
3 | Correct | 79 ms | 1700 KB | Output is correct |
4 | Correct | 56 ms | 1664 KB | Output is correct |
5 | Incorrect | 45 ms | 200 KB | Not correct |
6 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 288 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |