제출 #169485

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
169485		arnold518	최후의 만찬 (IOI12_supper)	C++14	0 / 100	436 ms	29680 KiB

advisor

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

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 1e5;

static int *C, N, K, M, B, D[MAXN+10], P[MAXN+10];
static vector<int> T[MAXN+10];

void ComputeAdvice(int *_C, int _N, int _K, int _M)
{
    int i, j;
    C=_C; N=_N; K=_K; M=_M;

    for(i=20; i>=0; i--) if(N&(1<<i)) break;
    B=i+1;

    for(i=N-1; i>=0; i--) T[C[i]].push_back(i);

    set<pii, greater<pii>> PQ;
    for(i=0; i<K; i++)
    {
        if(T[i].empty()) PQ.insert({N, i});
        else PQ.insert({T[i].back(), i}), T[i].pop_back();
        P[i]=1;
    }

    for(i=0; i<N; i++)
    {
        if(P[C[i]])
        {
            PQ.erase({C[i], i});
            if(T[C[i]].empty()) PQ.insert({N, C[i]});
            else PQ.insert({T[C[i]].back(), C[i]}), T[C[i]].pop_back();
            D[i]=(1<<B)-1;
        }
        else
        {
            D[i]=PQ.begin()->second;
            P[PQ.begin()->second]=0;
            PQ.erase(PQ.begin());
            if(T[C[i]].empty()) PQ.insert({N, C[i]});
            else PQ.insert({T[C[i]].back(), C[i]}), T[C[i]].pop_back();
        }
    }

    for(i=0; i<N; i++)
    {
        for(j=0; j<B; j++)
        {
            if(D[i]&(1<<j)) WriteAdvice(1);
            else WriteAdvice(0);
        }
    }
}

assistant

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

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 1e5;

static int N, K, R, B, D[MAXN+10];
unsigned char *A;

void Assist(unsigned char *_A, int _N, int _K, int _R)
{
    int i, j;
    A=_A; N=_N; K=_K; R=_R;

    for(i=20; i>=0; i--) if(N&(1<<i)) break;
    B=i+1;

    int cnt=0;
    for(i=0; i<N; i++) for(j=0; j<B; j++) if(A[cnt++]) D[i]|=(1<<j);

    for(i=0; i<N; i++)
    {
        GetRequest();
        if(D[i]!=(1<<B)-1) PutBack(D[i]);
    }
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 9
• Subtask 3: 0 / 9
• Subtask 4: 0 / 35
• Subtask 5: 0 / 39