oj.uz

답안 #26833

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
26833 2017-07-06T08:20:22 Z wangyenjen Broken Device (JOI17_broken_device) C++14
8 / 100
 59 ms 4636 KB 
/// Author: Wang, Yen-Jen
#include "Annalib.h"
#include <bits/stdc++.h>

using namespace std;

static bool st[150];
static int cnt[30];

void Anna(int N , long long X , int K , int P[]) {
    memset(st , 0 , sizeof(st));
    memset(cnt , 0 , sizeof(cnt));
    for(int i = 0; i < K; i++) {
        st[P[i]] = 1;
        cnt[P[i] / 3]++;
    }
    int cc = 0;
    for(int i = 0; i < N / 3; i++) {
        if(cc >= 60 || cnt[i] == 3) {
            Set(i * 3 , 0);
            Set(i * 3 + 1 , 0);
            Set(i * 3 + 2 , 0);
            continue;
        }
        if(cnt[i] == 2) {
            if(!st[i * 3]) {
                if((~(X>>cc)&1) && (~(X>>(cc + 1))&1)) {
                    Set(i * 3 , 1);
                    Set(i * 3 + 1 , 0);
                    Set(i * 3 + 2 , 0);
                    cc += 2;
                }
                else {
                    Set(i * 3 , 0);
                    Set(i * 3 + 1 , 0);
                    Set(i * 3 + 2 , 0);
                }
            }
            else if(!st[i * 3 + 1]) {
                if(~(X>>cc)&1) {
                    Set(i * 3 , 0);
                    Set(i * 3 + 1 , 1);
                    Set(i * 3 + 2 , 0);
                    cc++;
                }
                else {
                    Set(i * 3 , 0);
                    Set(i * 3 + 1 , 0);
                    Set(i * 3 + 2 , 0);
                }
            }
            else {
                if((X>>cc)&1) {
                    Set(i * 3 , 0);
                    Set(i * 3 + 1 , 0);
                    Set(i * 3 + 2 , 1);
                    cc++;
                }
                else {
                    Set(i * 3 , 0);
                    Set(i * 3 + 1 , 0);
                    Set(i * 3 + 2 , 0);
                }
            }
        }
        else if(cnt[i] == 0) {
            Set(i * 3 , 1);
            Set(i * 3 + 1 , (X>>cc)&1);
            cc++;
            Set(i * 3 + 2 , (X>>cc)&1);
            cc++;
        }
        else {
            if(st[i * 3]) {
                Set(i * 3 , 0);
                Set(i * 3 + 1 , 1);
                Set(i * 3 + 2 , (X>>cc)&1);
                cc++;
            }
            else if(st[i * 3 + 1]) {
                if(~(X>>cc)&1) {
                    Set(i * 3 , 1);
                    Set(i * 3 + 1 , (X>>cc)&1);
                    cc++;
                    Set(i * 3 + 2 , (X>>cc)&1);
                    cc++;
                }
                else {
                    Set(i * 3 , 0);
                    Set(i * 3 + 1 , 0);
                    Set(i * 3 + 2 , 1);
                    cc++;
                }
            }
            else {
                if(~(X>>(cc + 1))&1) {
                    Set(i * 3 , 1);
                    Set(i * 3 + 1 , (X>>cc)&1);
                    cc++;
                    Set(i * 3 + 2 , (X>>cc)&1);
                    cc++;
                }
                else {
                    Set(i * 3 , 0);
                    Set(i * 3 + 1 , 0);
                    Set(i * 3 + 2 , 0);
                }
            }
        }
    }
}

/// Author: Wang, Yen-Jen
#include "Brunolib.h"
#include <bits/stdc++.h>

using namespace std;

long long Bruno(int N , int A[]) {
    long long X = 0;
    int cc = 0;
    for(int i = 0; i < N / 3; i++) {
        if(A[i * 3]) {
            X |= ((long long)A[i * 3 + 1]<<cc);
            cc++;
            X |= ((long long)A[i * 3 + 2]<<cc);
            cc++;
        }
        else if(A[i * 3 + 1]) {
            X |= ((long long)A[i * 3 + 2]<<cc);
            cc++;
        }
        else if(A[i * 3 + 2]) {
            X |= ((long long)A[i * 3 + 2]<<cc);
            cc++;
        }
    }
    return X;
}

Subtask #1
8.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 41 ms 4636 KB Output is partially correct - L* = 14
2 Partially correct 52 ms 4636 KB Output is partially correct - L* = 14
3 Partially correct 59 ms 4636 KB Output is partially correct - L* = 14
4 Partially correct 41 ms 4636 KB Output is partially correct - L* = 14
5 Partially correct 39 ms 4636 KB Output is partially correct - L* = 15
6 Partially correct 45 ms 4636 KB Output is partially correct - L* = 14
7 Partially correct 41 ms 4636 KB Output is partially correct - L* = 14
8 Partially correct 38 ms 4636 KB Output is partially correct - L* = 15
9 Partially correct 32 ms 4636 KB Output is partially correct - L* = 14
10 Partially correct 52 ms 4636 KB Output is partially correct - L* = 14
11 Partially correct 49 ms 4636 KB Output is partially correct - L* = 14
12 Partially correct 45 ms 4636 KB Output is partially correct - L* = 14
13 Partially correct 39 ms 4636 KB Output is partially correct - L* = 14
14 Partially correct 59 ms 4636 KB Output is partially correct - L* = 14
15 Partially correct 46 ms 4636 KB Output is partially correct - L* = 14
16 Partially correct 46 ms 4636 KB Output is partially correct - L* = 14
17 Partially correct 39 ms 4636 KB Output is partially correct - L* = 14
18 Partially correct 41 ms 4636 KB Output is partially correct - L* = 14
19 Partially correct 39 ms 4636 KB Output is partially correct - L* = 14
20 Partially correct 36 ms 4636 KB Output is partially correct - L* = 14
21 Partially correct 39 ms 4636 KB Output is partially correct - L* = 14
22 Partially correct 34 ms 4636 KB Output is partially correct - L* = 14
23 Partially correct 46 ms 4636 KB Output is partially correct - L* = 14
24 Partially correct 32 ms 4636 KB Output is partially correct - L* = 14
25 Partially correct 39 ms 4636 KB Output is partially correct - L* = 14
26 Partially correct 49 ms 4636 KB Output is partially correct - L* = 14
27 Partially correct 55 ms 4636 KB Output is partially correct - L* = 15
28 Partially correct 48 ms 4636 KB Output is partially correct - L* = 14
29 Partially correct 55 ms 4636 KB Output is partially correct - L* = 14
30 Partially correct 39 ms 4636 KB Output is partially correct - L* = 14
31 Partially correct 48 ms 4636 KB Output is partially correct - L* = 14
32 Partially correct 45 ms 4636 KB Output is partially correct - L* = 14
33 Partially correct 52 ms 4636 KB Output is partially correct - L* = 14
34 Partially correct 49 ms 4636 KB Output is partially correct - L* = 14
35 Partially correct 39 ms 4636 KB Output is partially correct - L* = 14
36 Partially correct 46 ms 4636 KB Output is partially correct - L* = 14
37 Partially correct 48 ms 4636 KB Output is partially correct - L* = 14
38 Partially correct 52 ms 4636 KB Output is partially correct - L* = 14
39 Partially correct 49 ms 4636 KB Output is partially correct - L* = 14
40 Partially correct 38 ms 4636 KB Output is partially correct - L* = 14