답안 #131600

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
131600 2019-07-17T10:16:15 Z Osama_Alkhodairy Broken Device (JOI17_broken_device) C++17
0 / 100
4 ms 912 KB
#include <bits/stdc++.h>
//~ #include "grader.cpp"
//~ #include "Bruno.cpp"
#include "Annalib.h"
using namespace std;

void Anna( int N, long long X, int K, int P[] ){
    vector <int> p;
    for(int i = 0 ; i < K ; i++){
        p.push_back(P[i]);
    }
    int ind = 0;
    for(int i = 59 ; i >= 0 ; i--){
        if(ind == N - 1){
            Set(ind++, 0);
            break;
        }
        if(count(p.begin(), p.end(), ind + 1)){
            Set(ind++, 0);
            i++;
            continue;
        }
        if(count(p.begin(), p.end(), ind)){
            Set(ind++, 0);
            i++;
            continue;
        }
        Set(ind++, 1);
        Set(ind++, (X >> i) & 1);
    }
    while(ind < N) Set(ind++, 0);
}
#include <bits/stdc++.h>
#include "Brunolib.h"
using namespace std;
#define ll long long

long long Bruno( int N, int A[] ){
    ll ret = 0;
    int ind = 0;
    while(ind < N){
        if(A[ind] == 0){
            ind++;
            continue;
        }
        ret = ret * 2 + A[ind + 1];
        ind += 2;
    }
    return ret;
}
# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 712 KB Wrong Answer [1]
2 Incorrect 4 ms 768 KB Wrong Answer [1]
3 Incorrect 4 ms 896 KB Wrong Answer [1]
4 Incorrect 4 ms 768 KB Wrong Answer [1]
5 Incorrect 4 ms 768 KB Wrong Answer [1]
6 Incorrect 4 ms 896 KB Wrong Answer [1]
7 Incorrect 4 ms 896 KB Wrong Answer [1]
8 Incorrect 4 ms 784 KB Wrong Answer [1]
9 Incorrect 4 ms 904 KB Wrong Answer [1]
10 Incorrect 4 ms 756 KB Wrong Answer [1]
11 Incorrect 4 ms 876 KB Wrong Answer [1]
12 Incorrect 4 ms 896 KB Wrong Answer [1]
13 Incorrect 4 ms 896 KB Wrong Answer [1]
14 Incorrect 4 ms 896 KB Wrong Answer [1]
15 Incorrect 4 ms 904 KB Wrong Answer [1]
16 Incorrect 4 ms 768 KB Wrong Answer [1]
17 Incorrect 4 ms 896 KB Wrong Answer [1]
18 Incorrect 4 ms 912 KB Wrong Answer [1]
19 Incorrect 4 ms 648 KB Wrong Answer [1]
20 Incorrect 4 ms 768 KB Wrong Answer [1]
21 Incorrect 4 ms 896 KB Wrong Answer [1]
22 Incorrect 4 ms 784 KB Wrong Answer [1]
23 Incorrect 4 ms 844 KB Wrong Answer [1]
24 Incorrect 4 ms 896 KB Wrong Answer [1]
25 Incorrect 4 ms 896 KB Wrong Answer [1]
26 Incorrect 4 ms 768 KB Wrong Answer [1]
27 Incorrect 4 ms 912 KB Wrong Answer [1]
28 Incorrect 4 ms 904 KB Wrong Answer [1]
29 Incorrect 4 ms 768 KB Wrong Answer [1]
30 Incorrect 4 ms 896 KB Wrong Answer [1]
31 Incorrect 4 ms 876 KB Wrong Answer [1]
32 Incorrect 4 ms 896 KB Wrong Answer [1]
33 Incorrect 4 ms 776 KB Wrong Answer [1]
34 Incorrect 4 ms 776 KB Wrong Answer [1]
35 Incorrect 4 ms 896 KB Wrong Answer [1]
36 Incorrect 4 ms 784 KB Wrong Answer [1]
37 Incorrect 4 ms 768 KB Wrong Answer [1]
38 Incorrect 4 ms 768 KB Wrong Answer [1]
39 Incorrect 4 ms 900 KB Wrong Answer [1]
40 Incorrect 4 ms 896 KB Wrong Answer [1]