oj.uz

답안 #363037

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
363037 2021-02-05T03:21:04 Z fhvirus 최후의 만찬 (IOI12_supper) C++14
0 / 100
 102 ms 69612 KB 
//Knapsack DP is harder than FFT.
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define ff first
#define ss second
#define pb emplace_back
#define FOR(i,n) for(int i = 0; i < (n); ++i)
#define FOO(i,a,b) for(int i = (a); i <= (b); ++i)
#define AI(x) (x).begin(),(x).end()
template<typename I> bool chmax(I &a, I b){ return a < b ? (a = b, true) : false;}
template<typename I> bool chmin(I &a, I b){ return a > b ? (a = b, true) : false;}
#ifdef OWO
#define debug(args...) LKJ("[ " + string(#args) + " ]", args)
void LKJ(){ cerr << endl;}
template<typename I, typename...T> void LKJ(I&&x, T&&...t){ cerr<<x<<", ", LKJ(t...);}
template<typename I> void DE(I a, I b){ while(a < b) cerr << *a << " \n"[next(a) == b], ++a;}
#else
#define debug(...) 0
#define DE(...) 0
#endif
#ifdef OWO
void ComputeAdvice(int *C, int N, int K, int M); void WriteAdvice(unsigned char a);
int32_t main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int n, m, k;
	cin >> n >> k >> m;
	int *c = new int[n];
	for(int i = 0; i < n; ++i) cin >> c[i];
	ComputeAdvice(c, n, k, m);
	return 0;
}
void WriteAdvice(unsigned char a){
	putchar(a);
	putchar(' ');
}
#else
#include "advisor.h"
#endif
const int maxn = 1e5 + 225;
queue<int> app[maxn];
struct BIT{
	int val[maxn];
	void modify(int p, int v){
		++p;
		for(; p <= maxn; p += p & -p) val[p] += v;
	}
	void insert(int p){ modify(p, 1);}
	void erase(int p){ modify(p, -1);}
	int query(int p){
		++p;
		int ans = 0;
		for(; p > 0; p -= p & -p) ans += val[p];
		return ans;
	}
	int count(int p){
		return query(p) - query(p - 1);
	}
	int find(int p){
		return query(p);
	}
} scaff;
void ComputeAdvice(int *C, int N, int K, int M){
	int L = __lg(K - 1);
	//debug(L);
	for(int i = 0; i < K; ++i) scaff.insert(i);
	
	for(int i = 0; i < N; ++i) app[C[i]].emplace(i);
	for(int i = 0; i < N; ++i) app[i].emplace(8e7);

	priority_queue<pii> pq;
	for(int i = 0; i < K; ++i) pq.emplace(app[i].front(), i);

	for(int i = 0; i < N; ++i){
		int c = C[i]; app[c].pop();
		if(scaff.count(c) != 0){
			WriteAdvice('0');
			continue;
		}
		{
			WriteAdvice('1');
			int jizz, eek;
			do{
				auto p = pq.top(); pq.pop();
				eek = p.ss;
			} while(scaff.count(eek) == 0);

			int it = scaff.find(eek) - 1;
			//debug(c, eek, it);

			for(int i = L; i >= 0; --i){
				WriteAdvice(((it >> i) & 1) ? '1' : '0');
			} 
			putchar('\n');

			scaff.erase(eek);
			scaff.insert(c);
			pq.emplace(app[c].front(), c);
		}
	}
}


//Knapsack DP is harder than FFT.
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define ff first
#define ss second
#define pb emplace_back
#define FOR(i,n) for(int i = 0; i < (n); ++i)
#define FOO(i,a,b) for(int i = (a); i <= (b); ++i)
#define AI(x) (x).begin(),(x).end()
template<typename I> bool chmax(I &a, I b){ return a < b ? (a = b, true) : false;}
template<typename I> bool chmin(I &a, I b){ return a > b ? (a = b, true) : false;}
#ifdef OWO
#define debug(args...) LKJ("[ " + string(#args) + " ]", args)
void LKJ(){ cerr << endl;}
template<typename I, typename...T> void LKJ(I&&x, T&&...t){ cerr<<x<<", ", LKJ(t...);}
template<typename I> void DE(I a, I b){ while(a < b) cerr << *a << " \n"[next(a) == b], ++a;}
#else
#define debug(...) 0
#define DE(...) 0
#endif
#ifdef OWO
void Assist(unsigned char *A, int N, int K, int R); void PutBack(int T);
int GetRequest();
int32_t main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int n, k, r; cin >> n >> k >> r;
	unsigned char * a = new unsigned char[r];
	for(int i = 0; i < r; ++i) cin >> a[i];
	Assist(a, n, k, r);
	return 0;
}
int GetRequest(){
	const int a[4] = {2, 0, 3, 0};
	static int p = 0;
	return a[p++];
}
void PutBack(int T){
	cout << T << ' ';
}
#else
#include "assistant.h"
#endif
const int maxn = 1e5 + 225;
struct BIT{
	int val[maxn];
	void modify(int p, int v){
		++p;
		for(; p <= maxn; p += p & -p) val[p] += v;
	}
	void insert(int p){ modify(p, 1);}
	void erase(int p){ modify(p, -1);}
	int query(int p){
		++p;
		int ans = 0;
		for(; p > 0; p -= p & -p) ans += val[p];
		return ans;
	}
	int count(int p){
		return query(p) - query(p - 1);
	}
	int find(int p){
		return query(p);
	}
	int findk(int k){
		++k;
		int l = 1, r = maxn - 1, m;
		while(l < r){
			m = (l + r) / 2;
			//debug(l, r, m, query(m));
			if(query(m) >= k) r = m - 1;
			else l = m + 1;
		}
		return l;
	}
} scaff;
void Assist(unsigned char *A, int N, int K, int R){
	int L = __lg(K - 1);
	auto GC = [&](){
		static int p = 0;
		return A[p++];
	};

	for(int i = 0; i < K; ++i) scaff.insert(i);
	for(int i = 0; i < N; ++i){
		int c = GetRequest();
		unsigned char cmd = GC();
		if(cmd == '0') continue;
		int ans = 0;
		for(int i = 0; i <= L; ++i){
			ans = (ans << 1) | (GC() == '1' ? 1 : 0);
		}
		//debug(ans);
		int d = scaff.findk(ans);
		PutBack(d);
		scaff.erase(d);
		scaff.insert(c);
	} 
}

Compilation message

advisor.cpp: In function 'void ComputeAdvice(int*, int, int, int)':
advisor.cpp:83:8: warning: unused variable 'jizz' [-Wunused-variable]
   83 |    int jizz, eek;
      |        ^~~~

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 54 ms 68324 KB Error - advice must be 0 or 1
2 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 63 ms 68568 KB Error - advice must be 0 or 1
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 80 ms 69140 KB Error - advice must be 0 or 1
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 63 ms 68316 KB Error - advice must be 0 or 1
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 76 ms 69296 KB Error - advice must be 0 or 1
2 Incorrect 91 ms 69308 KB Error - advice must be 0 or 1
3 Incorrect 79 ms 69252 KB Error - advice must be 0 or 1
4 Incorrect 82 ms 69220 KB Error - advice must be 0 or 1
5 Incorrect 83 ms 69092 KB Error - advice must be 0 or 1
6 Incorrect 102 ms 69220 KB Error - advice must be 0 or 1
7 Incorrect 82 ms 69496 KB Error - advice must be 0 or 1
8 Incorrect 82 ms 69508 KB Error - advice must be 0 or 1
9 Incorrect 81 ms 69612 KB Error - advice must be 0 or 1
10 Incorrect 83 ms 69476 KB Error - advice must be 0 or 1