제출 #144848

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
144848		youssefbou62	동굴 (IOI13_cave)	C++14	13 / 100	52 ms	632 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 cnt = 0 ; 
     
    int TryCombination(int S[]){
    	cnt++; 
    	assert(cnt<=69000);
    	tryCombination(S); 
    }
     
    void exploreCave(int N){
    	n = N ; 
    	int door[N],Combination[N]={0},Mode[N]; 
    	memset(door,-1,sizeof door); 
    	int reply =0; 
    	while(reply!=-1){
    	int l = 0 , r= N-1 ; 
    	int last = TryCombination(Combination); 
    	reply = last; 
    	while ( l<= r ){
    			if( last == -1 )break ; 
    			int mid = (l+r)/2 ;
    			if( l == r ){
    					door[r]=reply;
    					break ; 
    			}   
    			for(int i = l ; i < mid ; i++ ){
    				if( door[i] == -1 ){
    					 Combination[i]= (!Combination[i]); 
    				}
    			}
    			reply = TryCombination(Combination);  
    			if( reply == -1 )break ; 
    			if( reply == last){
    				l = mid+1;
    			}else {
    				for(int i = l ; i < mid ; i++ ){
    					if( door[i] == -1 ){
    						 Combination[i]= (!Combination[i]); 
    					}
    				}
    			r = mid-1; 
    			}
    		}
    	}
    	assert(reply==-1); 
    	for(int i = 0 ; i < n ; i++ ){
    		if( door[i]==-1){
    		Combination[i]=!Combination[i]; 
    		reply = TryCombination(Combination);
    		door[i]=reply; 
    		Combination[i]=!Combination[i];
    		}
    	}

    	
    	answer(Combination,door); 
    }
     

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

cave.cpp: In function 'void exploreCave(int)':
cave.cpp:33:37: warning: unused variable 'Mode' [-Wunused-variable]
      int door[N],Combination[N]={0},Mode[N]; 
                                     ^~~~
cave.cpp: In function 'int TryCombination(int*)':
cave.cpp:29:5: warning: control reaches end of non-void function [-Wreturn-type]
     }
     ^

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