oj.uz

Submission #1012059

# Submission time Handle Problem Language Result Execution time Memory
1012059 2024-07-01T15:17:30 Z AmirAli_H1 Last supper (IOI12_supper) C++17
100 / 100
 69 ms 11204 KB 
// In the name of Allah

#include <bits/stdc++.h>
using namespace std;

typedef		long long int			ll;
typedef		long double				ld;
typedef		pair<int, int>			pii;
typedef		pair<ll, ll>			pll;
typedef		complex<ld>				cld;

#define		all(x)					(x).begin(),(x).end()
#define		len(x)					((ll) (x).size())
#define		F						first
#define		S						second
#define		pb						push_back
#define		sep						' '
#define		endl					'\n'
#define		Mp						make_pair
#define		kill(x)					cout << x << '\n', exit(0)
#define		set_dec(x)				cout << fixed << setprecision(x);
#define		file_io(x,y)			freopen(x, "r", stdin); freopen(y, "w", stdout);

static int n, k, m;
const static int maxn = 2e5 + 7;
static int A[maxn], val[maxn], ind[maxn];
static int M[maxn], res[maxn];
static priority_queue<pii> qu;
static int mark[maxn];

void WriteAdvice(unsigned char a);

void ComputeAdvice(int C[], int Nx, int Kx, int Mx) {
	n = Nx; k = Kx; m = Mx;
	n += k;
	
	for (int i = 0; i < k; i++) A[i] = i;
	for (int i = k; i < n; i++) A[i] = C[i - k];
	
	fill(ind, ind + n, n);
	for (int i = n - 1; i >= 0; i--) {
		val[i] = ind[A[i]];
		ind[A[i]] = i;
	}
	
	fill(mark, mark + n, 0);
	while (!qu.empty()) qu.pop();
	fill(M, M + n, -1); fill(res, res + n, 1);
	for (int i = 0; i < k; i++) {
		qu.push(Mp(val[i], i));
		mark[i] = 1; M[A[i]] = i;
	}
	for (int i = k; i < n; i++) {
		while (!qu.empty()) {
			auto f = qu.top(); int r = f.S;
			if (mark[r]) break;
			else qu.pop();
		}
		
		int j = M[A[i]];
		if (j != -1) {
			mark[j] = 0;
		}
		else {
			auto f = qu.top(); qu.pop();
			int r = f.S; mark[r] = 0;
			res[r] = 0; M[A[r]] = -1;
		}
		qu.push(Mp(val[i], i));
		mark[i] = 1; M[A[i]] = i;
	}
	
	for (int i = 0; i < n; i++) {
		if (res[i]) WriteAdvice(1);
		else WriteAdvice(0);
	}
}
// In the name of Allah

#include <bits/stdc++.h>
using namespace std;

typedef		long long int			ll;
typedef		long double				ld;
typedef		pair<int, int>			pii;
typedef		pair<ll, ll>			pll;
typedef		complex<ld>				cld;

#define		all(x)					(x).begin(),(x).end()
#define		len(x)					((ll) (x).size())
#define		F						first
#define		S						second
#define		pb						push_back
#define		sep						' '
#define		endl					'\n'
#define		Mp						make_pair
#define		kill(x)					cout << x << '\n', exit(0)
#define		set_dec(x)				cout << fixed << setprecision(x);
#define		file_io(x,y)			freopen(x, "r", stdin); freopen(y, "w", stdout);

static int n, k, m;
const static int maxn = 2e5 + 7;
static int A[maxn], M[maxn];
static priority_queue<pii> qu;
static int mark[maxn];

void PutBack(int T);

int GetRequest();

void Assist(unsigned char res[], int Nx, int Kx, int Rx) {
	n = Nx; k = Kx; m = Rx;
	n += k;
	
	fill(mark, mark + n, 0);
	while (!qu.empty()) qu.pop();
	fill(M, M + n, -1);
	for (int i = 0; i < k; i++) {
		qu.push(Mp(-res[i], i)); mark[i] = 1;
		A[i] = i; M[A[i]] = i;
	}
	
	for (int i = k; i < n; i++) {
		while (!qu.empty()) {
			auto f = qu.top(); int r = f.S;
			if (mark[r]) break;
			else qu.pop();
		}
		
		A[i] = GetRequest();
		if (M[A[i]] != -1) {
			int j = M[A[i]]; mark[j] = 0;
			M[A[i]] = -1;
		}
		else {
			auto f = qu.top(); qu.pop();
			int j = f.S; mark[j] = 0;
			M[A[j]] = -1; PutBack(A[j]);
		}
		qu.push(Mp(-res[i], i)); mark[i] = 1;
		M[A[i]] = i;
	}
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 800 KB Output is correct
2 Correct 0 ms 792 KB Output is correct
3 Correct 1 ms 804 KB Output is correct
4 Correct 2 ms 1080 KB Output is correct
5 Correct 2 ms 1116 KB Output is correct
6 Correct 3 ms 1112 KB Output is correct
7 Correct 2 ms 1364 KB Output is correct
8 Correct 2 ms 1116 KB Output is correct
9 Correct 2 ms 1108 KB Output is correct
10 Correct 3 ms 1368 KB Output is correct
11 Correct 3 ms 1372 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1692 KB Output is correct
2 Correct 23 ms 5560 KB Output is correct
3 Correct 69 ms 11204 KB Output is correct
4 Correct 38 ms 8152 KB Output is correct
5 Correct 36 ms 8472 KB Output is correct
6 Correct 49 ms 9284 KB Output is correct
7 Correct 46 ms 10624 KB Output is correct
8 Correct 35 ms 9004 KB Output is correct
9 Correct 33 ms 8276 KB Output is correct
10 Correct 46 ms 11064 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 8576 KB Output is correct
2 Correct 43 ms 10904 KB Output is correct
3 Correct 54 ms 10916 KB Output is correct
4 Correct 53 ms 11152 KB Output is correct
5 Correct 45 ms 10668 KB Output is correct
6 Correct 46 ms 10800 KB Output is correct
7 Correct 54 ms 10996 KB Output is correct
8 Correct 40 ms 10388 KB Output is correct
9 Correct 41 ms 11164 KB Output is correct
10 Correct 47 ms 11088 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1756 KB Output is correct
2 Correct 3 ms 1364 KB Output is correct
3 Correct 3 ms 1116 KB Output is correct
4 Correct 2 ms 1164 KB Output is correct
5 Correct 2 ms 1112 KB Output is correct
6 Correct 3 ms 1108 KB Output is correct
7 Correct 3 ms 1368 KB Output is correct
8 Correct 3 ms 1372 KB Output is correct
9 Correct 3 ms 1368 KB Output is correct
10 Correct 3 ms 2136 KB Output is correct

Subtask #5
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 10876 KB Output is correct - 120000 bits used
2 Correct 49 ms 10800 KB Output is correct - 122000 bits used
3 Correct 47 ms 10880 KB Output is correct - 125000 bits used
4 Correct 48 ms 10880 KB Output is correct - 125000 bits used
5 Correct 44 ms 11044 KB Output is correct - 125000 bits used
6 Correct 44 ms 10884 KB Output is correct - 125000 bits used
7 Correct 46 ms 11108 KB Output is correct - 124828 bits used
8 Correct 45 ms 10892 KB Output is correct - 124910 bits used
9 Correct 45 ms 10856 KB Output is correct - 125000 bits used
10 Correct 43 ms 10048 KB Output is correct - 125000 bits used