oj.uz

답안 #68005

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
68005 2018-08-15T18:18:11 Z elitewantsyou Broken Device (JOI17_broken_device) C++14
0 / 100
 83 ms 3880 KB 
#include <bits/stdc++.h>
#include "Annalib.h"

using namespace std;

int gg[1111];

void Anna( int N, long long X, int K, int P[] )
{
        vector < int > v;
        for(int i = 0; i < K; i++){
                gg[P[i]] = 1;
        }
        for(int i = 0; i < N; i += 2){
                if(gg[i] == 0 && gg[i + 1] == 0){
                        v.push_back(i);
                }
        }
        for(int i = 0; i < N; i++){
                gg[i] = 0;
        }
        for(int i = 0; i < min(61, (int)v.size()); i++){
                gg[v[i]] = 1;
                if(X & (1ll << i)){
                        gg[v[i] + 1] = 1;
                }
        }
        for(int i = 0; i < N; i++){
                Set(i, gg[i]);
        }
}

#include "Brunolib.h"

long long Bruno( int N, int A[] )
{
        long long X = 0;
        int c = 0, g = 0;
        for(int i = 0; i < N; i += 2){
                if(A[i]){
                        X += (1ll << g) * A[i + 1];
                        g++;
                }
        }
        return X;
}

Compilation message

Bruno.cpp: In function 'long long int Bruno(int, int*)':
Bruno.cpp:6:13: warning: unused variable 'c' [-Wunused-variable]
         int c = 0, g = 0;
             ^

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 46 ms 2800 KB Output isn't correct - L* = 0
2 Incorrect 45 ms 3176 KB Output isn't correct - L* = 0
3 Incorrect 62 ms 3448 KB Output isn't correct - L* = 0
4 Incorrect 46 ms 3584 KB Output isn't correct - L* = 0
5 Incorrect 49 ms 3584 KB Output isn't correct - L* = 0
6 Incorrect 50 ms 3584 KB Output isn't correct - L* = 0
7 Incorrect 47 ms 3600 KB Output isn't correct - L* = 0
8 Incorrect 54 ms 3600 KB Output isn't correct - L* = 0
9 Incorrect 56 ms 3864 KB Output isn't correct - L* = 0
10 Incorrect 49 ms 3864 KB Output isn't correct - L* = 0
11 Incorrect 51 ms 3864 KB Output isn't correct - L* = 0
12 Incorrect 47 ms 3864 KB Output isn't correct - L* = 0
13 Incorrect 61 ms 3864 KB Output isn't correct - L* = 0
14 Incorrect 51 ms 3864 KB Output isn't correct - L* = 0
15 Incorrect 46 ms 3864 KB Output isn't correct - L* = 0
16 Incorrect 50 ms 3864 KB Output isn't correct - L* = 0
17 Incorrect 47 ms 3864 KB Output isn't correct - L* = 0
18 Incorrect 44 ms 3864 KB Output isn't correct - L* = 0
19 Incorrect 50 ms 3864 KB Output isn't correct - L* = 0
20 Incorrect 46 ms 3864 KB Output isn't correct - L* = 0
21 Incorrect 73 ms 3864 KB Output isn't correct - L* = 0
22 Incorrect 48 ms 3864 KB Output isn't correct - L* = 0
23 Incorrect 49 ms 3864 KB Output isn't correct - L* = 0
24 Incorrect 83 ms 3864 KB Output isn't correct - L* = 0
25 Incorrect 48 ms 3880 KB Output isn't correct - L* = 0
26 Incorrect 47 ms 3880 KB Output isn't correct - L* = 0
27 Incorrect 44 ms 3880 KB Output isn't correct - L* = 0
28 Incorrect 47 ms 3880 KB Output isn't correct - L* = 0
29 Incorrect 46 ms 3880 KB Output isn't correct - L* = 0
30 Incorrect 47 ms 3880 KB Output isn't correct - L* = 0
31 Incorrect 46 ms 3880 KB Output isn't correct - L* = 0
32 Incorrect 49 ms 3880 KB Output isn't correct - L* = 0
33 Incorrect 47 ms 3880 KB Output isn't correct - L* = 0
34 Incorrect 51 ms 3880 KB Output isn't correct - L* = 0
35 Incorrect 61 ms 3880 KB Output isn't correct - L* = 0
36 Incorrect 48 ms 3880 KB Output isn't correct - L* = 0
37 Incorrect 45 ms 3880 KB Output isn't correct - L* = 0
38 Incorrect 43 ms 3880 KB Output isn't correct - L* = 0
39 Incorrect 47 ms 3880 KB Output isn't correct - L* = 0
40 Incorrect 51 ms 3880 KB Output isn't correct - L* = 0