oj.uz

Submission #580611

# Submission time Handle Problem Language Result Execution time Memory
580611 2022-06-21T14:02:34 Z haojiandan Flight to the Ford (BOI22_communication) C++17
15 / 100
 288 ms 1812 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();
	vector<int> V;
	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) V.push_back(i+1);
	}
	if ((int)V.size()==1) V.push_back(1);
	return make_pair(V[0],V[1]);
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 1680 KB Output is correct
2 Correct 71 ms 1808 KB Output is correct
3 Correct 103 ms 1812 KB Output is correct
4 Correct 48 ms 1712 KB Output is correct
5 Correct 55 ms 1692 KB Output is correct
6 Correct 163 ms 1720 KB Output is correct
7 Correct 288 ms 1664 KB Output is correct

Subtask #2
0.0 / 85.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 328 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -