oj.uz

답안 #97557

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
97557 2019-02-17T03:43:08 Z silxikys Broken Device (JOI17_broken_device) C++14
0 / 100
 70 ms 3312 KB 
#include "Annalib.h"
#include <vector>

void Anna(int N, long long X, int K, int P[]) {
    int pos = 0;
    std::vector<int> ans(N,-1);
    for (int i = 0; i < K; i++) {
        ans[P[i]] = 0;
    }
    for (int i = 0; i < N; i += 2) {
        if (ans[i] == 0 || ans[i+1] == 0) {
            ans[i] = 0;
            ans[i+1] = 0;
        }
        else {
            if (pos > 61) {
                ans[i] = 0;
                ans[i+1] = 0;
                continue;
            }
            int b = ((1LL<<pos) & X);
            if (b == 0) {
                ans[i] = 0;
                ans[i+1] = 1;
            }
            else {
                ans[i] = 1;
                ans[i+1] = 1;
            }
            pos++;
        }
    }
    for (int i = 0; i < N; i++) {
        //assert(ans[i] == 0 || ans[i] == 1);
        Set(i,ans[i]);            
    }
}

#include "Brunolib.h"
#include <vector>

long long Bruno(int N, int A[]) {
    std::vector<int> ans;
    for (int i = 0; i < N; i += 2) {
        int r = A[i] * 2 + A[i+1];
        if (r == 0) continue;
        else if (r == 1) {
            ans.push_back(0);
        }
        else {
            ans.push_back(1);
        }
    }
    long long res = 0;
    for (int i = 0; i < ans.size(); i++) {
        if (ans[i] == 1) {
            res += (1LL<<i);
        }
    }
    return res;
}

Compilation message

Bruno.cpp: In function 'long long int Bruno(int, int*)':
Bruno.cpp:17:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < ans.size(); i++) {
                     ~~^~~~~~~~~~~~

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 64 ms 3056 KB Output isn't correct - L* = 0
2 Incorrect 53 ms 3072 KB Output isn't correct - L* = 0
3 Incorrect 67 ms 3056 KB Output isn't correct - L* = 0
4 Incorrect 66 ms 3056 KB Output isn't correct - L* = 0
5 Incorrect 60 ms 3056 KB Output isn't correct - L* = 0
6 Incorrect 43 ms 2912 KB Output isn't correct - L* = 0
7 Incorrect 47 ms 3056 KB Output isn't correct - L* = 0
8 Incorrect 45 ms 3064 KB Output isn't correct - L* = 0
9 Incorrect 58 ms 2936 KB Output isn't correct - L* = 0
10 Incorrect 52 ms 2800 KB Output isn't correct - L* = 0
11 Incorrect 44 ms 2800 KB Output isn't correct - L* = 0
12 Incorrect 47 ms 2800 KB Output isn't correct - L* = 0
13 Incorrect 52 ms 2864 KB Output isn't correct - L* = 0
14 Incorrect 52 ms 2800 KB Output isn't correct - L* = 0
15 Incorrect 69 ms 3056 KB Output isn't correct - L* = 0
16 Incorrect 49 ms 3056 KB Output isn't correct - L* = 0
17 Incorrect 56 ms 3056 KB Output isn't correct - L* = 0
18 Incorrect 60 ms 3056 KB Output isn't correct - L* = 0
19 Incorrect 64 ms 2800 KB Output isn't correct - L* = 0
20 Incorrect 55 ms 3056 KB Output isn't correct - L* = 0
21 Incorrect 54 ms 2800 KB Output isn't correct - L* = 0
22 Incorrect 70 ms 3056 KB Output isn't correct - L* = 0
23 Incorrect 58 ms 2800 KB Output isn't correct - L* = 0
24 Incorrect 41 ms 3072 KB Output isn't correct - L* = 0
25 Incorrect 41 ms 2816 KB Output isn't correct - L* = 0
26 Incorrect 51 ms 3072 KB Output isn't correct - L* = 0
27 Incorrect 51 ms 2800 KB Output isn't correct - L* = 0
28 Incorrect 44 ms 3072 KB Output isn't correct - L* = 0
29 Incorrect 50 ms 2976 KB Output isn't correct - L* = 0
30 Incorrect 53 ms 2800 KB Output isn't correct - L* = 0
31 Incorrect 64 ms 2960 KB Output isn't correct - L* = 0
32 Incorrect 51 ms 3056 KB Output isn't correct - L* = 0
33 Incorrect 51 ms 2816 KB Output isn't correct - L* = 0
34 Incorrect 52 ms 3072 KB Output isn't correct - L* = 0
35 Incorrect 45 ms 2816 KB Output isn't correct - L* = 0
36 Incorrect 57 ms 3056 KB Output isn't correct - L* = 0
37 Incorrect 48 ms 3312 KB Output isn't correct - L* = 0
38 Incorrect 60 ms 3072 KB Output isn't correct - L* = 0
39 Incorrect 44 ms 3056 KB Output isn't correct - L* = 0
40 Incorrect 40 ms 3144 KB Output isn't correct - L* = 0