oj.uz

답안 #463834

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
463834 2021-08-11T21:25:03 Z dutch 최후의 만찬 (IOI12_supper) C++17
0 / 100
 88 ms 4696 KB 
#include <bits/stdc++.h>
using namespace std;
#include "advisor.h"

void ComputeAdvice(int *C, int N, int K, int M){
	int next[N], last[N];
	fill(last, last+N, N);
	bool on[N], r[N+K] = {};

	for(int i=N; --i>=0; ){
		next[i] = last[C[i]];
		last[C[i]] = i;
		on[i] = i < K;
	}
	priority_queue<array<int, 2>> q;

	for(int i=0; i<N; ++i){
		if(i < K) q.push({last[i], i});
		last[i] = i < K ? i : -1;
	}

	for(int i=0; i<N; ++i){
		if(!on[C[i]]){
			while(!on[q.top()[1]]) q.pop();
			int j = q.top()[1]; q.pop();
			r[last[j]] = !(on[j] = 0);
		}
		q.push({next[C[i]], C[i]});
		on[C[i]] = 1;
		last[C[i]] = K + i;
	}
	for(int i=0; i<N+K; ++i) WriteAdvice(r[i]);
}
#include <bits/stdc++.h>
using namespace std;
#include "assistant.h"

void Assist(unsigned char *A, int N, int K, int R){
	vector<int> s;
	bool on[N] = {};
	for(int i=0; i<K; ++i){
		on[i] = 1;
		if(!!A[i]) s.push_back(i);
	}

	for(int i=0; i<N; ++i){
		int j = GetRequest();
		if(!on[j]){
			PutBack(s.back());
			on[s.back()] = 0;
			s.pop_back();
			on[j] = 1;
		}
		if(!!A[K+i]) s.push_back(j);
	}
}

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 484 KB Output is correct
2 Incorrect 1 ms 484 KB Output isn't correct - not an optimal way
3 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 8 ms 1072 KB Output isn't correct - not an optimal way
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

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

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 640 KB Output isn't correct - not an optimal way
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 88 ms 4544 KB Error - Putting back a color that is not on the scaffold
2 Incorrect 77 ms 4600 KB Error - Putting back a color that is not on the scaffold
3 Incorrect 78 ms 4572 KB Output isn't correct - not an optimal way
4 Incorrect 88 ms 4496 KB Output isn't correct - not an optimal way
5 Incorrect 83 ms 4524 KB Error - Putting back a color that is not on the scaffold
6 Incorrect 76 ms 4496 KB Error - Putting back a color that is not on the scaffold
7 Incorrect 83 ms 4576 KB Error - Putting back a color that is not on the scaffold
8 Incorrect 84 ms 4696 KB Output isn't correct - not an optimal way
9 Incorrect 76 ms 4592 KB Output isn't correct - not an optimal way
10 Incorrect 76 ms 4576 KB Output isn't correct - not an optimal way