oj.uz

Submission #68757

# Submission time Handle Problem Language Result Execution time Memory
68757 2018-08-18T10:36:20 Z someone_aa Cave (IOI13_cave) C++17
13 / 100
 23 ms 640 KB 
#include <bits/stdc++.h>
#include "cave.h"

using namespace std;

void exploreCave(int N) {
    int open_comb[N];
    int sw[N];

    for(int i=0;i<N;i++) open_comb[i] = 0;

    int curr[N];
    memset(curr,0,sizeof(curr));
    for(int i=0;i<N;i++) {
        curr[i] = 1;
        int ans = tryCombination(curr);
        curr[i] = 0;
        sw[i] = ans;
    }
    answer(open_comb, sw);
}

Subtask #1
0 / 12.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 512 KB Output is correct
2 Correct 6 ms 384 KB Output is correct
3 Correct 21 ms 512 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 21 ms 460 KB Output is correct
7 Correct 20 ms 512 KB Output is correct
8 Correct 18 ms 640 KB Output is correct
9 Correct 17 ms 640 KB Output is correct
10 Correct 17 ms 512 KB Output is correct
11 Correct 22 ms 512 KB Output is correct

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Incorrect 6 ms 460 KB Answer is wrong
3 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Incorrect 6 ms 460 KB Answer is wrong
3 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

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