제출 #1192818

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1192818		Nelt	메시지 (IOI24_message)	C++20	0 / 100	75 ms	832 KiB

message

#include "message.h"
#include <bits/stdc++.h>
#define endl "\n"
#define ll long long
using namespace std;

void send_message(vector<bool> a, vector<bool> c)
{
    vector<bool> msg(31, 0);
    vector<ll> fixed;
    ll ptr = 0;
    while (ptr < 31)
    {
        if (fixed.empty())
        {
            send_packet(vector<bool>(31, c[ptr]));
            if (c[ptr] == 0)
                fixed.push_back(ptr);
            ptr++;
        }
        else
        {
            ll sz = fixed.size();
            for (ll i = 0; i < sz and ptr < 31; i++, ptr++)
            {
                msg[i] = c[ptr];
                if (c[ptr] == 0)
                    fixed.push_back(ptr);
            }
            send_packet(msg);
        }
    }
    if (fixed.size() != 16) exit(0);
    for (ll i = 0; i < 16; i++)
        msg[fixed[i]] = (a.size() >> i & 1);
    send_packet(msg);
    for (ll i = 0; i < a.size(); i += 16)
    {
        for (ll j = 0; j + i < a.size() and j < 16; j++)
            msg[fixed[j]] = a[i + j];
        send_packet(msg);
    }
}
bool majority(vector<bool> &c)
{
    return count(c.begin(), c.end(), 1) >= 16;
}
vector<bool> receive_message(vector<vector<bool>> a)
{
    vector<bool> c(31, 1);
    ll ptr = 0, cur = 0;
    vector<ll> fixed;
    while (ptr < 31)
    {
        if (fixed.empty())
        {
            c[ptr] = majority(a[cur]);
            cur++;
            if (c[ptr] == 0)
                fixed.push_back(ptr);
            ptr++;
        }
        else
        {
            ll sz = fixed.size();
            for (ll i = 0; i < sz and ptr < 31; i++, ptr++)
            {
                c[ptr] = a[cur][fixed[i]];
                if (c[ptr] == 0)
                    fixed.push_back(ptr);
            }
            cur++;
        }
    }
    if (fixed.size() != 16) exit(0);
    ll sz = 0;
    for (ll i = 0; i < 16; i++)
        if (a[cur][fixed[i]])
            sz += 1 << i;
    vector<bool> ans(sz);
    for (ll i = 0; i < sz; i++)
        ans[i] = a[cur + 1 + (i >> 4)][fixed[i & 15]];
    return ans;
}

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