Submission #272397

#	Time	Username	Problem	Language	Result	Execution time	Memory
272397		sjimed	Last supper (IOI12_supper)	C++14	100 / 100	253 ms	142576 KiB

advisor

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

#define fast ios::sync_with_stdio(false); cin.tie(0);
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
#define em emplace
#define eb emplace_back
#define mp make_pair

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll INF = 1e18;
const int inf = 1e9;

static queue<int> q[100010];
static set<pii> s;
static bool ans[200010];

void ComputeAdvice(int *C, int N, int K, int M) {
  
  for(int i=0; i<N; i++) {
    q[C[i]].em(i);
  }

  for(int i=0; i<N; i++)
    q[i].em(N);

  for(int i=0; i<K; i++) {
    s.insert(mp(q[i].front(), i));
  }

  for(int i=0; i<N; i++) {
    if(s.begin()->fi == i) {
      s.erase(s.begin());
      
      q[C[i]].pop();
      s.insert(mp(q[C[i]].front(), i + K));
    }
    else {
      int x = prev(s.end())->se;
      ans[x] = true;

      s.erase(prev(s.end()));

      q[C[i]].pop();
      s.insert(mp(q[C[i]].front(), i + K));
    }
  }

  for(int i=0; i<N+K; i++) {
    WriteAdvice(ans[i]);
  }
}

assistant

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

#define fast ios::sync_with_stdio(false); cin.tie(0);
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
#define em emplace
#define eb emplace_back
#define mp make_pair

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll INF = 1e18;
const int inf = 1e9;

static int n;
static set<int> t, s;

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

  for(int i=0; i<K; i++) {
    if(A[i]) s.insert(i);
    t.insert(i);
  }

  for(int i = K; i < N + K; i++) {
    int x = GetRequest();

    if(t.find(x) == t.end()) {
      t.insert(x);

      int y = *s.begin();
      s.erase(y);
      t.erase(y);

      PutBack(y);
    }
    
    if(A[i]) s.insert(x);
  }
}

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