oj.uz

Submission #104439

# Submission time Handle Problem Language Result Execution time Memory
104439 2019-04-06T20:48:37 Z Badral Cave (IOI13_cave) C++17
0 / 100
 6 ms 512 KB 
#include "cave.h"
#include<bits/stdc++.h>
 
using namespace std;
 
void exploreCave(int N) {
    int a[N+1];
    int d[N+1];
    memset(a, 0, sizeof(a));
    
    for(int i = 0; i < N; i++) {
        d[i] = i;
        if(tryCombination(a) == i) {
            continue;
        }else {
            a[i] = 1;
        }
    }
    answer(a, d);
}

Subtask #1
0 / 12.0

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

Subtask #2
0 / 13.0

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

Subtask #3
0 / 21.0

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

Subtask #4
0 / 30.0

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

Subtask #5
0 / 24.0

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