oj.uz

Submission #132894

# Submission time Handle Problem Language Result Execution time Memory
132894 2019-07-19T22:52:51 Z arthurconmy Last supper (IOI12_supper) C++14
0 / 100
 307 ms 12432 KB 
#include <bits/stdc++.h>

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

using namespace std;

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);
		}
	}
}

// int main()
// {
// 	#ifdef ARTHUR_LOCAL
// 		ifstream cin("input.txt");
// 	#endif


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

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

using namespace std;

const int INF = 1000000000;

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;
	}

	int ans=0;

	for(int i=0; i<n; i++)
	{
		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]});
		}
	}
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 632 KB Error - Putting back a color when it is already on the scaffold
2 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 33 ms 1836 KB Error - Putting back a color when it is already on the scaffold
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 250 ms 10052 KB Error - GetRequest() must be called N times
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 768 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 305 ms 12272 KB Error - GetRequest() must be called N times
2 Incorrect 306 ms 12268 KB Error - GetRequest() must be called N times
3 Incorrect 304 ms 12180 KB Error - GetRequest() must be called N times
4 Incorrect 307 ms 12380 KB Error - GetRequest() must be called N times
5 Incorrect 303 ms 12232 KB Error - GetRequest() must be called N times
6 Incorrect 303 ms 12424 KB Error - GetRequest() must be called N times
7 Incorrect 305 ms 12236 KB Error - GetRequest() must be called N times
8 Incorrect 303 ms 12316 KB Error - GetRequest() must be called N times
9 Incorrect 303 ms 12432 KB Error - GetRequest() must be called N times
10 Incorrect 306 ms 12280 KB Error - GetRequest() must be called N times