oj.uz

답안 #132906

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
132906 2019-07-19T23:13:28 Z arthurconmy 최후의 만찬 (IOI12_supper) C++14
0 / 100
 315 ms 12448 KB 
#include <bits/stdc++.h>

#ifndef ARTHUR_LOCAL
	#include "advisor.h"
#endif

using namespace std;

#ifdef ARTHUR_LOCAL
	void WriteAdvice(int n)
	{
		cout << n << endl;
	}
#endif

void ComputeAdvice(int *C, int n, int k, int m)
{
	for(int i=0; i<n; i++)
	{
		for(int b=0; b<13; b++)
		{
			if(1<<b & C[i]) WriteAdvice(1);
			else WriteAdvice(0);
		}
	}
}

#ifdef ARTHUR_LOCAL

	int main()
	{
		int C[4];
		vector<int> to_c = {2,0,3,0};

		for(int i=0; i<4; i++) C[i]=to_c[i];

		ComputeAdvice(C,4,2,100);
	}

#endif
#include <bits/stdc++.h>

#ifndef ARTHUR_LOCAL
	#include "assistant.h"
#endif

using namespace std;

const int INF = 1000000000;

#ifdef ARTHUR_LOCAL

	void PutBack(int n)
	{
		cout << n << endl;
	}

	int GetRequest()
	{
		return 69;
	}

#endif

void Assist(unsigned char *A, int n, int k, int r)
{
	vector<int> C;

	for(int i=0; i<n; i++)
	{
		int cur=0;

		for(int b=0; b<13; b++)
		{
			if(A[i*13 + b]==1) cur += 1<<b;
		}

		C.push_back(cur);
	}

	// now we actually have to use the optimal strat ...

	vector<bool> on_scaff(n+1);

	for(int i=0; i<k; i++) on_scaff[i]=1;

	priority_queue<pair<int,int>> scaff;

	vector<int> next_col_occ(n+1,INF);
	vector<int> next_occ(n+1,INF);

	for(int i=n-1; i>=0; i--)
	{
		// if(i<k) scaff.push({next_col_occ[C[i]],C[i]});
		next_occ[i]=next_col_occ[C[i]];
		next_col_occ[C[i]]=i;
	}

	for(int i=0; i<k; i++) scaff.push({next_col_occ[i],i});

	int ans=0;

	for(int i=0; i<n; i++)
	{
		int do_nothing = GetRequest();

		if(on_scaff[C[i]]) continue;

		else
		{			
			ans++;

			PutBack(scaff.top().second);
			on_scaff[scaff.top().second]=0;
			scaff.pop();
		
			on_scaff[C[i]]=1;
			scaff.push({next_occ[i],C[i]});
		}
	}
}

#ifdef ARTHUR_LOCAL

	int main()
	{
		unsigned char A[52];
		A[1]='1';
		A[26]='1';
		A[27]='1';

		Assist(A,4,2,52);
	}

#endif

Compilation message

assistant.cpp: In function 'void Assist(unsigned char*, int, int, int)':
assistant.cpp:65:7: warning: unused variable 'do_nothing' [-Wunused-variable]
   int do_nothing = GetRequest();
       ^~~~~~~~~~

Subtask #1
0 / 8.0

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

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 33 ms 1700 KB Error - Not putting back color when it is not on the scaffold
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 250 ms 10108 KB Error - Not putting back color when it is not on the scaffold
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

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

Subtask #5
0.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 307 ms 12448 KB Error - Not putting back color when it is not on the scaffold
2 Incorrect 305 ms 12132 KB Error - Not putting back color when it is not on the scaffold
3 Incorrect 306 ms 12416 KB Error - Not putting back color when it is not on the scaffold
4 Incorrect 305 ms 12132 KB Error - Not putting back color when it is not on the scaffold
5 Incorrect 305 ms 12280 KB Error - Not putting back color when it is not on the scaffold
6 Incorrect 306 ms 12308 KB Error - Not putting back color when it is not on the scaffold
7 Incorrect 305 ms 12116 KB Error - Not putting back color when it is not on the scaffold
8 Incorrect 304 ms 12200 KB Error - Not putting back color when it is not on the scaffold
9 Incorrect 315 ms 12296 KB Error - Not putting back color when it is not on the scaffold
10 Incorrect 305 ms 12140 KB Error - Not putting back color when it is not on the scaffold