oj.uz

답안 #419144

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
419144 2021-06-06T13:27:59 Z arayi 최후의 만찬 (IOI12_supper) C++17
0 / 100
 159 ms 33448 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 = 0; i < K; i++) q.push(MP(fp[i].back(), i)), col[i] = i, b[i] = i;
	for (int i = 0; i < N; i += K)
	{
		int ss = min(N, i + K) - i;
		for (int j = 0; j < ss; j++) c[j] = i1 + j;
		for (int j = i; j < min(N, i + K); j++) 
		{
			fp[C[j]].pop_back();
			if (col[C[j]])
			{
				q.push(MP(fp[C[j]].back(), col[C[j]]));
				continue;
			}
			int p = q.top().sc;
			q.pop();
			ans[c[p]] = 1;
			col[C[j]] = p, col[b[p]] = 0;
			b[p] = C[j], c[p] = i1 + ss + j - i;
			q.push(MP(fp[C[j]].back(), p));
		}
		i1 += ss * 2;
	}
	for (int i = 0; i < i1; i++) WriteAdvice(ans[i]);
}

#include "assistant.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 N1 = 1e6 + 30;

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

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 15 ms 24076 KB Error - Putting back a color when it is already on the scaffold
2 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 25 ms 25072 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 114 ms 30672 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 22 ms 24416 KB Error - Putting back a color that is not on the scaffold
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 144 ms 32516 KB Error - Putting back a color that is not on the scaffold
2 Incorrect 149 ms 32288 KB Error - Putting back a color when it is already on the scaffold
3 Incorrect 157 ms 32444 KB Error - Putting back a color when it is already on the scaffold
4 Incorrect 135 ms 32368 KB Error - Putting back a color that is not on the scaffold
5 Incorrect 143 ms 32348 KB Error - Putting back a color when it is already on the scaffold
6 Incorrect 130 ms 32388 KB Error - Putting back a color that is not on the scaffold
7 Incorrect 138 ms 32388 KB Error - Putting back a color when it is already on the scaffold
8 Incorrect 138 ms 32468 KB Error - Putting back a color that is not on the scaffold
9 Incorrect 149 ms 32288 KB Error - Putting back a color that is not on the scaffold
10 Runtime error 159 ms 33448 KB Execution killed with signal 11