Submission #1180482

#	Time	Username	Problem	Language	Result	Execution time	Memory
1180482		n3rm1n	최후의 만찬 (IOI12_supper)	C++20	19 / 100	375 ms	79560 KiB

advisor

#include<bits/stdc++.h>
#include "advisor.h"
using namespace std;
const int maxn = 1e5 + 10;
int last[maxn], bitcnt;
int getlog(int x)
{
 for (int i = 0; i < 20; ++ i)
    {
        int p = (1 << i);
        if(p > x + 1)return i;
    }
}
void givebits(int x)
{
    for (int i = 0; i < bitcnt; ++ i)
    {
        if((1 << i) & x)WriteAdvice(1);
        else WriteAdvice(0);
    }
}
map < int, int > mp;
deque < int > as[maxn];
void ComputeAdvice(int *C, int N, int K, int M)
{
    mp.clear();

    int n = N;
    int k = K;
    int m = M;
    bitcnt = getlog(N);
   // cout << "bitcount " << bitcnt << endl;
    for (int i = 0; i < n; ++ i)
    {
        as[C[i]].push_back(i);
    }

    for (int i = 0; i < n; ++ i)
    {

        as[i].push_back(n);
    }

    set < pair < int, int > > q;
     for (int i = 0; i < K; ++ i)
    {
        mp[i] = 1;
        q.insert(make_pair(as[i].front(), i));
    }
    for (int i = 0; i < n; ++ i)
    {

      assert(q.size() == K);
        if(mp[C[i]])
        {
           // WriteAdvice(0);
            givebits(n+1);
            as[C[i]].pop_front();
             int newlast = as[C[i]].front();
            q.erase(make_pair(i, C[i]));
            q.insert(make_pair(newlast, C[i]));

        }
        else
        {
           // WriteAdvice(1);
            pair < int, int > w = *q.rbegin();
            assert(mp[w.second]);
            int index = w.second;
           // cout << " remove " << index << endl;
            q.erase(w);
            //cout << "- " << w.first << " " << w.second << endl;
           // assert(index != 310);
            givebits((index));

            as[C[i]].pop_front();
            int newlast = as[C[i]].front();
            q.insert(make_pair(newlast, C[i]));
           // if(index == 310)cout << "PROBLEM PROBLEM " << C[i] << endl;
           // cout << "+ " << newlast << " " << C[i] << endl;
            mp[index] = 0;
            mp[C[i]] = 1;
        }

    }
}

assistant

#include <bits/stdc++.h>
#include "assistant.h"
#define pb push_back
using namespace std;
const int maxnn = 1e5 + 10;
vector < int > g;
int n, bitche;
int getlog2(int x)
{

    for (int i = 0; i < 20; ++ i)
    {
        int p = (1 << i);
        if(p > x + 1)return i;
    }
}
int curr_bit = 0;
int get_bits()
{
    int ans = 0;
    for (int i = 0; i < bitche; ++ i)
    {
        if(g[curr_bit])ans = (ans | (1 << i));
        curr_bit ++;
    }
    return ans;
}

void Assist(unsigned char *A, int N, int K, int R)
{

    n = N;
    bitche = getlog2(N);
  //  cout << "bitche = " << bitche << endl;
  for (int i = 0; i < R; ++ i)
  {
      g.pb(A[i]);
  }

    for (int i = 0; i < N; ++ i)
    {int curr = GetRequest();
       /*
        int type = g[curr_bit];
       // assert(g.size())
        curr_bit ++;
        if(type == 0)continue;*/
        int x = get_bits();
        if(x != n+1)PutBack(x);
       // if(x == 310)cout << i << endl;
        //assert(x != 310);


    }
}

Compilation message (stderr)

# 1번째 컴파일 단계

advisor.cpp: In function 'int getlog(int)':
advisor.cpp:13:1: warning: control reaches end of non-void function [-Wreturn-type]
   13 | }
      | ^

# 2번째 컴파일 단계

assistant.cpp: In function 'int getlog2(int)':
assistant.cpp:16:1: warning: control reaches end of non-void function [-Wreturn-type]
   16 | }
      | ^

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