oj.uz

답안 #100076

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
100076 2019-03-09T08:14:05 Z jamielim Broken Device (JOI17_broken_device) C++14
0 / 100
 65 ms 3072 KB 
#include "Annalib.h"
#include <bits/stdc++.h>
using namespace std;

void Anna( int N, long long X, int K, int P[] ){
    if(K==1){
        if(P[0]<=75){
            for(int i=0;i<=75;i++)Set(i,0);
            for(int i=76;i<N;i++){
                Set(i,(X%2));
                X/=2;
            }
        }else{
            for(int i=0;i<N;i++){
                Set(i,(X%2));
                X/=2;
            }
        }
        return;
    }
    int arr[N];
    for(int i=0;i<K;i++){
        arr[P[i]]=-1;
    }
    int poss=0;
    int k=__builtin_ctz(X);
    X>>=k;
    for(int i=0;i<N-1;i++){
        if(X==0)break;
        if(i<poss)continue;
        if(X%2==0){
            if(arr[i]!=-1){
                arr[i]=1;
                arr[i+1]=0;
                poss=i+2;
            }
        }else{
            if(arr[i]!=-1&&arr[i+1]!=-1){
                arr[i]=1;
                arr[i+1]=1;
                poss=i+2;
            }
        }
        X>>=1;
    }
    for(int i=0;i<N;i++){
        if(arr[i]!=1&&arr[i]!=0)arr[i]=0;
        Set(i,arr[i]);
    }
    return;
}
#include "Brunolib.h"
#include <bits/stdc++.h>
using namespace std;
long long Bruno( int N, int A[] ){
    long long ans=0;
    for(int i=0;i<=75;i++){
        if(A[i]==1){
            for(long long j=0;j<=75;j++){
                ans+=(long long)(A[i])*(1<<j);
                if((1<<j)>1000000000000000000)break;
            }
            return ans;
        }
    }
    for(long long i=76;i<N;i++){
        ans+=(long long)(A[i])*(1<<(i-76));
        if((1<<(i-76))>1000000000000000000)break;
    }
    return ans;
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 47 ms 3056 KB Output isn't correct - L* = 0
2 Incorrect 51 ms 3072 KB Output isn't correct - L* = 0
3 Incorrect 34 ms 3072 KB Output isn't correct - L* = 0
4 Incorrect 43 ms 3072 KB Output isn't correct - L* = 0
5 Incorrect 43 ms 3056 KB Output isn't correct - L* = 0
6 Incorrect 36 ms 3072 KB Output isn't correct - L* = 0
7 Incorrect 47 ms 2832 KB Output isn't correct - L* = 0
8 Incorrect 37 ms 3072 KB Output isn't correct - L* = 0
9 Incorrect 37 ms 3072 KB Output isn't correct - L* = 0
10 Incorrect 35 ms 3056 KB Output isn't correct - L* = 0
11 Incorrect 39 ms 3072 KB Output isn't correct - L* = 0
12 Incorrect 43 ms 3072 KB Output isn't correct - L* = 0
13 Incorrect 43 ms 3040 KB Output isn't correct - L* = 0
14 Incorrect 40 ms 3056 KB Output isn't correct - L* = 0
15 Incorrect 35 ms 3056 KB Output isn't correct - L* = 0
16 Incorrect 53 ms 3064 KB Output isn't correct - L* = 0
17 Incorrect 65 ms 3056 KB Output isn't correct - L* = 0
18 Incorrect 41 ms 3000 KB Output isn't correct - L* = 0
19 Incorrect 40 ms 3056 KB Output isn't correct - L* = 0
20 Incorrect 36 ms 3056 KB Output isn't correct - L* = 0
21 Incorrect 34 ms 3072 KB Output isn't correct - L* = 0
22 Incorrect 35 ms 3072 KB Output isn't correct - L* = 0
23 Incorrect 44 ms 3056 KB Output isn't correct - L* = 0
24 Incorrect 39 ms 3072 KB Output isn't correct - L* = 0
25 Incorrect 61 ms 3056 KB Output isn't correct - L* = 0
26 Incorrect 39 ms 3040 KB Output isn't correct - L* = 0
27 Incorrect 52 ms 3056 KB Output isn't correct - L* = 0
28 Incorrect 39 ms 3056 KB Output isn't correct - L* = 0
29 Incorrect 37 ms 3056 KB Output isn't correct - L* = 0
30 Incorrect 34 ms 3072 KB Output isn't correct - L* = 0
31 Incorrect 41 ms 2952 KB Output isn't correct - L* = 0
32 Incorrect 44 ms 3056 KB Output isn't correct - L* = 0
33 Incorrect 38 ms 3056 KB Output isn't correct - L* = 0
34 Incorrect 34 ms 3016 KB Output isn't correct - L* = 0
35 Incorrect 40 ms 3072 KB Output isn't correct - L* = 0
36 Incorrect 36 ms 3056 KB Output isn't correct - L* = 0
37 Incorrect 39 ms 3064 KB Output isn't correct - L* = 0
38 Incorrect 51 ms 3072 KB Output isn't correct - L* = 0
39 Incorrect 41 ms 3056 KB Output isn't correct - L* = 0
40 Incorrect 39 ms 3000 KB Output isn't correct - L* = 0