oj.uz

답안 #1012051

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1012051 2024-07-01T15:07:49 Z AmirAli_H1 최후의 만찬 (IOI12_supper) C++17
100 / 100
 83 ms 11072 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 set<pii> st;

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;
	}
	
	st.clear();
	fill(M, M + n, -1); fill(res, res + n, 1);
	for (int i = 0; i < k; i++) {
		st.insert(Mp(val[i], i));
		M[A[i]] = i;
	}
	for (int i = k; i < n; i++) {
		int j = M[A[i]];
		if (j != -1) {
			st.erase(Mp(val[j], j));
			st.insert(Mp(val[i], i));
			M[A[i]] = i;
		}
		else {
			auto f = *st.rbegin();
			int r = f.S; st.erase(f);
			res[r] = 0; M[A[r]] = -1;
			st.insert(Mp(val[i], i));
			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 set<pii> st;

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;
	
	st.clear();
	fill(M, M + n, -1);
	for (int i = 0; i < k; i++) {
		st.insert(Mp(res[i], i));
		A[i] = i; M[A[i]] = i;
	}
	
	for (int i = k; i < n; i++) {
		A[i] = GetRequest();
		if (M[A[i]] != -1) {
			int j = M[A[i]];
			auto f = Mp(res[j], j); st.erase(f);
			M[A[i]] = -1;
		}
		else {
			auto f = *st.begin();
			int j = f.S; st.erase(f);
			M[A[j]] = -1; PutBack(A[j]);
		}
		st.insert(Mp(res[i], i));
		M[A[i]] = i;
	}
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2844 KB Output is correct
2 Correct 1 ms 2832 KB Output is correct
3 Correct 1 ms 2840 KB Output is correct
4 Correct 2 ms 2852 KB Output is correct
5 Correct 2 ms 2876 KB Output is correct
6 Correct 3 ms 2868 KB Output is correct
7 Correct 3 ms 3128 KB Output is correct
8 Correct 3 ms 3124 KB Output is correct
9 Correct 4 ms 3132 KB Output is correct
10 Correct 4 ms 3364 KB Output is correct
11 Correct 3 ms 3140 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 3424 KB Output is correct
2 Correct 30 ms 5788 KB Output is correct
3 Correct 66 ms 11072 KB Output is correct
4 Correct 43 ms 7156 KB Output is correct
5 Correct 46 ms 7216 KB Output is correct
6 Correct 56 ms 7692 KB Output is correct
7 Correct 66 ms 9256 KB Output is correct
8 Correct 53 ms 9452 KB Output is correct
9 Correct 35 ms 7204 KB Output is correct
10 Correct 78 ms 10380 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 62 ms 8500 KB Output is correct
2 Correct 78 ms 9776 KB Output is correct
3 Correct 81 ms 9972 KB Output is correct
4 Correct 78 ms 9888 KB Output is correct
5 Correct 78 ms 9316 KB Output is correct
6 Correct 83 ms 9944 KB Output is correct
7 Correct 78 ms 9968 KB Output is correct
8 Correct 59 ms 10080 KB Output is correct
9 Correct 61 ms 9948 KB Output is correct
10 Correct 73 ms 9976 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 3120 KB Output is correct
2 Correct 3 ms 3124 KB Output is correct
3 Correct 2 ms 2876 KB Output is correct
4 Correct 3 ms 2868 KB Output is correct
5 Correct 3 ms 2872 KB Output is correct
6 Correct 3 ms 3116 KB Output is correct
7 Correct 3 ms 3132 KB Output is correct
8 Correct 3 ms 3128 KB Output is correct
9 Correct 4 ms 3132 KB Output is correct
10 Correct 5 ms 3388 KB Output is correct

Subtask #5
39.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 77 ms 9380 KB Output is correct - 120000 bits used
2 Correct 81 ms 9620 KB Output is correct - 122000 bits used
3 Correct 81 ms 9996 KB Output is correct - 125000 bits used
4 Correct 79 ms 9980 KB Output is correct - 125000 bits used
5 Correct 80 ms 9980 KB Output is correct - 125000 bits used
6 Correct 78 ms 9980 KB Output is correct - 125000 bits used
7 Correct 74 ms 10240 KB Output is correct - 124828 bits used
8 Correct 74 ms 9968 KB Output is correct - 124910 bits used
9 Correct 77 ms 9972 KB Output is correct - 125000 bits used
10 Correct 65 ms 10092 KB Output is correct - 125000 bits used