oj.uz

답안 #228748

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
228748 2020-05-02T13:12:53 Z jhtan 동굴 (IOI13_cave) C++14
13 / 100
 17 ms 512 KB 
#include "cave.h"
#include <bits/stdc++.h>

using namespace std;

void exploreCave(int N) {
    int S[N];
    int D[N];

    // 12 points
    /*for(int i=0; i<N; i++) {
        S[i] = 0;
        D[i] = i;
    } 

    for(int i=0; i<N; i++) {
        int x = tryCombination(S);
        if(x == -1) break;
        if(x == i) S[i] = 1;
    }

    answer(S, D);*/

    memset(S, 0, sizeof(S));

    for(int i=0; i<N; i++) {
        S[i] = 1;
        D[i] = tryCombination(S);
        S[i] = 0;
    }

    answer(S, D);
}

Subtask #1
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 384 KB Answer is wrong
2 Halted 0 ms 0 KB -

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 15 ms 384 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 17 ms 384 KB Output is correct
7 Correct 16 ms 512 KB Output is correct
8 Correct 16 ms 384 KB Output is correct
9 Correct 16 ms 512 KB Output is correct
10 Correct 17 ms 384 KB Output is correct
11 Correct 15 ms 384 KB Output is correct

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Incorrect 5 ms 384 KB Answer is wrong
3 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Incorrect 5 ms 384 KB Answer is wrong
3 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 384 KB Answer is wrong
2 Halted 0 ms 0 KB -