oj.uz

Submission #829845

# Submission time Handle Problem Language Result Execution time Memory
829845 2023-08-18T15:21:54 Z MODDI Last supper (IOI12_supper) C++14
0 / 100
 30 ms 16188 KB 
#include <bits/stdc++.h>
#include "advisor.h"
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;

int n;
vi G[100005];
priority_queue<pii> activasion;
set<int> in_pq;
vi advice, out;
void ComputeAdvice(int *C, int N, int K, int M) {
	n = N;
	for(int i = n-1; i >= 0; i--)
		G[C[i]].pb(i);
	
	for(int i = 0; i < K; i++){
		int when = n - 1;
		if(!G[i].empty()) when = G[i].back();
		activasion.push(mp(-when, i));
		in_pq.insert(i);
	}
	advice.resize(n+K, 1);
	out.resize(K);
	iota(out.begin(), out.end(), 1);
	for(int i = 0; i < n; i++){
		G[C[i]].pop_back();
		out[C[i]] = K + i;
		if(in_pq.find(C[i]) != in_pq.end()){
			pii sega = activasion.top();
			activasion.pop();
			in_pq.erase(sega.second);
			advice[out[sega.second]] = 0;
		}
		int when = 0;
		in_pq.insert(C[i]);
		if(G[C[i]].empty())when = n+1;
		else when = G[C[i]].back();
		activasion.push(mp(-when, C[i]));
	}
	for(int i = 0; i < n; i++)
		WriteAdvice(advice[i]);
}
#include "assistant.h"
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
void Assist(unsigned char *A, int N, int K, int R) {
	int n = N, k = K;
	set<int> odma, in;
	for(int i = 0; i < K; i++){
		if(A[i] == 0)	odma.insert(i);
		
		in.insert(i);
	}
	for(int i = 0; i < n; i++){
		int adv = GetRequest();
		if(odma.find(adv) == odma.end()){
			PutBack(*odma.begin());
			in.erase(*odma.begin());
			odma.erase(*odma.begin());
		}
		in.insert(adv);
		if(A[i+k] == 0)	odma.insert(adv);
	}
}

Subtask #1
0 / 8.0

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

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 5 ms 6052 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 18 ms 12120 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 4 ms 5480 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 24 ms 13296 KB Execution killed with signal 11
2 Runtime error 21 ms 13544 KB Execution killed with signal 11
3 Runtime error 23 ms 13992 KB Execution killed with signal 11
4 Runtime error 23 ms 13924 KB Execution killed with signal 11
5 Runtime error 24 ms 13908 KB Execution killed with signal 11
6 Runtime error 30 ms 13924 KB Execution killed with signal 11
7 Runtime error 23 ms 13896 KB Execution killed with signal 11
8 Runtime error 22 ms 13928 KB Execution killed with signal 11
9 Runtime error 21 ms 13952 KB Execution killed with signal 11
10 Runtime error 23 ms 16188 KB Execution killed with signal 11