oj.uz

Submission #1095624

# Submission time Handle Problem Language Result Execution time Memory
1095624 2024-10-02T18:06:55 Z ThylOne Library (JOI18_library) C++14
0 / 100
 2000 ms 344 KB 
#include <cstdio>
#include <vector>
#include "library.h"
using namespace std;
int n;
int ask(vector<int> v){
	vector<int> r(n);
	fill(r.begin(),r.end(),0);
	for(int i:v)
		r[i] = 1;
	return Query(v);
}
void Solve(int N)
{
	n=N;
	vector<int> M(N);

	for(int i = 0; i < N; i++) {
		M[i] = 1;
	}
	int border = -1;
	for(int i = 0; i < n ; i++){
		M[i] = 0;
		int r = Query(M);
		if(r==1){
			//border
			border = i;
			break;
		}
		M[i] = 1;
	}
	bool in[n];
	fill(in,in+n,false);
	in[border] = true;
	vector<vector<int>> chaines;
	int tot = 1;
	while(tot<N){
		vector<int> chaine;
		vector<int> q(n);
		fill(q.begin(),q.end(),0);
		for(int i = 0;i<n;i++){
			if(!in[i]){
				q[i] = 1;
				if(Query(q)==1){
					chaine.push_back(i);
					tot++;
					in[i] = true;
				}else{
					q[i] = 0;
				}
			}
		}
		chaines.push_back(chaine);
	}
	if(chaines.size()>3){
		while(true);
	}	
}

Subtask #1
0 / 19.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3084 ms 344 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 81.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3084 ms 344 KB Time limit exceeded
2 Halted 0 ms 0 KB -