oj.uz

Submission #429470

# Submission time Handle Problem Language Result Execution time Memory
429470 2021-06-16T00:58:24 Z dariasc Cave (IOI13_cave) C++14
13 / 100
 18 ms 436 KB 
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;

void exploreCave(int N) {
    int ans[N];
    memset(ans, 0, sizeof ans);
    
    int wires[N];
    for (int i = 0; i < N; i++) {
        ans[i] = 1;
        wires[i] = tryCombination(ans);
        ans[i] = 0;
    }

    answer(ans, wires);
}

Subtask #1
0 / 12.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 384 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 11 ms 384 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 12 ms 332 KB Output is correct
7 Correct 11 ms 332 KB Output is correct
8 Correct 16 ms 436 KB Output is correct
9 Correct 15 ms 332 KB Output is correct
10 Correct 18 ms 332 KB Output is correct
11 Correct 14 ms 332 KB Output is correct

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Incorrect 1 ms 204 KB Answer is wrong
3 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Incorrect 1 ms 204 KB Answer is wrong
3 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

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