Submission #874350

#	Time	Username	Problem	Language	Result	Execution time	Memory
874350		asli_bg	Cave (IOI13_cave)	C++11	0 / 100	54 ms	524 KiB

cave

#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
const int MAXN=5e3+3;
int S1[MAXN];
int S2[MAXN];
int D[MAXN];
 
void exploreCave(int N) {
    /* ... */
 
    //int x;
    int bas=0;
 
    for(int i=0;i<N;i++){
        D[i]=i;
    }
 
    ////////////////////////////////
    while(bas<=N){
        for(int i=bas;i<N;i++){
            S1[i]=0;
        }

        int z=tryCombination(S1);
 
        for(int i=bas;i<N;i++){
            S2[i]=1;
        }

        int o=tryCombination(S2);
 
        if(z==-1){
            answer(S1,D);
            break;
        }
        else if(o==-1){
            answer(S2,D);
            break;
        }
        else{
            if(o>z){
                for(int i=bas;i<(o-1);i++){
                    S1[i]=1;
                }

                S2[o-1]=0;
            }
            else{
                for(int i=bas;i<(z-1);i++){
                    S2[i]=0;
                }
                S1[z-1]=1;
            }
 
            bas=max(o,z);
        }
    }

    return;
 
}

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