oj.uz

답안 #419167

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
419167 2021-06-06T13:55:35 Z arayi 최후의 만찬 (IOI12_supper) C++17
0 / 100
 122 ms 32840 KB 
#include "advisor.h"
#include <iostream>
#include <vector>
#include <queue>
#define MP make_pair
#define fr first
#define sc second
#define ad push_back
using namespace std;
const int N = 1e6 + 30;


int i1 = 0;
int col[N], b[N], c[N];
int ans[N];
vector<int> fp[N];
void ComputeAdvice(int *C, int N, int K, int M)
{
	for (int i = 0; i < N; i++) fp[i].ad(N);
	for (int i = N - 1; i >= 0; i--) fp[C[i]].ad(i);
	priority_queue <pair<int, int> > q;
	for (int i = 1; i <= K; i++) q.push(MP(fp[i - 1].back(), i)), col[i - 1] = i, b[i] = i - 1, c[i] = i - 1;
	i1 = K;
	for (int i = 0; i < N; i++)
	{
		fp[C[i]].pop_back();
		if (col[C[i]])
		{
			q.push(MP(fp[C[i]].back(), col[C[i]]));
			c[col[C[i]]] = i1 + i;
			continue;
		}
		int p = q.top().sc;
		q.pop();
		col[b[p]] = 0, col[C[i]] = p;
		ans[c[p]] = 1, c[p] = i1 + i;
		b[p] = C[i];
		q.push(MP(fp[C[i]].back(), col[C[i]]));
	}
	for (int i = 0; i < i1; i++) WriteAdvice(ans[i]);
}

#include "assistant.h"
#include <iostream>
#include <stack>
#include <vector>
#include <queue>
#define MP make_pair
#define fr first
#define sc second
#define ad push
using namespace std;
const int N1 = 1e6 + 30;

int ii;
int col1[N1], b1[N1];
queue <int> fp1;
void Assist(unsigned char *A, int N, int K, int R) 
{
	for (int i = 1; i <= K; i++)
	{
		col1[i - 1] = i, b1[i] = i - 1;
		if (A[i - 1]) fp1.ad(i);
	}
	ii = K;
	for (int i = 0; i < N; i++)
	{
		int a = GetRequest();
		if (col1[a])
		{
			if (A[ii + i]) fp1.ad(col1[a]);
			continue;
		}
		int p = fp1.front();
		fp1.pop();
		PutBack(b1[p]);
		col1[b1[p]] = 0, col1[a] = p;
		b1[p] = a;
		if (A[ii + i]) fp1.ad(col1[a]);
	}
}

Subtask #1
0 / 8.0

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

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 20 ms 25216 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 75 ms 30784 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 19 ms 24636 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 103 ms 32552 KB Execution killed with signal 11
2 Runtime error 112 ms 32840 KB Execution killed with signal 11
3 Runtime error 101 ms 32628 KB Execution killed with signal 11
4 Runtime error 122 ms 32628 KB Execution killed with signal 11
5 Runtime error 113 ms 32572 KB Execution killed with signal 11
6 Runtime error 97 ms 32692 KB Execution killed with signal 6
7 Runtime error 95 ms 32600 KB Execution killed with signal 11
8 Runtime error 95 ms 32640 KB Execution killed with signal 11
9 Runtime error 105 ms 32652 KB Execution killed with signal 11
10 Runtime error 105 ms 32256 KB Execution killed with signal 11