Submission #291382

#	Time	Username	Problem	Language	Result	Execution time	Memory
291382		Badrangiikh	Cave (IOI13_cave)	C++14	100 / 100	248 ms	808 KiB

cave

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

int x , y , z ;
int w [ 14 ] [ 5000 ] ;
int F [ 5000 ] ;

void exploreCave(int N) {
    for ( int i = 0 ; i < 14 ; i ++ ) {
        for ( int j = 0 ; j < N ; j ++ ) {
            if ( ( 1 << i ) & j ) w [ i ] [ j ] = 1 ;
        }
    }
    for ( int i = 0 ; i < N ; i ++ ) {
        x = 0 ;
        y = tryCombination ( w [ 13 ] ) ;
        if ( y == i ) z = 1 ;
        else z = 0 ;
        for ( int j = 0 ; j < 13 ; j ++ ) {
            y = tryCombination ( w [ j ] ) ;
            if ( y == i && z == 0 ) x += 1 << j ;
            if ( y != i && z != 0 ) x += 1 << j ;
        }
        for ( int j = 0 ; j < 14 ; j ++ ) {
            w [ j ] [ x ] = z ;
        }
        F [ x ] = i ;
    }
    answer ( w [ 0 ] , F ) ;
}

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