oj.uz

Submission #16265

# Submission time Handle Problem Language Result Execution time Memory
16265 2015-08-19T04:51:38 Z CodingBug Cave (IOI13_cave) C++
0 / 100
 41 ms 512 KB 
#include "cave.h"
#define M 5000

void exploreCave(int N) {
    bool ch[N];
    int s[N],a[N],i,j;
    for(i=0;i<N;i++){
        ch[i]=false;
        s[i]=0;
        a[i]=0;
    }
    for(i=0;i<N;i++){
        int p,p2=tryCombination(s);
        int st,ed,mi;
        for(st=0,ed=N-1;st<ed;p!=(p2=tryCombination(s)) ? st=mi+1 : ed=mi){
            p=p2;
            mi=(st+ed)/2;
            for(j=mi+1;j<=ed;j++) if(!ch[j]) s[j]=!s[j];
        }
        if(p2==i) s[st]=!s[st];
        ch[st]=true;
        a[st]=i;
    }
    answer(s,a);
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 36 ms 384 KB Answer is wrong
2 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 41 ms 476 KB Answer is wrong
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 512 KB Answer is wrong
2 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 384 KB Answer is wrong
2 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 28 ms 384 KB Answer is wrong
2 Halted 0 ms 0 KB -