oj.uz

Submission #241485

# Submission time Handle Problem Language Result Execution time Memory
241485 2020-06-24T08:59:22 Z kshitij_sodani Last supper (IOI12_supper) C++17
0 / 100
 376 ms 65776 KB 
#include <bits/stdc++.h>
using namespace std;
typedef int64_t llo;
#define mp make_pair
#define pb push_back
#define a first 
#define b second

#include "advisor.h"
vector<int> ind[1000001];
int cur[1000001];
/*void WriteAdvice(int x){
	cout<<x<<endl;
}*/
void ComputeAdvice(int c[], int n, int k, int m) {
	set<pair<int,int>> kk;
	for(int i=0;i<n;i++){
		ind[c[i]].pb(i);
	}
	for(int i=0;i<n;i++){
		ind[i].pb(n+1);
		cur[i]=-1;
	}
	for(int i=0;i<k;i++){
		cur[i]=i;
		kk.insert({ind[i][0],i});
	}
	for(int i=0;i<n;i++){
		if(cur[c[i]]>-1){
			kk.erase({i,c[i]});
			int j=upper_bound(ind[c[i]].begin(),ind[c[i]].end(),i)-ind[c[i]].begin();
			kk.insert({ind[c[i]][j],c[i]});
			continue;
		}
		auto j=kk.end();
		j--;

		cur[c[i]]=cur[(*j).b];
		cur[(*j).b]=-1;
		kk.erase(j);
		int jj=upper_bound(ind[c[i]].begin(),ind[c[i]].end(),i)-ind[c[i]].begin();
		kk.insert({ind[c[i]][jj],c[i]});
		for(int j=0;j<15;j++){
			if(((1<<j)&(cur[c[i]]))){
				WriteAdvice(1);
			}
			else{
				WriteAdvice(0);
			}
		}
	//	cout<<cur[c[i]]<<endl;
	}

 //	WriteAdvice(0);



}
/*int main(){
	int cc[4];
	cc[0]=2;
	cc[1]=0;
	cc[2]=3;
	cc[3]=0;

	ComputeAdvice(cc,4,2,1000);
	return 0;
}

*/
#include <bits/stdc++.h>
using namespace std;
typedef int64_t llo;
#define mp make_pair
#define pb push_back
#define a first 
#define b second

#include "assistant.h"
int arr[100001];
set<int> cur;
int ind=0;
unsigned char aa[2000001];
int rr;
int read(){
	int ans=0;
/*	if(ind>=rr){
		while(true){
			continue;
		}
	}*/
	for(int i=0;i<15;i++){
		if(aa[ind+i]=='1'){
			ans+=(1<<i);
		}
	}
	ind+=15;
	return ans;
}
/*int GetRequest(){
	int yy;
	cin>>yy;
	return yy;
}
void PutBack(int x){
	cout<<x<<endl;
}*/
void Assist(unsigned char A[], int n, int k, int ro) {
	rr=ro;

	for(int i=0;i<ro;i++){
		aa[i]=A[i];
	}
	cur.clear();
	for(int i=0;i<k;i++){
		arr[i]=i;
		cur.insert(i);

	}
	int st=0;
	for (int i = 0; i < n; i++) {
		int req = GetRequest();


		if (cur.find(req)==cur.end()){
			st=1;
			int r=read();
			if(r>=k){
				while(true){
					continue;
				}
			}
	/*		if(cur.find(arr[r])==cur.end()){
				while(true){
					continue;
				}
			}*/
		 	PutBack(arr[r]);
		 
		 	cur.erase(arr[r]);
		 	arr[r]=req;
		 	cur.insert(req);
		}
	}
	if(st==1 and ro==0){
		while(true){
			continue;
		}
	}

}

/*int main(){
	int cc[4];
	int nn;
	cin>>nn;
	unsigned char aa[nn];
	for(int i=0;i<nn;i++){
		cin>>aa[i];
	}

	Assist(aa,4,2,nn);
	return 0;
}

*/

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 23 ms 47616 KB Output isn't correct - not an optimal way
2 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 48 ms 49152 KB Output isn't correct - not an optimal way
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 263 ms 60536 KB Output isn't correct - not an optimal way
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 25 ms 48128 KB Error - advice is too long
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 39.0

# Verdict Execution time Memory Grader output
1 Incorrect 335 ms 63440 KB Output isn't correct - not an optimal way
2 Incorrect 314 ms 63216 KB Output isn't correct - not an optimal way
3 Incorrect 318 ms 63472 KB Output isn't correct - not an optimal way
4 Incorrect 330 ms 63352 KB Output isn't correct - not an optimal way
5 Incorrect 317 ms 63472 KB Output isn't correct - not an optimal way
6 Incorrect 348 ms 63216 KB Output isn't correct - not an optimal way
7 Incorrect 327 ms 63440 KB Output isn't correct - not an optimal way
8 Incorrect 320 ms 63480 KB Output isn't correct - not an optimal way
9 Incorrect 316 ms 63216 KB Output isn't correct - not an optimal way
10 Incorrect 376 ms 65776 KB Output isn't correct - not an optimal way