oj.uz

답안 #1095641

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1095641 2024-10-02T18:49:19 Z ThylOne 도서관 (JOI18_library) C++14
0 / 100
 2000 ms 432 KB 
#include<bits/stdc++.h>
#include <cstdio>
#include <vector>
#include "library.h"
using namespace std;


void Solve(int N)
{
	int 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)==((int)chaine.size()+1)){
					chaine.push_back(i);
					tot++;
					in[i] = true;
				}else{
					q[i] = 0;
				}
			}
		}
		chaines.push_back(chaine);
	}
	vector<int> ans;
	ans.push_back(border);
	vector<int> asking(n);
	fill(asking.begin(),asking.end(),0);
	asking[border] = 1;
	if(chaines.size()<2){
		while(true);
	}
	for(int i = 1; i < n ; i ++){
		for(int c = 0; c < (int)chaines.size(); c++){
			if(chaines[c].size()==0)continue;
			int low = 0;
			int high = chaines[c].size();
			while(low<high){
				int mid = (low+high)/2;
				for(int i = low ; i <= mid ; i++)
					asking[chaines[c][i]] = 1;
				int Q = Query(asking);
				for(int i = low ; i <= mid ; i++)
					asking[chaines[c][i]] = 0;
				if(Q==(mid-low+1)){
					high = mid;
				}else{
					low = mid + 1;
				}
			}
			if(low != (int)(chaines[c].size())){
				//finded !
				int nxt = chaines[c][low];
				chaines[c].erase(chaines[c].begin()+low);
				ans.push_back(nxt);
				asking[nxt] = 1;
				break;
			}
			
		}
	}

	for(int i = 0;i<n;i++)ans[i]++;
	
	Answer(ans);
}

Subtask #1
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 344 KB # of queries: 1859
2 Correct 23 ms 344 KB # of queries: 1891
3 Correct 21 ms 344 KB # of queries: 2165
4 Correct 20 ms 344 KB # of queries: 2102
5 Correct 15 ms 344 KB # of queries: 1946
6 Correct 20 ms 344 KB # of queries: 2041
7 Correct 15 ms 344 KB # of queries: 2079
8 Correct 22 ms 344 KB # of queries: 1951
9 Correct 19 ms 344 KB # of queries: 1981
10 Correct 11 ms 432 KB # of queries: 1180
11 Execution timed out 3042 ms 344 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #2
0 / 81.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 344 KB # of queries: 1859
2 Correct 23 ms 344 KB # of queries: 1891
3 Correct 21 ms 344 KB # of queries: 2165
4 Correct 20 ms 344 KB # of queries: 2102
5 Correct 15 ms 344 KB # of queries: 1946
6 Correct 20 ms 344 KB # of queries: 2041
7 Correct 15 ms 344 KB # of queries: 2079
8 Correct 22 ms 344 KB # of queries: 1951
9 Correct 19 ms 344 KB # of queries: 1981
10 Correct 11 ms 432 KB # of queries: 1180
11 Execution timed out 3042 ms 344 KB Time limit exceeded
12 Halted 0 ms 0 KB -