Submission #1227508

#	Time	Username	Problem	Language	Result	Execution time	Memory
1227508		PVM_pvm	메시지 (IOI24_message)	C++20	45.75 / 100	429 ms	876 KiB

message

#include "message.h"
#include<bits/stdc++.h>
using namespace std;
long long tqh[35]={1999294235,1058684364,596066304,1446458460,2124876261,1198264405,1110995158,1465632509,1196806216,1793184664,274011571,434364487,1325353326,1808890517,1838520474,456900292,1843981455,801195814,1170829957,1818665521,1992364171,14154298,227830094,1097110939,640753899,1093769638,1260094631,304213909,2144039495,1107409328,1441093057,1149528208,2139323124,1872827964,401948583};

void send_message(vector<bool> M, vector<bool> C) {
    if (M[0]==0) srand(108);
    else srand(133);
    vector<bool> razkrit(31);
    for (int q=0;q<31;q++) razkrit[q]=!C[q];
    int klk=16;
    for (int w=0;w<35;w++)
    {
        vector<bool> msg(31);
        for (int q=0;q<31;q++)
        {
            if (C[q]) 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;
}

• Subtask 0: 0 / 0
• Subtask 1: 10 / 10
• Subtask 2: 35.7493 / 90