제출 #729527

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
729527		Jean7	동굴 (IOI13_cave)	C++14	46 / 100	12 ms	400 KiB

cave

#include "cave.h"
#include <bits/stdc++.h>

using namespace std ;

int n , s[5000] , d[5000] ;

void solve2 () {
    for ( int i = 0 ; i < n ; i++ ) {
        s[i] = 0 ;
    }
    for ( int i = 0 ; i < n ; i++ ) {
        s[i] = 1 ;
        d[i] = tryCombination(s) ;
        s[i] = 0 ;
    }
    answer(s,d) ;
}

void solve1 () {
    for ( int i = 0 ; i < n ; i++ ) {
        d[i] = i ;
        s[i] = 0 ;
    }
    for ( int i = 0 ; i < n ; i++ ) {
        int x = tryCombination(s) ;
        if ( x == -1 ) {
            break ;
        }
        s[x] = 1 ;
    }
    answer(s,d) ;
}

void solve () {
    for ( int i = 0 ; i < n ; i++ ) {
        s[i] = 0 ;
    }
    if ( tryCombination(s) != -1 ) {
        solve1 () ;
    }
    else {
        solve2 () ;
    }
}

void exploreCave ( int N ) {
    n = N ;
    if ( n > 100 ) {
        solve () ;
    }
    for ( int j = 0 ; j < n ; j++ ) {
        for ( int i = 0 ; i < n ; i++ ) {
            s[i] = 1 ;
            int x = tryCombination(s) ;
            s[i] = 0 ;
            int y = tryCombination(s) ;
            if ( x == -1 ) {
                x = 1e9 ;
            }
            if ( y == -1 ) {
                y = 1e9 ;
            }
            if ( x == y ) {
                continue ;
            }
            if ( x < y ) {
                s[i] = 0 ;
                d[i] = x ;
            }
            else {
                s[i] = 1 ;
                d[i] = y ;
            }
        }
    }
    answer(s,d) ;
}

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