oj.uz

Submission #492907

# Submission time Handle Problem Language Result Execution time Memory
492907 2021-12-09T16:37:11 Z aris12345678 Cave (IOI13_cave) C++14
13 / 100
 12 ms 420 KB 
#include <bits/stdc++.h>
// #include "graderlib.cpp"
#include "cave.h"
using namespace std;

const int mxN = 5005;

void exploreCave(int n) {
    int switches[n];
    int pos[n];
    fill(switches, switches+n, 0);
    for(int i = 0; i < n; i++) {
        switches[i] = 1;
        int first = tryCombination(switches);
        pos[i] = first;
        switches[i] = 0;
    }
    answer(switches, pos);
}

// int main() {
//     int N = init();
//     exploreCave(N);
//     return 0;
// }

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 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 10 ms 332 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 10 ms 332 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 10 ms 308 KB Output is correct
7 Correct 10 ms 332 KB Output is correct
8 Correct 11 ms 332 KB Output is correct
9 Correct 11 ms 416 KB Output is correct
10 Correct 12 ms 420 KB Output is correct
11 Correct 10 ms 332 KB Output is correct

Subtask #3
0 / 21.0

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