oj.uz

답안 #283364

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
283364 2020-08-25T15:11:45 Z ElyesChaabouni 최후의 만찬 (IOI12_supper) C++14
0 / 100
 437 ms 21848 KB 
#include "advisor.h"
//#pragma GCC optimize("O3")
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#define ordered_set tree<int, null_type,less<int >, rb_tree_tag,tree_order_statistics_node_update>
#define eps 1e-9
#define MOD1 998244353
#define MOD2 1000000007
#define INV_10 299473306
#define INF 1000000000
#define PI 3.14159265358979323846
using namespace std;
void ComputeAdvice(int *C, int N, int K, int M) {
	int nb=0;
	int cu=N;
	while(cu)
	{
		nb++;
		cu/=2;
	}
	//cout << nb << '\n';
	for(int i = 0; i < N; i++)
	{
		int x=C[i];
		for(int j = 0; j < nb; j++)
		{
			WriteAdvice((x%2));
			x/=2;
		}
	}
}
//size
#include "assistant.h"
//#pragma GCC optimize("O3")
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#define ordered_set tree<int, null_type,less<int >, rb_tree_tag,tree_order_statistics_node_update>
#define eps 1e-9
#define MOD1 998244353
#define MOD2 1000000007
#define INV_10 299473306
#define INF 1000000000
#define PI 3.14159265358979323846
using namespace std;
void Assist(unsigned char *A, int N, int K, int R) {
	int cu=N, nb=0;
	while(cu)
	{
		nb++;
		cu/=2;
	}
	//cout << "here\n";
	vector<int>v[N+1];
	int step=0;
	for(int i = 0; i+nb-1 < R; i+=nb)
	{
		int x=0, p=1;
		for(int j = 0; j < nb; j++)
		{
			if(A[i+j]=='1')
				x+=p;
			p*=2;
		}
		//cout << x << '\n';
		v[x].push_back(step);
		step++;
	}
	for(int i = 0; i < N; i++)
		v[i].push_back(1000000000);
    set<int>s;
    for(int i = 0; i < K; i++)
    	s.insert(i);
    priority_queue<pair<int, int> >pq;
    for(int i = 0; i < K; i++)
    	pq.push(make_pair(v[i][0], i));
    /*for(int i = 0; i < N; i++)
    {
    	int next_color=GetRequest();
    	if(!s.count(next_color))
    	{
    		while(!s.count(pq.top().second) && pq.top().first <= i)
    		{
    			pq.pop();
    		}
    		PutBack(pq.top().second);
    		s.erase(pq.top().second);
    		s.insert(next_color);
    	}
    	vector<int>::iterator it=upper_bound(v[next_color].begin(), v[next_color].end(), i);
    	pq.push(make_pair((*it), next_color));
    }*/
}
//size

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 776 KB Error - GetRequest() must be called N times
2 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 35 ms 2568 KB Error - GetRequest() must be called N times
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 339 ms 17652 KB Error - GetRequest() must be called N times
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

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

Subtask #5
0.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 419 ms 21692 KB Error - GetRequest() must be called N times
2 Incorrect 412 ms 21380 KB Error - GetRequest() must be called N times
3 Incorrect 419 ms 21848 KB Error - GetRequest() must be called N times
4 Incorrect 437 ms 21604 KB Error - GetRequest() must be called N times
5 Incorrect 431 ms 21680 KB Error - GetRequest() must be called N times
6 Incorrect 434 ms 21740 KB Error - GetRequest() must be called N times
7 Incorrect 420 ms 21604 KB Error - GetRequest() must be called N times
8 Incorrect 431 ms 21700 KB Error - GetRequest() must be called N times
9 Incorrect 418 ms 21716 KB Error - GetRequest() must be called N times
10 Incorrect 418 ms 21796 KB Error - GetRequest() must be called N times