제출 #130694

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
130694		dragonslayerit	최후의 만찬 (IOI12_supper)	C++14	43 / 100	2569 ms	3248 KiB

advisor

#include "advisor.h"
#include <vector>


void ComputeAdvice(int *C, int N, int K, int M) {
  std::vector<int> reuse(K+N,false);
  std::vector<int> next(N);
  std::vector<int> first(N,N);
  for(int i=N-1;i>=0;i--){
    next[i]=first[C[i]];
    first[C[i]]=i;
  }
  next.insert(next.begin(),first.begin(),first.begin()+K);
  std::vector<int> colors;
  for(int i=0;i<K;i++){
    colors.push_back(i);
  }
  colors.insert(colors.end(),C,C+N);
  //time entered: [0,K) for init, [K,N+K) for added
  //time color will be reused: next[cache[i]]
  std::vector<int> cache(K);
  std::vector<int> where(N,-1);//index in cache for this color, or -1 if not present
  for(int i=0;i<K;i++){
    cache[i]=i;
    where[i]=i;
  }
  for(int i=0;i<N;i++){
    int late=0;
    for(int k=0;k<K;k++){
      if(next[cache[k]]>next[cache[late]]){
	late=k;
      }
    }
    if(where[C[i]]!=-1){
      late=where[C[i]];
      reuse[cache[late]]=true;
    }
    //evict cache[late]
    where[colors[cache[late]]]=-1;
    cache[late]=i+K;
    where[colors[cache[late]]]=late;
  }
  for(int i=0;i<K+N;i++){
    WriteAdvice(reuse[i]);
  }
}

assistant

#include "assistant.h"
#include <vector>

void Assist(unsigned char *A, int N, int K, int R) {
  std::vector<int> advice(A,A+R);
  std::vector<std::pair<int,int> > cache(K);//(color,reused)
  std::vector<int> where(N,-1);//where in cache a color is, or -1 if not present
  for(int i=0;i<K;i++){
    cache[i]={i,advice[i]};
    where[i]=i;
  }
  for(int i=0;i<N;i++){
    int color=GetRequest();
    int evict=0;
    for(int k=0;k<K;k++){
      if(!cache[k].second){
	evict=k;
      }
    }
    if(where[color]!=-1){
      evict=where[color];
    }
    where[cache[evict].first]=-1;
    if(cache[evict].first!=color){
      PutBack(cache[evict].first);
    }
    cache[evict].first=color;
    cache[evict].second=advice[i+K];
    where[cache[evict].first]=evict;
  }
}

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