제출 #146143

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
146143		youssefbou62	동굴 (IOI13_cave)	C++14	100 / 100	427 ms	540 KiB

cave

#include  <bits/stdc++.h>
#include "cave.h"
using namespace std;

#define mp make_pair
#define fi first
#define se second
#define all(v) v.begin(),v.end()
#define allarr(a) a , a + n
#define ll long long
#define ull unsigned long long 
#define pb push_back
#define fastio ios_base::sync_with_stdio(false) ; cin.tie(NULL); cout.tie(NULL)
typedef pair<int, int> pi;
typedef pair<ll,ll> pll; 
typedef pair<int,pi> trp ;
typedef vector<pi> vpi;
typedef vector<pll> vpll ;
// int ab  (int  x ) { return (x>0?x:-x); }

int n ;
int door[5005] , comb[5005]; 

void rev(int l , int r ){
	for(;l<=r;l++){
		if( door[l]==-1)comb[l]=!comb[l]; 
	}
}
// void answer(int S[],int D[]){
// 	for(int i = 0 ; i < n ; i++ )cout << S[i]; 
// 		cout<<endl; 

// 	for(int i = 0 ; i < n ; i++ )cout<<D[i]; 
// 	cout << endl ; 
// }

// int tryCombination(int S[]){
// 	cout << "try comb"<<endl; 
// 	for(int i = 0 ; i < n ; i++ )cout << S[i]; 
// 	cout<<endl; 
// 	int ans; 
// 	cin >> ans; 
// 	return ans ; 
// }
void findDoor(int i ){
	int l = 0 , r = n-1 ; 
	int start = tryCombination(comb); 
	if( start != i )rev(0,n-1); 
	while ( l < r ){
		int mid = (l+r)/2 ; 
		rev(l,mid); 
		int reply = tryCombination(comb); 
		rev(l,mid); 
		
		if( reply != i ){
			r = mid ; 
		}else {
			l = mid+1; 
		}
		// start = reply ; 
	}
	// cout << "door "<<l<<" " << i << endl; 
	door[l]=i ;
	comb[l]=!comb[l]; 
}
void exploreCave(int N){
	n = N ; 
	memset(door,-1,sizeof door); 
	for(int i = 0 ; i < n ; i++ )findDoor(i); 
	int ans[N]; 
	// for(int i = 0 ; i < n ; i++ )ans[door[i]]=i; 
	answer(comb,door);
}

// int main(){
// 	cin >>  n; 
// 	exploreCave(n); 
// }

컴파일 시 표준 에러 (stderr) 메시지

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:70:6: warning: unused variable 'ans' [-Wunused-variable]
  int ans[N]; 
      ^~~

• Subtask 1: 12 / 12
• Subtask 2: 13 / 13
• Subtask 3: 21 / 21
• Subtask 4: 30 / 30
• Subtask 5: 24 / 24