oj.uz

답안 #919864

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
919864 2024-02-01T18:25:48 Z SuPythony 동굴 (IOI13_cave) C++17
13 / 100
 9 ms 548 KB 
#include <bits/stdc++.h>
#include "cave.h"
using namespace std;
typedef long long ll;

int tryCombination(int S[]);
void answer(int S[] , int D[]);

void exploreCave(int n) {
    int s[n];
    fill(s, s+n, 0);
    int d[n];
    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 1 ms 344 KB Answer is wrong
2 Halted 0 ms 0 KB -

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 548 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 8 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 8 ms 344 KB Output is correct
7 Correct 8 ms 344 KB Output is correct
8 Correct 8 ms 348 KB Output is correct
9 Correct 9 ms 344 KB Output is correct
10 Correct 8 ms 344 KB Output is correct
11 Correct 8 ms 344 KB Output is correct

Subtask #3
0 / 21.0

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

Subtask #4
0 / 30.0

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

Subtask #5
0 / 24.0

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