# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
349631 | amunduzbaev | 최후의 만찬 (IOI12_supper) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#ifndef EVAL
#include "grader.cpp"
#endif
#include "assistant.h"
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vll vector<ll>
#define vii vector<int>
#define vpii vector<pii>
#define vpll vector<pll>
#define cnt(a)__builtin_popcount(a)
template<class T> bool umin(T& a, const T& b) {return a > b? a = b, true:false;}
template<class T> bool umax(T& a, const T& b) {return a < b? a = b, true:false;}
const int NN = 1e6+5;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);
int a[NN], used[NN], fir[NN];
void ComputeAdvice(int *c, int n, int k, int m){
memset(used, mod, sizeof used);
for(int i=n-1;i>=0;i--){
a[i] = used[c[i]];
if(used[c[i]] == mod) fir[c[i]] = i;
used[c[i]] = i;
}
set<pii> ss;
for(int i=0;i<k;i++){
ss.insert({fir[i], i});
}
for(int i=0;i<n;i++){
auto tmp = ss.find({i, c[i]});
if(tmp != ss.end()) { WriteAdvice(1); continue; }
else WriteAdvice(0);
auto cur = --ss.end();
ss.erase(cur);
int l = 0, r = k-1;
int need = (*cur).ss, cnt = 0;
while(l < r){
cnt++;
int m = (l + r +1)>>1;
if(m >= need) { WriteAdvice(0); l = m; }
else { WriteAdvice(1); r = m-1; }
}
ss.insert({a[i], need});
}
}