제출 #925455

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

advisor

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


#define pii pair<int, int>
#include "advisor.h"

const int INF = 1e9;
void ComputeAdvice(int *C, int N, int K, int M) {

  vector<int> put_down;
  vector<vector<int>> oc;

  int log2 = 1;

  while((1<<log2)<N){
    log2++;
  }

  oc.resize(N);
  for(int i = 0; i<N; i++){
    oc[C[i]].push_back(i);
  }

  set<int> zeros;
  set<int> ones;

  for(int i = 0; i<N; i++){
    oc[i].push_back(INF);
    reverse(oc[i].begin(), oc[i].end());
    if(oc[i].size()==1 || (oc[i].size()==2 && i>=K)){
      zeros.insert(i);
    }
  }

  
  
  set<pii> cur_colors;
  for(int i = 0; i<K; i++){
    cur_colors.insert({oc[i].back(), i});
  }




  
  for(int i = 0; i<N; i++){
    
    int needed = C[i];
    if(cur_colors.find({oc[C[i]].back(), C[i]}) == cur_colors.end()){
      pii removing = *(--cur_colors.end());
      cur_colors.erase(removing);
      if(zeros.find(removing.second) == zeros.end()){
        put_down.push_back(removing.second);
      }
    }
    else{
      cur_colors.erase({oc[needed].back(), needed});
    }
    oc[needed].pop_back();
    cur_colors.insert({oc[needed].back(), needed});

    
  }

  for(int i = 0; i<N; i++){
    if(zeros.find(i) == zeros.end()){
      WriteAdvice(1);
    }
    else{
      
      WriteAdvice(0);
    }
  }
  for(auto e: put_down){
    for(int i = 0; i<log2; i++){
      WriteAdvice((e&(1<<i))>>i);
    }
  }

}

assistant

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


#define pii pair<int, int>

#include "assistant.h"

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

  while((1<<log2)<N){
    log2++;
  }
  set<int> cur_colors;
  for(int i = 0; i<K; i++){
    cur_colors.insert(i);
  }
  vector<int> put_down;
  set<int> zeros;
  for(int i = 0; i<N; i++){
    int val =A[i];
    if(val == 0){
      zeros.insert(i);
    }

  }
  for(int i =N; i<R; i+=log2){
    int val = 0;
    for(int j = 0; j<log2; j++){
      val += A[j+i] * (1<<j);
    }
    put_down.push_back(val);
  }

  reverse(put_down.begin(), put_down.end());
  set<int> zeros_inside;
  for (int i = 0; i < N; i++) {
    int req = GetRequest();
    if(zeros_inside.size()>0 && cur_colors.find(req) == cur_colors.end()){
      //cout<<*zeros_inside.begin()<<endl;
      PutBack(*zeros_inside.begin());
      zeros_inside.erase(zeros_inside.begin());
  
    }
    else if(cur_colors.find(req) == cur_colors.end()){
      //cout<<put_down.back()<<endl;
      PutBack(put_down.back());
      cur_colors.erase(put_down.back());
      put_down.pop_back();
    }


    if(zeros.find(req) != zeros.end()){
      zeros_inside.insert(req);
    }
    else{
      cur_colors.insert(req);
    }
  }

}

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