Submission #1333228

#TimeUsernameProblemLanguageResultExecution timeMemory
1333228nguyenLibrary (JOI18_library)C++20
0 / 100
93 ms416 KiB
#include <cstdio>
#include <vector>
#include "library.h"
using namespace std;

void Solve(int N)
{
	vector<int> res(N, -1);
	int start = 0, prev = -1;
	for(int i = 0; i < N; i++) {
		vector<int> M(N, 0);
		M[i] = 1;
		int cnt = 0;
		for(int j = 0; j < N; j++)
		{
			if(i == j) continue;
			M[j] = 1;
			if(Query(M) == 1) cnt++;
			M[j] = 0;
		}
		if(cnt == 1) 
		{
			start = i;
			break;
		}
	}
	
	for(int i = 0; i < N; i++)
	{
		res[i] = start+1;
		vector<int> M(N, 0);
		M[start] = 1;
		for(int j = 0; j < N; j++)
		{
			if(j == prev || j == start) 
			{
				continue;
			}
			M[j] = 1;
			if(Query(M) == 1) 
			{
				prev = start;
				start = j;
				M[j] = 0;
				break;
			}
			M[j] = 0;
		}
	}
	Answer(res);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...