제출 #804394

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

advisor

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

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

assistant

#include "assistant.h"
#include <bits/stdc++.h>
using namespace std;
 
void Assist(unsigned char *A, int N, int K, int R) {
 
  int C[N+1]; vector<int> v[N+1];
  for(int i = 0; i < N; i++) C[i]=0;
  for(int i = 0; i < R; i++)
	  C[i/20] |= (1<<(i%20))*A[i];
  set<int> S; set<pair<int,int>> SS;
  for(int i = 0; i < N; i++) v[C[i]].push_back(i);
  for(int i = 0; i < N; i++) v[i].push_back(N);
  for(int i = 0; i < K; i++){
	  int nx = *upper_bound(begin(v[i]),end(v[i]),-1);
	  S.insert(i); SS.insert({nx,i});
  }
  for(int i = 0; i < N; i++) {
    int req = GetRequest();
    if(S.count(req)) continue;
    int getCol = (--end(SS))->second;
    S.erase(getCol); S.insert(req); PutBack(getCol);
    int nx = *upper_bound(begin(v[getCol]),end(v[getCol]),i);
    SS.insert({nx,getCol}); SS.erase(prev(--end(SS)));
    int nx2 = *upper_bound(begin(v[req]),end(v[req]),i);
    SS.insert({nx2,req});
  }
}

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