oj.uz

Submission #271989

# Submission time Handle Problem Language Result Execution time Memory
271989 2020-08-18T08:16:20 Z 송준혁(#5108) Last supper (IOI12_supper) C++14
0 / 100
 107 ms 8664 KB 
#include "advisor.h"
#include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
typedef long long LL;
typedef pair<int,int> pii;

static int A[202020], X[202020], R[101010];
static int B[202020];
static priority_queue<pii> PQ;

void ComputeAdvice(int *C, int N, int K, int M) {
	for (int i=0; i<K; i++) A[i]=i;
	for (int i=0; i<N; i++) A[i+K]=C[i], R[i]=N+K;
	for (int i=N+K-1; i>=0; i--) X[i]=R[A[i]], R[A[i]]=i;
	memset(R, -1, sizeof R);
	for (int i=0; i<K; i++) PQ.push(pii(X[i], i)), R[i]=i;
	for (int i=K; i<K+N; i++){
		if (R[A[i]]<0){
			while (R[A[PQ.top().se]] != PQ.top().se) PQ.pop();
			B[PQ.top().se]=1, R[PQ.top().se]=-1;
			PQ.pop();
		}
		R[A[i]]=i, PQ.push(pii(X[i], i));
	}
	for (int i=0; i<K+N; i++) WriteAdvice(B[i]);
}
#include "assistant.h"
#include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
typedef long long LL;
typedef pair<int,int> pii;

static bool chk[101010];
static set<int> E;

void Assist(unsigned char *A, int N, int K, int R) {
	for (int i=0; i<K; i++){
		if (A[i]) E.insert(i);
		chk[i]=true;
	}
	for (int i=0; i<N; i++){
		int x=GetRequest();
		if (!chk[x]){
			assert(!E.empty());
			PutBack(*E.begin()), chk[*E.begin()]=false, E.erase(E.begin());
		}
		if (A[i+K]) E.insert(x);
		else E.erase(x);
		chk[x]=true;
	}
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1536 KB Output is correct
2 Correct 2 ms 1536 KB Output is correct
3 Correct 2 ms 1536 KB Output is correct
4 Runtime error 4 ms 1792 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 15 ms 2112 KB Output isn't correct - not an optimal way
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 7136 KB Output is correct
2 Correct 95 ms 8408 KB Output is correct
3 Correct 97 ms 8664 KB Output is correct
4 Correct 95 ms 8664 KB Output is correct
5 Incorrect 91 ms 8408 KB Output isn't correct - not an optimal way
6 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1792 KB Output is correct
2 Correct 5 ms 1792 KB Output is correct
3 Runtime error 5 ms 1792 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #5
0.0 / 39.0

# Verdict Execution time Memory Grader output
1 Incorrect 94 ms 8160 KB Output isn't correct - not an optimal way
2 Correct 95 ms 8408 KB Output is correct - 122000 bits used
3 Correct 97 ms 8408 KB Output is correct - 125000 bits used
4 Correct 105 ms 8408 KB Output is correct - 125000 bits used
5 Correct 99 ms 8408 KB Output is correct - 125000 bits used
6 Correct 107 ms 8408 KB Output is correct - 125000 bits used
7 Correct 95 ms 8408 KB Output is correct - 124828 bits used
8 Correct 98 ms 8408 KB Output is correct - 124910 bits used
9 Correct 93 ms 8408 KB Output is correct - 125000 bits used
10 Correct 95 ms 8160 KB Output is correct - 125000 bits used