oj.uz

Submission #578861

# Submission time Handle Problem Language Result Execution time Memory
578861 2022-06-18T06:15:24 Z Justin1 Last supper (IOI12_supper) C++14
0 / 100
 258 ms 89472 KB 
#include <bits/stdc++.h>
#define f first
#define s second
#include "advisor.h"
using namespace std;

int endK[25005], endN[100005];
deque<int> pos[100005];
set<int> pos2[100005];

void ComputeAdvice(int *C, int N, int K, int M) {
	set<pair<int,int>> scaffold;
	for (int i = 0; i < K; i++) scaffold.insert({i,-1});
	for (int i = 0; i < N; i++) endN[i] = -1;
	for (int i = 0; i < N; i++) pos[C[i]].push_back(i);
	for (int i = 0; i < N; i++) pos[i].push_back(1e9);
	for (int i = 0; i < N; i++) {
		for (auto j : pos[i]) pos2[i].insert(j);
	}
	set<pair<int,int>> cur;
	for (int i = 0; i < K; i++) cur.insert({pos[i][0],i});
	for (int i = 0; i < N; i++) {
		string tmp;
		if (cur.find({pos[C[i]][0],C[i]}) != cur.end()) {
			cur.erase({pos[C[i]][0],C[i]});
			pos[C[i]].pop_front();
			cur.insert({pos[C[i]][0],C[i]});
		} else {
			pos[C[i]].pop_front();
			int tar = (*cur.rbegin()).s;
			auto tmp = *scaffold.lower_bound({tar,INT_MIN});
			if (tmp.s == -1) endK[tmp.f] = i;
			else endN[tmp.s] = i;
			scaffold.erase(scaffold.find(tmp));
			scaffold.insert({C[i],i});
			cur.erase(*cur.rbegin());
			cur.insert({pos[C[i]][0],C[i]});
		}
	}
	for (auto i : scaffold) {
		if (i.s == -1) endK[i.f] = 1e8;
		else endN[i.s] = 1e8;
	}
	for (int i = 0; i < K; i++) {
		int tmp = *pos2[i].lower_bound(0);
		WriteAdvice(tmp > endK[i]);
	}
	for (int i = 0; i < N; i++) {
		int tmp = *pos2[C[i]].upper_bound(i);
		WriteAdvice(tmp > endN[i]);
	}
}
#include <bits/stdc++.h>
#define f first
#define s second
#include "assistant.h"
using namespace std;

deque<int> put;
int col[100005];

void Assist(unsigned char *A, int N, int K, int R) {
	for (int i = 0; i < K; i++) if (A[i]) put.push_back(i);
	for (int i = 0; i < K; i++) col[i] = 1;
	for (int i = K; i < R; i++) {
		int cur = GetRequest();
		if (col[cur]) continue;
		while (!col[put[0]]) put.pop_front();
		PutBack(put[0]);
		col[put[0]] = 0;
		col[cur] = 1;
		put.pop_front();
		if (A[i]) put.push_back(cur);
	}
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 72660 KB Output is correct
2 Runtime error 43 ms 72692 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 53 ms 74480 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 203 ms 85940 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Runtime error 48 ms 73384 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 39.0

# Verdict Execution time Memory Grader output
1 Runtime error 213 ms 88636 KB Execution killed with signal 11
2 Runtime error 215 ms 88836 KB Execution killed with signal 11
3 Runtime error 226 ms 89212 KB Execution killed with signal 11
4 Runtime error 206 ms 89160 KB Execution killed with signal 6
5 Runtime error 206 ms 89236 KB Execution killed with signal 11
6 Runtime error 258 ms 89472 KB Execution killed with signal 6
7 Runtime error 218 ms 89244 KB Execution killed with signal 11
8 Runtime error 229 ms 89136 KB Execution killed with signal 6
9 Runtime error 214 ms 89132 KB Execution killed with signal 11
10 Runtime error 207 ms 89076 KB Execution killed with signal 11