제출 #125039

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
125039		RockyB	Last supper (IOI12_supper)	C++17	0 / 100	538 ms	46064 KiB

advisor

#include "advisor.h"
#include <bits/stdc++.h>

#define f first
#define s second

#define pb push_back
#define pp pop_back

#define sz(x) (int)x.size()

#define rep(z, a, b) for (int z = (a); (z) <= (b); z++)
#define per(z, a, b) for (int z = (a); (z) >= (b); z--)

using namespace std;

const int MAXN = (int)2e5 + 7;


vector <int> nxt[MAXN];
set <int> in;
set < pair <int, int > > dp;
void ComputeAdvice(int *C, int N, int K, int M) {
  rep(i, 0, N - 1) {
    nxt[i].pb(N);
  }
  per(i, N - 1, 0) {
    nxt[C[i]].pb(i);
  }
  rep(i, 0, K - 1) {
    in.insert(i);
  }
  rep(i, 0, N - 1) {
    dp.insert({nxt[i].back(), i});
  }
  int LOG = log2(N);
  rep(i, 0, N - 1) {
    if (in.count(C[i])) {
      WriteAdvice(0);
      continue;
    }

    while (sz(in) && dp.begin() -> f < i) {
      int x = dp.begin() -> s;
      dp.erase(dp.begin());
      nxt[x].pp();
      dp.insert({nxt[x].back(), x});
    }

    int del = dp.rbegin() -> s;
    in.erase(del);
    in.insert(C[i]);
    WriteAdvice(1);
    rep(j, 0, LOG) {
      if (del & (1 << j)) WriteAdvice(1);
      else WriteAdvice(0);
    }
  }
} 

assistant

#include "assistant.h"
#include <bits/stdc++.h>

#define f first
#define s second

#define pb push_back
#define pp pop_back

#define sz(x) (int)x.size()

#define rep(z, a, b) for (int z = (a); (z) <= (b); z++)
#define per(z, a, b) for (int z = (a); (z) >= (b); z--)

using namespace std;

const int MAXN = (int)2e5 + 7;

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

  for (int i = 0; i < R; ) {
    GetRequest();
    if (A[i] == 0) {
      i++;
      continue;
    }
    else {
      i++;
      int val = 0;
      rep(j, 0, LOG) {
        if (A[i + j]) val |= 1 << j;
      }
      i += LOG;
      PutBack(val);
    }
  }
}

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