oj.uz

답안 #804394

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
804394 2023-08-03T08:30:40 Z Dan4Life 최후의 만찬 (IOI12_supper) C++17
0 / 100
 35 ms 2764 KB 
#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);
}

#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.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 508 KB Output is correct
2 Incorrect 1 ms 604 KB Error - Putting back a color that is not on the scaffold
3 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 35 ms 2704 KB Error - Putting back a color that is not on the scaffold
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 11 ms 2368 KB Error - advice is too long
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 508 KB Error - advice is too long
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 14 ms 2740 KB Error - advice is too long
2 Incorrect 17 ms 2732 KB Error - advice is too long
3 Incorrect 13 ms 2680 KB Error - advice is too long
4 Incorrect 14 ms 2752 KB Error - advice is too long
5 Incorrect 14 ms 2700 KB Error - advice is too long
6 Incorrect 14 ms 2692 KB Error - advice is too long
7 Incorrect 13 ms 2756 KB Error - advice is too long
8 Incorrect 14 ms 2760 KB Error - advice is too long
9 Incorrect 13 ms 2720 KB Error - advice is too long
10 Incorrect 14 ms 2764 KB Error - advice is too long