oj.uz

Submission #874319

# Submission time Handle Problem Language Result Execution time Memory
874319 2023-11-16T16:33:38 Z asli_bg Cave (IOI13_cave) C++11
0 / 100
 1 ms 480 KB 
#include "cave.h"

const int MAXN=5e3+3;
int S[MAXN];
int D[MAXN];

void exploreCave(int N) {
    /* ... */

    for(int i=0;i<N;i++){
        S[i]=0;
        D[i]=i;
    }

    int cev=tryCombination(S);

    while(cev!=-1){
        S[cev-1]=1;
        cev=tryCombination(S);
    }

    answer(S,D);

}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB too much calls on tryCombination()
2 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 424 KB Output is correct
3 Incorrect 1 ms 480 KB Answer is wrong
4 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 1 ms 348 KB too much calls on tryCombination()
3 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 1 ms 348 KB too much calls on tryCombination()
3 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB too much calls on tryCombination()
2 Halted 0 ms 0 KB -