oj.uz

답안 #225281

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
225281 2020-04-20T07:28:57 Z kshitij_sodani 도서관 (JOI18_library) C++17
0 / 100
 537 ms 636 KB 
#include <iostream>
#include <bits/stdc++.h>
#include "library.h"
using namespace std;

#define pb push_back
typedef long long llo;
#define a first
#define b second
int n;
vector<int> aa;
vector<int> bb;
/*void Answer(vector<int> cc){
	for(auto j:cc){
		cout<<j<<" ";
	}
	cout<<endl;
}
int Query(vector<int> cc){
	for(auto j:cc){
		cout<<j<<" ";
	}
	cout<<endl;
	int xx;
	cin>>xx;
	return xx;
}*/
int ll;
void solve(int ind,int l,int r){
	//cout<<l<<" "<<r<<endl;
	if(l==r){
		if(l==n-1 and aa[n-1]==0){
			ll=-1;
		}
		else{
			ll=l;
		}
	/*	for(int i=0;i<n;i++){
			if((ind==i or i==l)){

				bb[i]=1;
			}
			else{
				bb[i]=0;
			}
		}
		int yy=Query(bb);
		if(yy==1){
			//ll=l;
			ll=l;
		}
		else{
			ll=-1;
		//	return -1;
		}*/
	}
	else{
		int mid=(l+r)/2;
		int co=0;
		for(int i=0;i<n;i++){
			bb[i]=0;
		}
		for(int i=l;i<=mid;i++){
			if(aa[i]==2 and i!=ind){
				bb[i]=1;
				co+=1;
			}
		}
		if(co==0){
			solve(ind,mid+1,r);
		}
		else{
			bb[ind]=1;
			int yy=Query(bb);
			bb[ind]=0;
			int zz=Query(bb);
			if(yy==zz){
				solve(ind,l,mid);
			}
			else{
				solve(ind,mid+1,r);
			}
		}

	}
}
void Solve(int nn){
	n=nn;
	for(int i=0;i<n;i++){
		aa.pb(2);
		bb.pb(0);
	}
	int x=0;
	deque<int> ans;
	ans.push_back(0);
	int st=0;
	int kk=0;
	for(int i=0;i<n;i++){
		int y=x;
		if(i==n-1 and st==0){
			break;
		}
		ll=-2;
		solve(x,0,n-1);
		if(ll==-2){
			while(true){
				continue;
			}
		}
		x=ll;
		if(x==-1){
			x=0;
			st=1;
			kk+=1;
		}
		else{
			if(st==0){
				ans.push_back(x);
			}
			else{
				ans.push_front(x);
			}
		}
		aa[y]=0;
	}
	/*if(kk>1){
		while(true){
			continue;
		}
	}*/
	vector<int> fin;
	for(int i=0;i<n;i++){
		int x=ans.front();
		ans.pop_front();
		fin.pb(x+1);
	}
	Answer(fin);
}
/*int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	Solve(4);


	return 0;
}*/

Subtask #1
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 60 ms 256 KB # of queries: 2748
2 Incorrect 53 ms 256 KB Wrong Answer [5]
3 Incorrect 50 ms 256 KB Wrong Answer [8]
4 Incorrect 56 ms 384 KB Wrong Answer [8]
5 Incorrect 47 ms 256 KB Wrong Answer [8]
6 Incorrect 55 ms 256 KB Wrong Answer [5]
7 Correct 53 ms 384 KB # of queries: 2826
8 Correct 64 ms 256 KB # of queries: 2744
9 Incorrect 50 ms 384 KB Wrong Answer [5]
10 Incorrect 31 ms 256 KB Wrong Answer [5]
11 Correct 4 ms 256 KB # of queries: 0
12 Correct 4 ms 256 KB # of queries: 0
13 Incorrect 5 ms 384 KB Wrong Answer [8]
14 Correct 5 ms 256 KB # of queries: 6
15 Correct 6 ms 384 KB # of queries: 90
16 Correct 7 ms 384 KB # of queries: 226

Subtask #2
0 / 81.0

# 결과 실행 시간 메모리 Grader output
1 Correct 60 ms 256 KB # of queries: 2748
2 Incorrect 53 ms 256 KB Wrong Answer [5]
3 Incorrect 50 ms 256 KB Wrong Answer [8]
4 Incorrect 56 ms 384 KB Wrong Answer [8]
5 Incorrect 47 ms 256 KB Wrong Answer [8]
6 Incorrect 55 ms 256 KB Wrong Answer [5]
7 Correct 53 ms 384 KB # of queries: 2826
8 Correct 64 ms 256 KB # of queries: 2744
9 Incorrect 50 ms 384 KB Wrong Answer [5]
10 Incorrect 31 ms 256 KB Wrong Answer [5]
11 Correct 4 ms 256 KB # of queries: 0
12 Correct 4 ms 256 KB # of queries: 0
13 Incorrect 5 ms 384 KB Wrong Answer [8]
14 Correct 5 ms 256 KB # of queries: 6
15 Correct 6 ms 384 KB # of queries: 90
16 Correct 7 ms 384 KB # of queries: 226
17 Runtime error 447 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
18 Incorrect 535 ms 504 KB Wrong Answer [8]
19 Correct 535 ms 376 KB # of queries: 18764
20 Correct 453 ms 504 KB # of queries: 17632
21 Incorrect 399 ms 384 KB Wrong Answer [6]
22 Runtime error 503 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
23 Correct 505 ms 384 KB # of queries: 18750
24 Runtime error 167 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
25 Runtime error 537 ms 636 KB Execution killed with signal 11 (could be triggered by violating memory limits)
26 Runtime error 468 ms 508 KB Execution killed with signal 11 (could be triggered by violating memory limits)
27 Correct 254 ms 384 KB # of queries: 8554
28 Correct 284 ms 416 KB # of queries: 10068
29 Correct 248 ms 480 KB # of queries: 10062
30 Correct 249 ms 384 KB # of queries: 10068