oj.uz

Submission #260305

# Submission time Handle Problem Language Result Execution time Memory
260305 2020-08-10T04:56:45 Z 반딧불(#5056) Broken Device (JOI17_broken_device) C++14
0 / 100
 52 ms 3328 KB 
#include <bits/stdc++.h>
#include "Annalib.h"

using namespace std;

typedef long long ll;

namespace A{
    int n, k;
    ll x;
    bool broken[152];
};
using namespace A;

void Anna(int N, ll X, int K, int P[]){
    n = N, k = K, x = X;
    for(int i=0; i<k; i++) broken[P[i]] = 1;

    int prv = 0, cnt = 0;
    for(int i=0; i<n; i++){
        if(cnt == 60){
            Set(i, 1);
            continue;
        }
        if(P[i]){
            Set(i, 0);
            continue;
        }
        if((prv ^ !!(x & (1<<cnt)) ^ (i&1)) == 0) Set(i, 1), prv = ((i&1) ^ !!(x & (1<<cnt))), cnt++;
        else Set(i, 0);
    }
}

#include <bits/stdc++.h>
#include "Brunolib.h"

using namespace std;

typedef long long ll;

namespace B{
    int n;
};
using namespace B;

ll Bruno(int N, int A[]){
    n = N;
    vector<int> vec;
    for(int i=0; i<n; i++) if(A[i]) vec.push_back(i);

    ll prv = 0;
    ll ret = 0;
    for(int i=0; i<(int)vec.size(); i++){
        ret += (1<<i) * ((i - prv) % 2 == 0 ? 1 : 0);
    }
    return ret;
}

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 45 ms 3056 KB Output isn't correct - L* = 0
2 Partially correct 43 ms 3024 KB Output isn't correct - L* = 0
3 Partially correct 48 ms 3072 KB Output isn't correct - L* = 0
4 Partially correct 43 ms 3072 KB Output isn't correct - L* = 0
5 Partially correct 43 ms 3072 KB Output isn't correct - L* = 0
6 Partially correct 44 ms 3072 KB Output isn't correct - L* = 0
7 Partially correct 44 ms 3072 KB Output isn't correct - L* = 0
8 Partially correct 41 ms 3056 KB Output isn't correct - L* = 0
9 Partially correct 44 ms 3072 KB Output isn't correct - L* = 0
10 Partially correct 43 ms 3056 KB Output isn't correct - L* = 0
11 Partially correct 43 ms 3072 KB Output isn't correct - L* = 0
12 Partially correct 44 ms 3056 KB Output isn't correct - L* = 0
13 Partially correct 46 ms 3056 KB Output isn't correct - L* = 0
14 Partially correct 52 ms 3056 KB Output isn't correct - L* = 0
15 Partially correct 45 ms 3072 KB Output isn't correct - L* = 0
16 Partially correct 43 ms 3072 KB Output isn't correct - L* = 0
17 Partially correct 52 ms 3056 KB Output isn't correct - L* = 0
18 Partially correct 50 ms 3152 KB Output isn't correct - L* = 0
19 Partially correct 48 ms 3072 KB Output isn't correct - L* = 0
20 Partially correct 47 ms 2976 KB Output isn't correct - L* = 0
21 Partially correct 43 ms 3320 KB Output isn't correct - L* = 0
22 Partially correct 46 ms 3136 KB Output isn't correct - L* = 0
23 Partially correct 43 ms 3072 KB Output isn't correct - L* = 0
24 Partially correct 43 ms 3056 KB Output isn't correct - L* = 0
25 Partially correct 43 ms 3072 KB Output isn't correct - L* = 0
26 Partially correct 43 ms 3072 KB Output isn't correct - L* = 0
27 Partially correct 43 ms 3072 KB Output isn't correct - L* = 0
28 Partially correct 43 ms 3328 KB Output isn't correct - L* = 0
29 Partially correct 43 ms 3056 KB Output isn't correct - L* = 0
30 Partially correct 44 ms 3072 KB Output isn't correct - L* = 0
31 Partially correct 41 ms 3072 KB Output isn't correct - L* = 0
32 Partially correct 41 ms 3072 KB Output isn't correct - L* = 0
33 Partially correct 43 ms 3056 KB Output isn't correct - L* = 0
34 Partially correct 44 ms 3072 KB Output isn't correct - L* = 0
35 Partially correct 43 ms 3056 KB Output isn't correct - L* = 0
36 Partially correct 44 ms 3056 KB Output isn't correct - L* = 0
37 Partially correct 43 ms 3072 KB Output isn't correct - L* = 0
38 Partially correct 41 ms 3072 KB Output isn't correct - L* = 0
39 Partially correct 50 ms 3328 KB Output isn't correct - L* = 0
40 Partially correct 43 ms 3072 KB Output isn't correct - L* = 0