Submission #1194525

#TimeUsernameProblemLanguageResultExecution timeMemory
1194525aykhn메시지 (IOI24_message)C++20
66.72 / 100
433 ms876 KiB
#include "message.h" #include <bits/stdc++.h> using namespace std; int o[4][31] = {{1, 13, 10, 17, 18, 21, 9, 0, 20, 14, 12, 2, 29, 6, 28, 7, 4, 26, 3, 25, 19, 23, 30, 8, 27, 22, 11, 5, 15, 24, 16}, {2, 7, 28, 25, 6, 19, 5, 16, 23, 26, 1, 0, 10, 11, 8, 12, 17, 30, 14, 21, 29, 18, 9, 24, 13, 20, 4, 15, 3, 22, 27}, {9, 1, 4, 6, 20, 21, 29, 27, 19, 26, 22, 11, 0, 16, 28, 15, 3, 12, 14, 10, 24, 13, 2, 25, 30, 5, 7, 17, 18, 23, 8}, {22, 24, 26, 1, 9, 14, 27, 23, 21, 5, 3, 0, 4, 30, 18, 11, 19, 28, 15, 29, 7, 20, 13, 10, 8, 2, 17, 16, 6, 12, 25}}; // int o[31] = {9, 17, 7, 27, 10, 22, 21, 6, 30, 3, 24, 15, 29, 19, 2, 13, 23, 20, 14, 1, 25, 5, 4, 8, 0, 16, 18, 28, 11, 12, 26}; int calc(vector<bool> C, int k) { int res = 0; vector<int> unlock; for (int i = 0; i < 31 && unlock.size() < 16;) { if (31 - i == 16 - (int)unlock.size()) { for (int j = i; j < 31; j++) unlock.push_back(o[k][j]); break; } vector<bool> v; if (unlock.empty()) { if (C[o[k][i]] == 0) v = vector<bool>(31, 1); else v = vector<bool>(31, 0); res++; if (v.back()) unlock.push_back(o[k][i]); i++; continue; } v = vector<bool>(31, 0); int j = 0; while (i < 31 && j < unlock.size()) { if (C[o[k][i]] == 0) v[unlock[j]] = 1, unlock.push_back(o[k][i]); else v[unlock[j]] = 0; i++, j++; } res++; } return res; } void send_message(vector<bool> M, vector<bool> C) { int n = M.size(); int cost[4]; for (int i = 0; i < 4; i++) cost[i] = calc(C, i); int k = min_element(cost, cost + 4) - cost; send_packet(vector<bool>(31, k & 1)); send_packet(vector<bool>(31, k & 2)); vector<int> unlock; for (int i = 0; i < 31 && unlock.size() < 16;) { if (31 - i == 16 - (int)unlock.size()) { for (int j = i; j < 31; j++) unlock.push_back(o[k][j]); break; } vector<bool> v; if (unlock.empty()) { if (C[o[k][i]] == 0) v = vector<bool>(31, 1); else v = vector<bool>(31, 0); send_packet(v); if (v.back()) unlock.push_back(o[k][i]); i++; continue; } v = vector<bool>(31, 0); int j = 0; while (i < 31 && j < unlock.size()) { if (C[o[k][i]] == 0) v[unlock[j]] = 1, unlock.push_back(o[k][i]); else v[unlock[j]] = 0; i++, j++; } send_packet(v); } { vector<bool> v(31, 0); for (int i = 0; i <= 10; i++) v[unlock[i]] = (n >> i & 1); send_packet(v); } for (int i = 0; i < (n + 15) / 16; i++) { vector<bool> v(31, 0); for (int j = 0; j < 16; j++) { if (i * 16 + j >= n) break; v[unlock[j]] = M[i * 16 + j]; } send_packet(v); } } vector<bool> receive_message(vector<vector<bool>> R) { vector<int> unlock; int cur = -1; auto nxt = [&]() { return R[++cur]; }; auto get = [&](vector<bool> A) { int cnt = 0; for (auto i : A) cnt += (int)i; return cnt >= 16; }; int k = get(nxt()) + (get(nxt()) << 1); for (int i = 0; i < 31 && unlock.size() < 16;) { if (31 - i == 16 - (int)unlock.size()) { for (int j = i; j < 31; j++) unlock.push_back(o[k][j]); break; } vector<bool> v = nxt(); if (unlock.empty()) { if (get(v)) unlock.push_back(o[k][i]); i++; continue; } int j = 0; while (i < 31 && j < unlock.size()) { if (v[unlock[j]] == 1) unlock.push_back(o[k][i]); i++, j++; } } vector<bool> sz = nxt(); int n = 0; for (int i = 0; i <= 10; i++) { if (sz[unlock[i]]) n |= (1 << i); } vector<bool> res(n, 0); for (int i = 0; i < (n + 15) / 16; i++) { vector<bool> v = nxt(); for (int j = 0; j < 16; j++) { if (i * 16 + j >= n) break; res[i * 16 + j] = v[unlock[j]]; } } return res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...