Submission #349633

# Submission time Handle Problem Language Result Execution time Memory
349633 2021-01-18T05:03:51 Z amunduzbaev Last supper (IOI12_supper) C++14
0 / 100
378 ms 18840 KB
#include <bits/stdc++.h>

#ifndef EVAL
#include "grader.cpp"
#endif
#include "advisor.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});
	}
}
#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 used;
void Assist(unsigned char *a, int n, int k, int r) {
	int last = 0;
	for(int i=0;i<n;i++){
		GetRequest();
		if(a[last]) continue;
		int l = 0, r = k-1;
		while(l < r){
			int m = (l + r +1)>>1;
			if(a[last]) r = m-1;
			else l = m;
			last++;
		}
		PutBack(l);
		//last = (i+1)*log2(k);
	}
}
# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 4728 KB Error - Putting back a color when it is already on the scaffold
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 30 ms 5680 KB Error - Not putting back color when it is not on the scaffold
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 293 ms 15848 KB Error - Not putting back color when it is not on the scaffold
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 4940 KB Error - advice is too long
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 365 ms 18240 KB Error - Not putting back color when it is not on the scaffold
2 Incorrect 362 ms 18444 KB Error - Not putting back color when it is not on the scaffold
3 Incorrect 368 ms 18840 KB Error - Not putting back color when it is not on the scaffold
4 Incorrect 371 ms 18368 KB Error - Not putting back color when it is not on the scaffold
5 Incorrect 361 ms 18712 KB Error - Not putting back color when it is not on the scaffold
6 Incorrect 366 ms 18584 KB Error - Not putting back color when it is not on the scaffold
7 Incorrect 359 ms 18388 KB Error - Not putting back color when it is not on the scaffold
8 Incorrect 378 ms 18624 KB Error - Not putting back color when it is not on the scaffold
9 Incorrect 360 ms 18752 KB Error - Not putting back color when it is not on the scaffold
10 Incorrect 365 ms 18592 KB Error - Not putting back color when it is not on the scaffold