oj.uz

답안 #225273

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
225273 2020-04-20T07:06:39 Z kshitij_sodani 도서관 (JOI18_library) C++17
0 / 100
 490 ms 632 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 solve(int ind,int l,int r){
	//cout<<l<<" "<<r<<endl;
	if(l==r){
		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){
			return l;
		}
		else{
			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;
	for(int i=0;i<n;i++){
		int y=x;
		if(i==n-1 and st==0){
			break;
		}
		x=solve(x,0,n-1);
		if(x==-1){
			x=0;
			st=1;
		}
		else{
			if(st==0){
				ans.push_back(x);
			}
			else{
				ans.push_front(x);
			}
		}
		aa[y]=0;
	}
	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;
}*/

Compilation message

library.cpp: In function 'int solve(int, int, int)':
library.cpp:75:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 45 ms 256 KB # of queries: 2940
2 Correct 47 ms 256 KB # of queries: 2901
3 Correct 37 ms 256 KB # of queries: 3084
4 Correct 51 ms 384 KB # of queries: 3038
5 Correct 47 ms 256 KB # of queries: 3062
6 Correct 49 ms 256 KB # of queries: 3074
7 Correct 47 ms 256 KB # of queries: 3026
8 Correct 56 ms 384 KB # of queries: 2937
9 Correct 48 ms 256 KB # of queries: 3079
10 Incorrect 28 ms 256 KB Wrong Answer [5]
11 Correct 4 ms 256 KB # of queries: 0
12 Correct 4 ms 256 KB # of queries: 1
13 Correct 4 ms 256 KB # of queries: 5
14 Correct 5 ms 256 KB # of queries: 9
15 Correct 6 ms 256 KB # of queries: 104
16 Correct 8 ms 256 KB # of queries: 253

Subtask #2
0 / 81.0

# 결과 실행 시간 메모리 Grader output
1 Correct 45 ms 256 KB # of queries: 2940
2 Correct 47 ms 256 KB # of queries: 2901
3 Correct 37 ms 256 KB # of queries: 3084
4 Correct 51 ms 384 KB # of queries: 3038
5 Correct 47 ms 256 KB # of queries: 3062
6 Correct 49 ms 256 KB # of queries: 3074
7 Correct 47 ms 256 KB # of queries: 3026
8 Correct 56 ms 384 KB # of queries: 2937
9 Correct 48 ms 256 KB # of queries: 3079
10 Incorrect 28 ms 256 KB Wrong Answer [5]
11 Correct 4 ms 256 KB # of queries: 0
12 Correct 4 ms 256 KB # of queries: 1
13 Correct 4 ms 256 KB # of queries: 5
14 Correct 5 ms 256 KB # of queries: 9
15 Correct 6 ms 256 KB # of queries: 104
16 Correct 8 ms 256 KB # of queries: 253
17 Runtime error 463 ms 532 KB Execution killed with signal 11 (could be triggered by violating memory limits)
18 Correct 441 ms 376 KB # of queries: 19485
19 Correct 484 ms 508 KB # of queries: 19764
20 Correct 455 ms 508 KB # of queries: 18574
21 Runtime error 388 ms 508 KB Execution killed with signal 11 (could be triggered by violating memory limits)
22 Runtime error 464 ms 376 KB Execution killed with signal 11 (could be triggered by violating memory limits)
23 Correct 490 ms 504 KB # of queries: 19749
24 Runtime error 183 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
25 Runtime error 444 ms 632 KB Execution killed with signal 11 (could be triggered by violating memory limits)
26 Runtime error 411 ms 500 KB Execution killed with signal 11 (could be triggered by violating memory limits)
27 Correct 174 ms 384 KB # of queries: 9065
28 Correct 287 ms 504 KB # of queries: 11067
29 Correct 271 ms 376 KB # of queries: 11060
30 Correct 273 ms 504 KB # of queries: 11067