oj.uz

Submission #371395

# Submission time Handle Problem Language Result Execution time Memory
371395 2021-02-26T14:48:30 Z bvh1234567891 Cave (IOI13_cave) C++17
12 / 100
 28 ms 620 KB 
#include "cave.h"
#include "iostream"
#include "vector"
#include "algorithm"

using namespace std;

void exploreCave(int N) {
    int len = 1;
    int tmp = 1;
    while (N>tmp) {
        len++;
        tmp*=2;
    }
    int position[N];
    for (int i = 0; i < N; i++)
        position[i]=i;
    int button[N];
    fill(button, button+N, 0);
    for (int i = 0; i < N; i++) {
        int res = tryCombination(button);
        if (res!=i) continue;
        else button[i]=1;
    }
    answer(button, position);
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 492 KB Output is correct
2 Correct 10 ms 364 KB Output is correct
3 Correct 15 ms 492 KB Output is correct
4 Correct 10 ms 364 KB Output is correct
5 Correct 26 ms 492 KB Output is correct
6 Correct 14 ms 492 KB Output is correct
7 Correct 26 ms 492 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 14 ms 492 KB Output is correct
13 Correct 18 ms 492 KB Output is correct
14 Correct 14 ms 492 KB Output is correct

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 388 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Incorrect 28 ms 620 KB Answer is wrong
4 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

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

Subtask #4
0 / 30.0

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

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 492 KB Output is correct
2 Correct 10 ms 364 KB Output is correct
3 Correct 15 ms 492 KB Output is correct
4 Correct 10 ms 364 KB Output is correct
5 Correct 26 ms 492 KB Output is correct
6 Correct 14 ms 492 KB Output is correct
7 Correct 26 ms 492 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 14 ms 492 KB Output is correct
13 Correct 18 ms 492 KB Output is correct
14 Correct 14 ms 492 KB Output is correct
15 Correct 26 ms 388 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Incorrect 28 ms 620 KB Answer is wrong
18 Halted 0 ms 0 KB -