Submission #860447

#	Time	Username	Problem	Language	Result	Execution time	Memory
860447		nguyentunglam	Last supper (IOI12_supper)	C++17	8 / 100	2597 ms	20392 KiB

advisor

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

void ComputeAdvice(int *C, int N, int K, int M) {
  int T = log2(N) + 1;
  for(int i = 0; i < N; i++) {
    for(int j = 0; j < T; j++) WriteAdvice(C[i] >> j & 1);
  }
}

assistant

#include "assistant.h"

#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;

int query[N];

bool chosen[N];

vector<int> nxt[N];

void Assist(unsigned char *A, int N, int K, int R) {
  int T = log2(N) + 1;
  int cnt = 0;
  for(int i = 0; i < N; i++) {
    for(int j = 0; j < T; j++) {
      if (int(A[cnt])) query[i] |= (1 << j);
      cnt++;
    }
  }

  for(int i = N - 1; i >= 0; i--) nxt[query[i]].push_back(i);

  priority_queue<pair<int, int> > Q;

  for(int i = 0; i < K; i++) {
//    int tmp = nxt[i].empty() ? N : nxt[i].back();
//    Q.push({tmp, i});
    chosen[i] = 1;
  }

  for(int i = 0; i < N; i++) {
    GetRequest();
    int x = query[i];
    if (chosen[x]) continue;
    pair<int, int> nxt = make_pair(0, 0);
    for(int j = 0; j < N; j++) if (chosen[j]) {
      int head = N;
      for(int k = i; k < N; k++) if (query[k] == j) {
        head = k;
        break;
      }
      nxt = max(nxt, make_pair(head, j));
    }
    int j = nxt.second;
    chosen[j] = 0;
    PutBack(j);
    chosen[x] = 1;
//    if (chosen[x] == 0) {
//      int useless, j; tie(useless, j) = Q.top(); Q.pop();
//      chosen[j] = 0;
//      PutBack(j);
//
//      chosen[x] = 1;
//      nxt[x].pop_back();
//      int tmp = nxt[x].empty() ? N : nxt[x].back();
//      Q.push({tmp, x});
//    }
  }
}

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