oj.uz

답안 #100010

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
100010 2019-03-09T06:27:25 Z cheeheng Broken Device (JOI17_broken_device) C++14
0 / 100
 66 ms 3112 KB 
#include "Annalib.h"
#include <bits/stdc++.h>
using namespace std;
 
void Set( int pos, int bit );
 
void Anna( int N, long long X, int K, int P[] ){
    if(K >= -123){
        if(P[0] >= 60){
            for(int i = 0; i < 60; i ++){
                Set(i, (X&(1<<i)) != 0);
            }
            for(int i = 60; i < 150; i ++){
                Set(i, 0);
            }
        }else{
            for(int i = 0; i < 60; i ++){
                Set(i + 90, (X&(1<<i)) != 0);
            }
            for(int i = 0; i < 90; i ++){
                Set(i, 0);
            }
        }
    }else{
        throw;
    }
}
#include "Brunolib.h"
#include <bits/stdc++.h>
using namespace std;
 
long long Bruno( int N, int A[] ){
    long long X1 = 0;
    long long X2 = 0;
    for(int i = 0; i < 60; i ++){
        X1 |= ((long long)A[i]<<i);
    }
    for(int i = 0; i < 60; i ++){
        X2 |= ((long long)A[i+90]<<i);
    }
    if(X1 == 0 && X2 == 0){
        //printf("%lld\n", 0);
        return 0LL;
    }else if(X1 == 0){
        //printf("%lld\n", X2);
        return X2;
    }else{
        //printf("%lld\n", X1);
        return X1;
    }
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 54 ms 3072 KB Output isn't correct - L* = 0
2 Incorrect 41 ms 3056 KB Output isn't correct - L* = 0
3 Incorrect 46 ms 3056 KB Output isn't correct - L* = 0
4 Incorrect 39 ms 3072 KB Output isn't correct - L* = 0
5 Incorrect 44 ms 3072 KB Output isn't correct - L* = 0
6 Incorrect 44 ms 3072 KB Output isn't correct - L* = 0
7 Incorrect 51 ms 3056 KB Output isn't correct - L* = 0
8 Incorrect 43 ms 3112 KB Output isn't correct - L* = 0
9 Incorrect 66 ms 3056 KB Output isn't correct - L* = 0
10 Incorrect 47 ms 3056 KB Output isn't correct - L* = 0
11 Incorrect 36 ms 3056 KB Output isn't correct - L* = 0
12 Incorrect 40 ms 3056 KB Output isn't correct - L* = 0
13 Incorrect 35 ms 3072 KB Output isn't correct - L* = 0
14 Incorrect 41 ms 3072 KB Output isn't correct - L* = 0
15 Incorrect 55 ms 2944 KB Output isn't correct - L* = 0
16 Incorrect 50 ms 3056 KB Output isn't correct - L* = 0
17 Incorrect 39 ms 3072 KB Output isn't correct - L* = 0
18 Incorrect 43 ms 3000 KB Output isn't correct - L* = 0
19 Incorrect 35 ms 3024 KB Output isn't correct - L* = 0
20 Incorrect 40 ms 3072 KB Output isn't correct - L* = 0
21 Incorrect 40 ms 3056 KB Output isn't correct - L* = 0
22 Incorrect 40 ms 3072 KB Output isn't correct - L* = 0
23 Incorrect 34 ms 3056 KB Output isn't correct - L* = 0
24 Incorrect 37 ms 3072 KB Output isn't correct - L* = 0
25 Incorrect 40 ms 3056 KB Output isn't correct - L* = 0
26 Incorrect 62 ms 3056 KB Output isn't correct - L* = 0
27 Incorrect 52 ms 3104 KB Output isn't correct - L* = 0
28 Incorrect 44 ms 3056 KB Output isn't correct - L* = 0
29 Incorrect 50 ms 3064 KB Output isn't correct - L* = 0
30 Incorrect 55 ms 3056 KB Output isn't correct - L* = 0
31 Incorrect 48 ms 3056 KB Output isn't correct - L* = 0
32 Incorrect 63 ms 3056 KB Output isn't correct - L* = 0
33 Incorrect 55 ms 3072 KB Output isn't correct - L* = 0
34 Incorrect 65 ms 3056 KB Output isn't correct - L* = 0
35 Incorrect 54 ms 3056 KB Output isn't correct - L* = 0
36 Incorrect 38 ms 3072 KB Output isn't correct - L* = 0
37 Incorrect 45 ms 3056 KB Output isn't correct - L* = 0
38 Incorrect 40 ms 3056 KB Output isn't correct - L* = 0
39 Incorrect 39 ms 3056 KB Output isn't correct - L* = 0
40 Incorrect 59 ms 3056 KB Output isn't correct - L* = 0