oj.uz

답안 #912859

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
912859 2024-01-20T03:10:03 Z Faisal_Saqib 최후의 만찬 (IOI12_supper) C++17
0 / 100
 270 ms 18364 KB 
#pragma once
#include "advisor.h"
#include <vector>
#include <cmath>
#include <map>
#include <set>
using namespace std;
/*
1	8	N≤5000 M=65000bits
2	9	N≤100000 M=2000000bits
3	9	N≤100000 M=1500bits K≤25000
4	35	N≤5000 M=10000bits
5	up to 39	N≤100000 M=1800000bits K≤25000

*/
void ComputeAdvice(int *c, int n, int k, int m)
{
	// cout<<"ASD\n";
	vector<int> pos[n];
	for(int j=0;j<n;j++)
		pos[j].push_back(1e9);
	for(int i=n-1;i>=0;i--)
		pos[c[i]].push_back(i);
	set<pair<int,int>> hap;
	map<int,int> color_to_index;
	for(int i=0;i<k;i++)
	{
		// cout<<"Hola "<<-pos[i].back()<<' '<<i<<endl;
		hap.insert({-pos[i].back(),i});
		color_to_index[i]=i;
	}
	int lg=log2(k);	
	for(int j=0;j<n;j++)
	{
		pos[c[j]].pop_back();
		if(color_to_index.find(c[j])==color_to_index.end())
		{
			auto it=*begin(hap);
			hap.erase(begin(hap));
			int npd=color_to_index[it.second];
			// cout<<"Rem "<<-it.first<<' '<<it.second<<" ind ";
			// cout<<npd<<endl;
			for(int l=lg;l>=0;l--)
			{
				if(npd&(1ll<<l))
				{
					WriteAdvice(1);	
				}
				else
				{
					WriteAdvice(0);
				}
			}
			color_to_index.erase(it.second);
			// cout<<"Adding "<<pos[c[j]].back()<<' '<<c[j]<<' '<<npd<<endl;
			hap.insert({-pos[c[j]].back(),c[j]});
			color_to_index[c[j]]=npd;
		}
	}	
}

#pragma once
#include "assistant.h"
#include <vector>
#include <cmath>
#include <map>
#include <set>
using namespace std;
void Assist(unsigned char *a, int n, int k, int r)
{
	vector<int> ans;
	set<int> hap;
	for(int i=0;i<k;i++)
	{
		hap.insert(i);
		ans.push_back(i);
	}
	int lg=log2(k);
	int p=0;
	for(int j=0;j<n;j++)
	{
		int x=GetRequest();
		if(hap.find(x)!=hap.end())
			continue;
		int ind=0;
		for(int l=lg;l>=0;l--)
		{
			ind*=2;
			ind+=(a[p]);
			p++;
		}
		PutBack(ans[ind]);
		hap.erase(ans[ind]);
		hap.insert(x);
		ans[ind]=x;
	}
}

Compilation message

advisor.cpp:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~

assistant.cpp:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 780 KB Output is correct
2 Incorrect 0 ms 792 KB Output isn't correct - not an optimal way
3 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 19 ms 2520 KB Output isn't correct - not an optimal way
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 196 ms 14012 KB Output isn't correct - not an optimal way
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 1036 KB Error - advice is too long
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 254 ms 17276 KB Output isn't correct - not an optimal way
2 Incorrect 251 ms 17208 KB Output isn't correct - not an optimal way
3 Incorrect 248 ms 17072 KB Output isn't correct - not an optimal way
4 Incorrect 237 ms 17104 KB Output isn't correct - not an optimal way
5 Incorrect 249 ms 17152 KB Output isn't correct - not an optimal way
6 Incorrect 270 ms 17148 KB Output isn't correct - not an optimal way
7 Incorrect 253 ms 17376 KB Output isn't correct - not an optimal way
8 Incorrect 240 ms 17156 KB Output isn't correct - not an optimal way
9 Incorrect 239 ms 17320 KB Output isn't correct - not an optimal way
10 Correct 257 ms 18364 KB Output is partially correct - 1117620 bits used