oj.uz

Submission #1083080

# Submission time Handle Problem Language Result Execution time Memory
1083080 2024-09-02T12:59:02 Z erdemfurkan Cave (IOI13_cave) C++14
0 / 100
 2 ms 348 KB 
#include "cave.h"
#include <algorithm> 

void exploreCave(int N) {
    int S[N];
    for(int i = 0; i < N; i++) {
        S[i] = 1;
    }
    int duzgun = tryCombination(S);
    int D[N];
    for(int i = 0; i < N; i++) {
        D[i] = i;
    }
    for(int i = 0; i < N; i++) {
        if(i == duzgun) {
            S[i] = 0;
            continue;
        }
        S[i] = 1;
    }
    answer(S, D);
}

Subtask #1
0 / 12.0

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

Subtask #2
0 / 13.0

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

Subtask #3
0 / 21.0

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

Subtask #4
0 / 30.0

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

Subtask #5
0 / 24.0

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