oj.uz

Submission #668217

# Submission time Handle Problem Language Result Execution time Memory
668217 2022-12-03T10:34:53 Z Sohsoh84 Flight to the Ford (BOI22_communication) C++17
74 / 100
 3006 ms 2016 KB 
#include"communication.h"
#include <bits/stdc++.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

using namespace std;

const int LOG = 30;

int f(int x) {
	return 31 - __builtin_clz(x);
}

void encode(int N, int X) {
	int ans1 = 0, ans2 = 1, lst = -1, lst_ans = -1;
	for (int i = 1; i < LOG; i++) {
		if (ans2 < ans1) swap(ans1, ans2);

		if (ans1 == ans2) {
			ans2 ^= (1 << i);
			continue;
		}

		int x = f(ans1 ^ ans2);
		int a = (lst == x ? lst_ans : send((X >> x) & 1)), b = send((X >> i) & 1), c = send((X >> i) & 1);
		lst = i;
		lst_ans = c;

		if (b == c) {
			ans1 ^= (b << i);
			ans2 ^= (b << i);
			continue;
		}

		int d = send((X >> x) & 1);
		lst = x;
		lst_ans = d;

		if (a == d) {
			if (d) ans1 = ans2;
			else ans2 = ans1;
			ans2 ^= (1 << i);
			continue;
		}

		int tans1 = ((d ? ans2 : ans1) ^ (b << i)); // 0101
		int tans2 = ((a ? ans2 : ans1) ^ (c << i)); // 1010
		ans1 = tans1, ans2 = tans2;
	}
}

pair<int, int> decode(int N) {
	int ans1 = 0, ans2 = 1, lst = -1, lst_ans = -1;
	for (int i = 1; i < LOG; i++) {
		if (ans2 < ans1) swap(ans1, ans2);

		if (ans1 == ans2) {
			ans2 ^= (1 << i);
			continue;
		}

		int x = f(ans1 ^ ans2);
		int a = (lst == x ? lst_ans : receive()), b = receive(), c = receive();
		lst = i;
		lst_ans = c;

		if (b == c) {
			ans1 ^= (b << i);
			ans2 ^= (b << i);
			continue;
		}

		int d = receive();
		lst = x;
		lst_ans = d;

		if (a == d) {
			if (d) ans1 = ans2;
			else ans2 = ans1;
			ans2 ^= (1 << i);
			continue;
		}

		int tans1 = ((d ? ans2 : ans1) ^ (b << i)); // 0101
		int tans2 = ((a ? ans2 : ans1) ^ (c << i)); // 1010
		ans1 = tans1, ans2 = tans2;
	}

	if (ans1 <= 0 || ans1 > N) ans1 = 1;
	if (ans2 <= 0 || ans2 > N) ans2 = 1;
	return {ans1, ans2};
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 1788 KB Output is correct
2 Correct 102 ms 1780 KB Output is correct
3 Correct 153 ms 1736 KB Output is correct
4 Correct 69 ms 1804 KB Output is correct
5 Correct 86 ms 1700 KB Output is correct
6 Correct 246 ms 1820 KB Output is correct
7 Correct 437 ms 1736 KB Output is correct

Subtask #2
59.00003 / 85.0

# Verdict Execution time Memory Grader output
1 Partially correct 642 ms 1684 KB Output is partially correct
2 Partially correct 399 ms 1712 KB Output is partially correct
3 Partially correct 477 ms 1740 KB Output is partially correct
4 Partially correct 581 ms 1720 KB Output is partially correct
5 Partially correct 585 ms 1736 KB Output is partially correct
6 Partially correct 620 ms 1720 KB Output is partially correct
7 Partially correct 1732 ms 1844 KB Output is partially correct
8 Partially correct 3006 ms 2016 KB Output is partially correct
9 Partially correct 2490 ms 1880 KB Output is partially correct
10 Partially correct 2397 ms 2004 KB Output is partially correct
11 Partially correct 2456 ms 1888 KB Output is partially correct
12 Partially correct 2328 ms 1848 KB Output is partially correct
13 Partially correct 2716 ms 1928 KB Output is partially correct
14 Partially correct 2280 ms 2008 KB Output is partially correct
15 Partially correct 1470 ms 1908 KB Output is partially correct
16 Partially correct 2667 ms 1996 KB Output is partially correct
17 Partially correct 747 ms 1812 KB Output is partially correct
18 Correct 707 ms 1792 KB Output is correct
19 Partially correct 680 ms 1876 KB Output is partially correct
20 Correct 661 ms 1780 KB Output is correct
21 Correct 789 ms 1732 KB Output is correct
22 Partially correct 739 ms 1748 KB Output is partially correct
23 Partially correct 1080 ms 1784 KB Output is partially correct
24 Correct 110 ms 1720 KB Output is correct
25 Correct 103 ms 1780 KB Output is correct
26 Correct 173 ms 1680 KB Output is correct
27 Correct 58 ms 1852 KB Output is correct
28 Correct 98 ms 1708 KB Output is correct
29 Correct 251 ms 1920 KB Output is correct
30 Correct 636 ms 1916 KB Output is correct