Submission #749589

#	Time	Username	Problem	Language	Result	Execution time	Memory
749589		SanguineChameleon	Alice, Bob, and Circuit (APIO23_abc)	C++17	8 / 100	67 ms	6928 KiB

abc

#include <bits/stdc++.h>
#include "abc.h"
using namespace std;

// you may find the definitions useful
const int OP_ZERO    = 0;  // f(OP_ZERO,    x0, x1) = 0
const int OP_NOR     = 1;  // f(OP_NOR,     x0, x1) = !(x0 || x1)
const int OP_GREATER = 2;  // f(OP_GREATER, x0, x1) = (x0 > x1)
const int OP_NOT_X1  = 3;  // f(OP_NOT_X1,  x0, x1) = !x1
const int OP_LESS    = 4;  // f(OP_LESS,    x0, x1) = (x0 < x1)
const int OP_NOT_X0  = 5;  // f(OP_NOT_X0,  x0, x1) = !x0
const int OP_XOR     = 6;  // f(OP_XOR,     x0, x1) = (x0 ^ x1)
const int OP_NAND    = 7;  // f(OP_NAND,    x0, x1) = !(x0 && x1)
const int OP_AND     = 8;  // f(OP_AND,     x0, x1) = (x0 && x1)
const int OP_EQUAL   = 9;  // f(OP_EQUAL,   x0, x1) = (x0 == x1)
const int OP_X0      = 10; // f(OP_X0,      x0, x1) = x0
const int OP_GEQ     = 11; // f(OP_GEQ,     x0, x1) = (x0 >= x1)
const int OP_X1      = 12; // f(OP_X1,      x0, x1) = x1
const int OP_LEQ     = 13; // f(OP_LEQ,     x0, x1) = (x0 <= x1)
const int OP_OR      = 14; // f(OP_OR,      x0, x1) = (x0 || x1)
const int OP_ONE     = 15; // f(OP_ONE,     x0, x1) = 1

int encode(string s) {
	int res = 0;
	for (auto c: s) {
		res = res * 26 + (c - 'a');
	}
	int pw = 1;
	for (int i = 1; i <= (int)s.size() - 1; i++) {
		pw = pw * 26;
		res += pw;
	}
	return res;
}

vector<int> build(vector<int> a) {
	int n = a.size();
	if (n <= 1) {
		return vector<int>();
	}
	vector<int> pos(n);
	for (int i = 0; i < n; i++) {
		pos[a[i]] = i;
	}
	vector<vector<pair<int, int>>> adj(n);
	vector<int> swap1(n / 2, -1);
	vector<int> swap2(n / 2, -1);
	int cur = -1;
	if (n % 2 == 1 && pos[n - 1] < n / 2) {
		cur = pos[n - 1];
		swap1[cur] = 1;
	}
	for (int i = 0; i < n / 2; i++) {
		int x = pos[i];
		int y = pos[n / 2 + i];
		if (n % 2 == 1 && (x == n - 1 || y == n - 1)) {
			continue;
		}
		int u = (x < n / 2 ? x : x - n / 2);
		int v = (y < n / 2 ? y : y - n / 2);
		int w = (x < n / 2) ^ (y < n / 2) ^ 1;
		adj[u].emplace_back(v, w);
		adj[v].emplace_back(u, w);
	}
	if (cur != -1) {
		while (true) {
			bool found = false;
			for (auto e: adj[cur]) {
				int nxt = e.first;
				int w = e.second;
				if (swap1[nxt] == -1) {
					swap1[nxt] = swap1[cur] ^ w;
					cur = nxt;
					found = true;
					break;
				}
			}
			if (!found) {
				break;
			}
		}
	}
	for (int i = 0; i < n / 2; i++) {
		if (swap1[i] == -1) {
			cur = i;
			swap1[cur] = 0;
			while (true) {
				bool found = false;
				for (auto e: adj[cur]) {
					int nxt = e.first;
					int w = e.second;
					if (swap1[nxt] == -1) {
						swap1[nxt] = swap1[cur] ^ w;
						cur = nxt;
						found = true;
						break;
					}
				}
				if (!found) {
					break;
				}
			}
		}
	}
	vector<int> al(a.begin(), a.begin() + n / 2);
	vector<int> ar(a.begin() + n / 2, a.end());
	for (int i = 0; i < n / 2; i++) {
		if (swap1[i]) {
			swap(al[i], ar[i]);
		}
	}
	for (int i = 0; i < n / 2; i++) {
		if (al[i] < n / 2) {
			swap2[i] = 0;
		}
		else {
			swap2[i] = 1;
			al[i] -= n / 2;
		}
	}
	for (int i = 0; i < n - n / 2; i++) {
		if (ar[i] >= n / 2) {
			ar[i] -= n / 2;
		}
	}
	vector<int> fl; //= build(al);
	vector<int> fr; //= build(ar);
	vector<int> res(swap1.begin(), swap1.end());
	res.insert(res.end(), fl.begin(), fl.end());
	res.insert(res.end(), fr.begin(), fr.end());
	res.insert(res.end(), swap2.begin(), swap2.end());
	return res;
}

int calc(int n) {
	if (n <= 1) {
		return 0;
	}
	return calc(n / 2) + calc(n - n / 2) + (n / 2) * 2;
}

// Alice
int // returns la
alice(
	/*  in */ const int n,
	/*  in */ const char names[][5],
	/*  in */ const unsigned short numbers[],
	/* out */ bool outputs_alice[]
) {
	vector<pair<int, int>> order(n);
	for (int i = 0; i < n; i++) {
		order[i] = make_pair(encode(names[i]), i);
	}
	sort(order.begin(), order.end());
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < 19; j++) {
			outputs_alice[i * 35 + j] = (order[i].first >> j) & 1;
		}
		for (int j = 0; j < 16; j++) {
			outputs_alice[i * 35 + 19 + j] = (numbers[order[i].second] >> j) & 1;
		}
	}
	vector<int> perm(n);
	for (int i = 0; i < n; i++) {
		perm[i] = order[i].second;
	}
	vector<int> flag = build(perm);
	int sz = flag.size();
	for (int i = 0; i < sz; i++) {
		outputs_alice[n * 35 + i] = flag[i];
	}
	return n * 35 + sz;
}


// Bob
int // returns lb
bob(
	/*  in */ const int m,
	/*  in */ const char senders[][5],
	/*  in */ const char recipients[][5],
	/* out */ bool outputs_bob[]
) {
	vector<int> names(m * 2);
	for (int i = 0; i < m; i++) {
		names[i * 2] = encode(senders[i]);
		names[i * 2 + 1] = encode(recipients[i]);
	}
	sort(names.begin(), names.end());
	names.erase(unique(names.begin(), names.end()), names.end());
	int n = names.size();
	for (int i = 0; i < n * n; i++) {
		outputs_bob[i] = 0;
	}
	for (int i = 0; i < m; i++) {
		int x = lower_bound(names.begin(), names.end(), encode(senders[i])) - names.begin();
		int y = lower_bound(names.begin(), names.end(), encode(recipients[i])) - names.begin();
		outputs_bob[y * n + x] = 1;
	}
	return n * n;
}

int *operations;
int (*operands)[2];
int ZERO_GATE;
int ONE_GATE;
int gate_cnt;

int gate(int op, int x, int y) {
	operations[gate_cnt] = op;
	operands[gate_cnt][0] = x;
	operands[gate_cnt][1] = y;
	return gate_cnt++;
}

pair<int, int> add(int x, int y, int z) {
	int sum1 = gate(OP_XOR, x, y);
	int rem1 = gate(OP_AND, x, y);
	int sum2 = gate(OP_XOR, sum1, z);
	int rem2 = gate(OP_AND, sum1, z);
	return make_pair(sum2, gate(OP_OR, rem1, rem2));
}

vector<int> add(vector<int> num1, vector<int> num2) {
	vector<int> res(16);
	int rem = ZERO_GATE;
	for (int i = 0; i < 16; i++) {
		auto p = add(num1[i], num2[i], rem);
		res[i] = p.first;
		rem = p.second;
	}
	return res;
}

vector<int> mul(vector<int> num, int x) {
	vector<int> res(16);
	for (int i = 0; i < 16; i++) {
		res[i] = gate(OP_AND, num[i], x);
	}
	return res;
}

/*vector<pair<int, int>> swaps;
vector<int> flag;

void shuffle() {
	int sz = swaps.size();
	for (int i = 0; i < sz; i++) {
		swap(swaps[i].first, swaps[i].second, flag[i]);
	}
	swaps.clear();
	flag.clear();
}*/

// Circuit
int // returns l
circuit(
	/*  in */ const int la,
	/*  in */ const int lb,
	/* out */ int _operations[],
	/* out */ int _operands[][2],
	/* out */ int outputs_circuit[][16]
) {
	operations = _operations;
	operands = _operands;
	gate_cnt = la + lb;
	ZERO_GATE = gate(OP_ZERO, 0, 0);
	ONE_GATE = gate(OP_ONE, 0, 0);
	int n = 0;
	while (n * 35 + calc(n) < la) {
		n++;
	}
	vector<vector<int>> nums(n, vector<int>(16));
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < 16; j++) {
			nums[i][j] = i * 35 + 19 + j;
		}
	}
	for (int i = 0; i < n; i++) {
		vector<int> res(16, ZERO_GATE);
		for (int j = 0; j < n; j++) {
			res = add(res, mul(nums[j], la + i * n + j));
		}
		for (int j = 0; j < 16; j++) {
			outputs_circuit[i][j] = res[j];
		}
	}
	return gate_cnt;
}

• Subtask 1: 4 / 4
• Subtask 2: 4 / 4
• Subtask 3: 0 / 4
• Subtask 4: 0 / 24
• Subtask 5: 0 / 24
• Subtask 6: 0 / 6
• Subtask 7: 0 / 18
• Subtask 8: 0 / 10
• Subtask 9: 0 / 6