제출 #958958

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
958958		d4xn	최후의 만찬 (IOI12_supper)	C++17	0 / 100	303 ms	20060 KiB

advisor

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

#define all(x) x.begin(), x.end()

void ComputeAdvice(int *C, int N, int K, int M) {
  int B = log2(K);

  vector<int> idx[N];
  for (int i = 0; i < N; i++) {
    idx[C[i]].push_back(i);
  }
  for (int i = 0; i < N; i++) {
    idx[i].push_back(N);
    reverse(all(idx[i]));
  }

  int shelf[K];
  set<pair<int, int>> st;
  priority_queue<pair<int, int>> pq;
  for (int i = 0; i < K; i++) {
    shelf[i] = i;
    st.insert(make_pair(i, i)); // (color, posicion)
    pq.push(make_pair(idx[i].back(), i)); // (proxima aparicion, posicion)
    idx[i].pop_back();
  }

  for (int i = 0; i < N; i++) {
    int x = C[i];

    auto it = st.lower_bound(make_pair(x, 0));
    if (it != st.end() && it->first == x) continue;

    int y = pq.top().second;
    pq.pop();
    st.erase(make_pair(shelf[y], y));

    for (int j = B; j >= 0; j--) {
      if ((y >> j) & 1) WriteAdvice(1);
      else WriteAdvice(0);
    }
    
    shelf[y] = x;
    st.insert(make_pair(x, y));
    pq.push(make_pair(idx[x].back(), y));
    idx[x].pop_back();
  }
}

assistant

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

void Assist(unsigned char *A, int N, int K, int R) {
  int B = log2(K);

  int shelf[K];
  set<int> st;

  for (int i = 0; i < K; i++) {
    shelf[i] = i;
    st.insert(i);
  }

  int curr = 0;
  for (int i = 0; i < N; i++) {
    int x = GetRequest();
    
    if (st.find(x) != st.end()) continue;

    int y = 0;
    for (int j = B; j >= 0; j--) {
      if (A[curr++] == 1) y ^= (1 << j);
    }

    PutBack(shelf[y]);
    st.erase(shelf[y]);

    shelf[y] = x;
    st.insert(x);
  }

}

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