oj.uz

Submission #261600

# Submission time Handle Problem Language Result Execution time Memory
261600 2020-08-11T22:05:08 Z s_avila_g Cave (IOI13_cave) C++14
13 / 100
 16 ms 384 KB 
#include <bits/stdc++.h>
using namespace std;
#include "cave.h"

void exploreCave(int N) {
    int comb[N], inter[N];
    for(int i = 0; i < N; i++) inter[i] = 0, comb[i] = 0;
    for(int i = 0; i < N; i++){
        comb[i] = 1;
        inter[i] = tryCombination(comb);
        comb[i] = 0;
    }
    for(int i = 0 ; i < N; i++) comb[i] = 0;
    answer(comb,inter);
}

Subtask #1
0 / 12.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 11 ms 384 KB Output is correct
4 Correct 1 ms 288 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 11 ms 384 KB Output is correct
7 Correct 11 ms 384 KB Output is correct
8 Correct 15 ms 384 KB Output is correct
9 Correct 16 ms 384 KB Output is correct
10 Correct 15 ms 384 KB Output is correct
11 Correct 11 ms 384 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 0 ms 384 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 0 ms 384 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 384 KB Answer is wrong
2 Halted 0 ms 0 KB -