oj.uz

답안 #334039

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
334039 2020-12-08T07:22:22 Z dolphingarlic Broken Device (JOI17_broken_device) C++14
0 / 100
 51 ms 3096 KB 
#include "Annalib.h"

void Anna(int N, long long X, int K, int P[]) {
    bool broken[150];
    for (int i = 0; i < N; i++) broken[i] = false;
    for (int i = 0; i < K; i++) broken[P[i]] = true;

    for (int i = 0, j = 0; i < N; i += 3) {
        if (broken[i] + broken[i + 1] + broken[i + 2] > 1 || j > 60) {
            Set(i, 0);
            Set(i + 1, 0);
            Set(i + 2, 0);
        } else {
            if (X & (1 << j)) {
                for (int k = i, cnt = 0; k < i + 3; k++) {
                    if (!broken[k] && cnt++ < 2) Set(k, 1);
                    else Set(k, 0);
                }
            } else {
                for (int k = i, cnt = 0; k < i + 3; k++) {
                    if (!broken[k] && cnt++ < 1) Set(k, 1);
                    else Set(k, 0);
                }
            }
            j++;
        }
    }
}

#include "Brunolib.h"

long long Bruno(int N, int A[]) {
    long long ans = 0;
    for (int i = 0, j = 0; i < N; i += 3) {
        int cnt = A[i] + A[i + 1] + A[i + 2];
        if (!cnt) continue;
        ans += (cnt == 2) * (1 << j);
        j++;
    }
    return ans;
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 40 ms 2968 KB Output isn't correct - L* = 0
2 Partially correct 40 ms 3000 KB Output isn't correct - L* = 0
3 Partially correct 40 ms 2976 KB Output isn't correct - L* = 0
4 Partially correct 40 ms 2740 KB Output isn't correct - L* = 0
5 Partially correct 39 ms 2968 KB Output isn't correct - L* = 0
6 Partially correct 38 ms 2744 KB Output isn't correct - L* = 0
7 Partially correct 39 ms 2968 KB Output isn't correct - L* = 0
8 Partially correct 38 ms 2976 KB Output isn't correct - L* = 0
9 Partially correct 38 ms 2744 KB Output isn't correct - L* = 0
10 Partially correct 39 ms 2968 KB Output isn't correct - L* = 0
11 Partially correct 40 ms 2880 KB Output isn't correct - L* = 0
12 Partially correct 40 ms 2792 KB Output isn't correct - L* = 0
13 Partially correct 40 ms 2872 KB Output isn't correct - L* = 0
14 Partially correct 39 ms 2916 KB Output isn't correct - L* = 0
15 Partially correct 41 ms 2868 KB Output isn't correct - L* = 0
16 Partially correct 40 ms 2744 KB Output isn't correct - L* = 0
17 Partially correct 39 ms 2968 KB Output isn't correct - L* = 0
18 Partially correct 38 ms 2740 KB Output isn't correct - L* = 0
19 Partially correct 39 ms 2744 KB Output isn't correct - L* = 0
20 Partially correct 47 ms 2744 KB Output isn't correct - L* = 0
21 Partially correct 39 ms 2740 KB Output isn't correct - L* = 0
22 Partially correct 38 ms 2968 KB Output isn't correct - L* = 0
23 Partially correct 40 ms 2976 KB Output isn't correct - L* = 0
24 Partially correct 40 ms 2744 KB Output isn't correct - L* = 0
25 Partially correct 43 ms 2968 KB Output isn't correct - L* = 0
26 Partially correct 51 ms 2728 KB Output isn't correct - L* = 0
27 Partially correct 38 ms 2976 KB Output isn't correct - L* = 0
28 Partially correct 40 ms 2868 KB Output isn't correct - L* = 0
29 Partially correct 38 ms 2740 KB Output isn't correct - L* = 0
30 Partially correct 39 ms 2976 KB Output isn't correct - L* = 0
31 Partially correct 38 ms 2740 KB Output isn't correct - L* = 0
32 Partially correct 41 ms 2744 KB Output isn't correct - L* = 0
33 Partially correct 39 ms 2968 KB Output isn't correct - L* = 0
34 Partially correct 39 ms 2968 KB Output isn't correct - L* = 0
35 Partially correct 39 ms 2744 KB Output isn't correct - L* = 0
36 Partially correct 39 ms 3096 KB Output isn't correct - L* = 0
37 Partially correct 40 ms 2872 KB Output isn't correct - L* = 0
38 Partially correct 39 ms 2868 KB Output isn't correct - L* = 0
39 Partially correct 39 ms 2996 KB Output isn't correct - L* = 0
40 Partially correct 39 ms 2744 KB Output isn't correct - L* = 0