제출 #108961

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
108961		Nodir_Bobiev	동굴 (IOI13_cave)	C++14	0 / 100	7 ms	512 KiB

cave

# include "cave.h"
# include <iostream>

using namespace std;

int n, a[5000], b[5000];
int A[5000], B[5000], counter;
/*
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;
	cout << "counter : " << counter << endl;
}
	
int tryCombination( int S[] )
{
	counter ++;
	for ( int i = 0; i < n; i ++ )
		cout << S[i] << ' ';
	int ans = -1;
	for ( int i = 0; i < n; i ++ ){
		if ( S[ b[i] ] != a[ b[i] ] ){
			ans = i;
			break;
		}	
	}
	cout << ": " << ans << endl;
	return ans;
}
*/

void exploreCave( int N )
{
	int S[5000] = {};
	
	fill( B, B + n, 5000 );
	
	for ( int i = 0; i < n; i ++ ){
		
		for ( int j = 0; j < n; j ++ )
			S[j] = 0;
		for ( int j = 0; j < i; j ++ )
			S[ B[j] ] = A[ B[j] ];
		
		int cs = tryCombination( S );
			
		int open = (cs == i );
			
		int l = 0, r = n - 1;
		while( r > l  ){
			int m = ( l + r ) >> 1;
			
			for ( int j = 0; j < n; j ++ )
				S[j] = open;
			for ( int j = l; j <= m; j ++ )
				S[j] = 1 - open;
			for ( int j = 0; j < i; j ++ )
				S[ B[j] ] = A[ B[j] ];
				
			int cs = tryCombination( S );
			
			if( cs == i ) r = m;
			else l = m + 1;
		}
		B[i] = l;
		A[ B[i] ] = open;	
	}
	answer( A, B );
}
/*

int main()
{
	cin >> n;
	
	for ( int i = 0; i < n; i ++ )
		cin >> a[i];
		
	for ( int i = 0; i < n; i ++ )
		cin >> b[i];
	
	exploreCave( n );
	
	return 0;
}
*/

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