제출 #1335303

#제출 시각아이디문제언어결과실행 시간메모리
1335303minh30082008메시지 (IOI24_message)C++20
81.45 / 100
397 ms824 KiB
#include "message.h" 
#include<bits/stdc++.h>
#define fi first
#define se second
#define FOR(i, k, n) for(int i = k; i <= n; i++)
#define FOR1(i, k, n) for(int i = k; i >= n; i--)
#define pb push_back
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define vi vector<int>
#define pii pair<int, int>
#define vii vector<pii>
#define ll long long
#define vll vector<ll>
#define pll pair<ll, ll>
#define re return 0
#define mii map<int, int>
#define input "wtf.inp"
#define output "wtf.out"
#define rf 	freopen(input, "r", stdin); freopen(output, "w", stdout)
using namespace std;
const int maxn = 1e5 + 5;
const int mod = 1e9 + 7;
const int base = 65537;
const int base1 = 31;
const int SZ = 320;
const ll INF = 1e18;
const long double EPS = 1e-9;
void add(int &a, int b) 
{
	a += b; 
	if(a >= mod) a -= mod; 
	if(a < 0) a += mod; 
}
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
int randint(int l, int r)
{
	return uniform_int_distribution<int>(l, r) (rd);
}
double rand(double l, double r)
{
	return uniform_real_distribution<double>(l, r) (rd);
}

void send_message(vector<bool> M, vector<bool> C) {
	int vtmin;
	FOR(i, 0, 30)
		if(C[i] == 0)
		{
			vtmin = i;
			break;
		}
	vector<bool> send;
	int solan = 0;
	FOR(i, 0, 30)
		send.pb(0);
	FOR(i, 0, 3)
	{
		int op = ((vtmin >> i) & 1);
		FOR(j, 0, 30)
			send[j] = op;
		send_packet(send);
		solan++;
	}
	vi vt;
	FOR(i, 0, 30)
		if(C[i] == 0)
			vt.pb(i);
	int S = M.size();
	int dem = 0;
	dem = 0;
	FOR(i, vtmin + 1, 29)
	{
		FOR(j, 0, 30)
			send[j] = 0;
		send[vtmin] = C[i];
		FOR(j, 1, min(15, (S - dem)))
		{
			if(M[dem + j - 1] == 1)
				send[vt[j]] = 1;
		}
		if(S - dem < 15)
		{
			int op = M.back();
			op = 1 - op;
			FOR(j, S - dem + 1, 15)
			{
				send[vt[j]] = op;
			}
		}
		dem += 15;
		dem = min(dem, S);
		send_packet(send);
		solan++;
	}
	while(solan < 70)
	{
		FOR(i, 0, 30)
			send[i] = 0;
		FOR(i, 1, min(16, S - dem))
		{
			if(M[dem + i - 1] == 1)
				send[vt[i - 1]] = 1;
		}
		if(S - dem < 16)
		{
			int op = M.back();
			op = 1 - op;
			FOR(j, S - dem + 1, 16)
			{
				send[vt[j - 1]] = op;
			}
		}
		send_packet(send);
		dem += 16;
		dem = min(dem, S);
		solan++;
	}
	return;
}

vector<bool> receive_message(vector<vector<bool>> R) {
	bool vis[35];
	int vtmin = 0;
	FOR(i, 0, 3)
	{
		int dem = 0;
		FOR(j, 0, 30)
			if(R[i][j] == 1)
				dem++;
			else
				dem--;
		if(dem > 0)
			vtmin += (1 << i);
	}
	vi vt;
	vt.pb(vtmin);
	FOR(i, vtmin + 1, 29)
	{
		if(R[i - vtmin + 3][vtmin] == 0)
			vt.pb(i);
	}
	if(vt.size() < 16)
		vt.pb(30);
	vector<bool> ans;
	FOR(i, vtmin + 1, 29)
	{
		FOR(j, 1, 15)
		{
			ans.pb(R[i - vtmin + 3][vt[j]]);
		}
	}
	FOR(i, 29 - vtmin + 4, 69)
	{
		FOR(j, 0, 15)
			ans.pb(R[i][vt[j]]);
	}
	int op = ans.back();
	while(ans.back() == op)
		ans.pop_back();
	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...