oj.uz

Submission #1042029

# Submission time Handle Problem Language Result Execution time Memory
1042029 2024-08-02T12:38:44 Z blackslex Cave (IOI13_cave) C++17
0 / 100
 1 ms 348 KB 
#include "cave.h"
#include<bits/stdc++.h>

using namespace std;

void exploreCave(int N) {
    int D[N] = {}, pos[N] = {};
    for (int i = 0; i < N; i++) D[i] = 0, pos[i] = i;
    int cmx = tryCombination(D);
    if (!(~cmx)) return void(answer(D, pos));
    for (int i = cmx + 1; i < N; i++) {
        int z0 = tryCombination(D);
        if (!(~cmx)) return void(answer(D, pos));
        if (z0 >= i) continue;
        D[i] = 1;
    }
    answer(D, pos);
}

Subtask #1
0 / 12.0

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

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Incorrect 0 ms 348 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 0 ms 348 KB Answer is wrong
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 0 ms 348 KB Answer is wrong
3 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

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