Submission #1227316

#TimeUsernameProblemLanguageResultExecution timeMemory
1227316PVM_pvmMessage (IOI24_message)C++20
49.61 / 100
423 ms876 KiB
#include "message.h" #include<bits/stdc++.h> using namespace std; long long tqh[35]= {1577456404,1911513681,126635695,1315583884,553635556,582712042,197923241,285246256,1210012501,1722838894,1393569048,2097450162,2141823396,2087785973,1055408251,52133245,722166878,1230093970,1052938149,831136841,1754314410,1090124986,174312462,1798759957,1009679296,1314194954,1891372790,236317683,1586886260,471170078,484344262,882549447,1573708182,121774280,90311136}; void send_message(vector<bool> M, vector<bool> C) { srand(158); vector<bool> razkrit(31); for (int q=0;q<31;q++) razkrit[q]=!C[q]; int klk=16; int prv=rand()%10; int vtr=(prv+1)%10; for (int w=0;w<35;w++) { vector<bool> msg(31); for (int q=0;q<31;q++) { if (C[q]) { if (w==prv) msg[q]=(tqh[w]>>q)%2; else if (w==vtr) msg[q]=1-(tqh[w]>>q)%2; else msg[q]=rand()%2; } else { int klk=(tqh[w]>>q)%2; msg[q]=klk; } } vector<bool> rsp=send_packet(msg); for (int q=0;q<31;q++) { if (rsp[q]!=((tqh[w]>>q)%2)) { if (razkrit[q]) continue; razkrit[q]=1; klk++; } } if (klk==31) { //cerr<<w<<" s\n"; break; } } int len=M.size(); int br=0; vector<bool> dylz(31); for (int q=0;q<31;q++) { if (C[q]) dylz[q]=0; else { dylz[q]=len%2; len/=2; } } send_packet(dylz); len=M.size(); for (int cur=0;cur<len;) { vector<bool> syob(31); for (int q=0;q<31;q++) { if (C[q]) syob[q]=0; else { if (cur==len) syob[q]=0; else { syob[q]=M[cur]; cur++; } } } send_packet(syob); } } vector<bool> receive_message(vector<vector<bool>> R) { vector<bool> otg; vector<bool> razkrit(31); int klk=0; int sl; for (int w=0;w<35;w++) { for (int q=0;q<31;q++) { if (R[w][q]!=((tqh[w]>>q)%2)) { if (razkrit[q]) continue; razkrit[q]=1; klk++; } } if (klk==15) { sl=w+1; //cerr<<w<<" r\n"; break; } } int dlz=0; int br=0; for (int q=0;q<31;q++) { if (razkrit[q]) continue; dlz+=R[sl][q]*(1<<br); br++; } //cout<<dlz<<" e dylg\n"; int cur=0; for (int w=sl+1;w<R.size();w++) { for (int q=0;q<31;q++) { if (razkrit[q]) continue; if (cur==dlz) continue; otg.push_back(R[w][q]); cur++; } } return otg; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...