oj.uz

답안 #591484

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
591484 2022-07-07T13:40:17 Z tutis Flight to the Ford (BOI22_communication) C++17
68 / 100
 3712 ms 2016 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int prob = 1;
#include "communication.h"
int dec3(int x)//4 bit x
{
	vector<int>ger;
	for (int m = 0; m < 16; m++)
	{
		bool ok = true;
		int v = m;
		while (v != 0)
		{
			if (v % 4 == 3)
				ok = false;
			v /= 2;
		}
		if (ok)
			ger.push_back(m);
	}
	int V[4] = {0, 0, 6, 9};
	for (int i = 1; i <= 3; i++)
	{
		bool ok = true;
		for (int j : ger)
			if (x == (V[i] ^ j))
				ok = false;
		if (ok)
			return i;
	}
	assert(false);
	return 0;
}
int enc3(int X)
{
	int v = 0;
	if (X == 1)
		v = 0;
	else if (X == 2)
		v = 6;
	else if (X == 3)
		v = 9;
	int val = 0;
	for (int t = 0; t < 4; t++)
	{
		val += send(v % 2) << t;
		v /= 2;
	}
	return dec3(val);
}
string S4[4] = {"1000",
                "0001",
                "1110",
                "0111"
               };
int conv4(int i)
{
	int v = 0;
	int p = 1;
	for (char c : S4[i])
	{
		if (c == '1')
			v += p;
		p *= 2;
	}
	return v;
}
bitset<4> dec4(int x)//4 bit x
{
	vector<int>ger;
	for (int m = 0; m < 16; m++)
	{
		bool ok = true;
		int v = m;
		while (v != 0)
		{
			if (v % 4 == 3)
				ok = false;
			v /= 2;
		}
		if (ok)
			ger.push_back(m);
	}
	bitset<4>ret;
	for (int i = 0; i < 4; i++)
	{
		for (int j : ger)
			if (x == (conv4(i) ^ j))
				ret[i] = true;
	}
	return ret;
}
bitset<4> enc4(int X)
{
	int v = conv4(X);
	int val = 0;
	for (int t = 0; t < 4; t++)
	{
		val += (send(v % 2) << t);
		v /= 2;
	}
	auto ret = dec4(val);
	assert(ret[X] == true);
	return ret;
}
const int bitcnt = 9;
bitset < 1 << bitcnt > decB(int x) //4 bit x
{
	vector<int>ger;
	for (int m = 0; m < (1 << bitcnt); m++)
	{
		bool ok = true;
		int v = m;
		while (v != 0)
		{
			if (v % 4 == 3)
				ok = false;
			v /= 2;
		}
		if (ok)
			ger.push_back(m);
	}
	bitset < 1 << bitcnt > ret;
	for (int j : ger)
		ret[x ^ j] = true;
	return ret;
}
bitset < 1 << bitcnt > encB(int v)
{
	int val = 0;
	int vv = v;
	for (int t = 0; t < bitcnt; t++)
	{
		val += (send(v % 2) << t);
		v /= 2;
	}
	auto ret = decB(val);
	assert(ret[vv] == true);
	return ret;
}
void encode(int N, int X)
{
	if (N < 3)
		return;
	if (N == 3)
	{
		enc3(X);
		return;
	}
	if (N >= (1 << bitcnt))
	{
		int v = N / (1 << bitcnt);
		int vv = (X - 1) / v;
		vv = min(vv, (1 << bitcnt) - 1);
		bitset < (1 << bitcnt) > gal = encB(vv);
		int sz[(1 << bitcnt)];
		for (int i = 0; i < (1 << bitcnt); i++)
			sz[i] = v;
		sz[(1 << bitcnt) - 1] = N - v * ((1 << bitcnt) - 1);
		int s = 0;
		for (int i = 0; i < (1 << bitcnt); i++)
		{
			if (gal[i])
				s += sz[i];
			else if (i < vv)
				X -= sz[i];
		}
		encode(s, X);
		return;
	}
	if (N >= 4)
	{
		int v = N / 4;
		int vv = (X - 1) / v;
		vv = min(vv, 3);
		bitset<4>gal = enc4(vv);
		int sz[4] = {v, v, v, N - 3 * v};
		int s = 0;
		for (int i = 0; i < 4; i++)
		{
			if (gal[i])
			{
				s += sz[i];
			}
			else if (i < vv)
				X -= sz[i];
		}
		encode(s, X);
		return;
	}
}
pair<int, int> decode(int N)
{
	if (N == 1)
		return {1, 1};
	if (N == 2)
		return {1, 2};
	if (N == 3)
	{
		int val = 0;
		for (int t = 0; t < 4; t++)
			val += receive() << t;
		int v = dec3(val);
		pair<int, int>ans = {1, 2};
		if (v == 1)
			ans.first = 3;
		if (v == 2)
			ans.second = 3;
		return ans;
	}
	if (N >= (1 << bitcnt))
	{
		int re = 0;
		for (int t = 0; t < bitcnt; t++)
			re += receive() << t;
		bitset < (1 << bitcnt) > gal = decB(re);
		int v = N / (1 << bitcnt);
		int sz[(1 << bitcnt)];
		for (int i = 0; i < (1 << bitcnt); i++)
			sz[i] = v;
		sz[(1 << bitcnt) - 1] = N - v * ((1 << bitcnt) - 1);
		int s = 0;
		for (int i = 0; i < (1 << bitcnt); i++)
			if (gal[i])
				s += sz[i];
		pair<int, int>r = decode(s);
		int sum = 0;
		bool ger1 = false;
		bool ger2 = false;
		for (int i = 0; i < (1 << bitcnt); i++)
		{
			if (gal[i])
			{
				if (r.first > sum && r.first <= sum + sz[i] && ger1 == false)
				{
					for (int j = 0; j < i; j++)
						if (gal[j] == false)
							r.first += sz[j];
					ger1 = true;
				}
				if (r.second > sum && r.second <= sum + sz[i] && ger2 == false)
				{
					for (int j = 0; j < i; j++)
						if (gal[j] == false)
							r.second += sz[j];
					ger2 = true;
				}
				sum += sz[i];
			}
		}
		return r;
	}
	if (N >= 4)
	{
		int re = 0;
		for (int t = 0; t < 4; t++)
			re += receive() << t;
		bitset<4> gal = dec4(re);
		int v = N / 4;
		int sz[4] = {v, v, v, N - 3 * v};
		int s = 0;
		for (int i = 0; i < 4; i++)
			if (gal[i])
				s += sz[i];
		pair<int, int>r = decode(s);
		int sum = 0;
		bool ger1 = false;
		bool ger2 = false;
		for (int i = 0; i < 4; i++)
		{
			if (gal[i])
			{
				if (r.first > sum && r.first <= sum + sz[i] && ger1 == false)
				{
					for (int j = 0; j < i; j++)
						if (gal[j] == false)
							r.first += sz[j];
					ger1 = true;
				}
				if (r.second > sum && r.second <= sum + sz[i] && ger2 == false)
				{
					for (int j = 0; j < i; j++)
						if (gal[j] == false)
							r.second += sz[j];
					ger2 = true;
				}
				sum += sz[i];
			}
		}
		return r;
	}
	return { -1, -1};
}
// int main()
// {
// 	for (int t = 0; t < 1000; t++)
// 	{
// 		int N = 1000;
// 		int val = (t % N) + 1;
// 		encode(N, val);
// 		pair<int, int>v = decode(N);
// 		cout << v.first << " " << v.second << endl;
// 		assert(v.first == val || v.second == val);
// 	}
// }

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 1864 KB Output is correct
2 Correct 11 ms 1680 KB Output is correct
3 Correct 12 ms 1684 KB Output is correct
4 Correct 5 ms 1732 KB Output is correct
5 Correct 13 ms 1960 KB Output is correct
6 Correct 21 ms 1904 KB Output is correct
7 Correct 33 ms 1664 KB Output is correct

Subtask #2
52.999965 / 85.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 734 ms 1760 KB Output is partially correct
2 Partially correct 449 ms 1736 KB Output is partially correct
3 Partially correct 436 ms 1720 KB Output is partially correct
4 Partially correct 839 ms 1788 KB Output is partially correct
5 Partially correct 723 ms 1724 KB Output is partially correct
6 Partially correct 598 ms 1720 KB Output is partially correct
7 Partially correct 2398 ms 1860 KB Output is partially correct
8 Partially correct 3509 ms 1960 KB Output is partially correct
9 Partially correct 3170 ms 1888 KB Output is partially correct
10 Partially correct 3154 ms 2016 KB Output is partially correct
11 Partially correct 3405 ms 2000 KB Output is partially correct
12 Partially correct 3360 ms 1884 KB Output is partially correct
13 Partially correct 3470 ms 1868 KB Output is partially correct
14 Partially correct 3275 ms 2000 KB Output is partially correct
15 Partially correct 1916 ms 1892 KB Output is partially correct
16 Partially correct 3712 ms 1840 KB Output is partially correct
17 Partially correct 843 ms 1828 KB Output is partially correct
18 Partially correct 855 ms 1736 KB Output is partially correct
19 Partially correct 874 ms 1824 KB Output is partially correct
20 Partially correct 925 ms 1832 KB Output is partially correct
21 Partially correct 892 ms 1740 KB Output is partially correct
22 Partially correct 999 ms 1888 KB Output is partially correct
23 Partially correct 1418 ms 1864 KB Output is partially correct
24 Correct 8 ms 1724 KB Output is correct
25 Correct 10 ms 1600 KB Output is correct
26 Correct 18 ms 1732 KB Output is correct
27 Correct 12 ms 1600 KB Output is correct
28 Correct 13 ms 1692 KB Output is correct
29 Correct 29 ms 1920 KB Output is correct
30 Correct 25 ms 1740 KB Output is correct