oj.uz

Submission #295113

# Submission time Handle Problem Language Result Execution time Memory
295113 2020-09-09T13:31:04 Z BThero Broken Device (JOI17_broken_device) C++17
41 / 100
 64 ms 3328 KB 
// chrono::system_clock::now().time_since_epoch().count()
#include "Annalib.h"
#include<bits/stdc++.h>

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define debug(x) cerr << #x << " = " << x << endl;

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

namespace {
  int n, k, bad_pos[45];
  int is_bad[205];
  ll msg;
  
  int bit(ll x, int p) {
    if (p > 60) return 0;
    return (x >> p) & 1;
  }
  
  void set(int p, int x) {
    if (p < n) {
      Set(p, x);
    }
  }
  
  void solve() {
    fill(is_bad, is_bad + n, 0);
  
    for (int i = 0; i < k; ++i) {
      is_bad[bad_pos[i]] = 1;
    }
    
    int p = 0;
    
    for (int i = 0; i < n; i += 2) {
      if (is_bad[i] && is_bad[i + 1]) {
        Set(i, 0);
        Set(i + 1, 0);
        continue;
      }
      
      if (bit(msg, p) == 0 && !is_bad[i + 1]) {
        Set(i, 0);
        Set(i + 1, 1);
        p++;
        continue;
      }
      
      if (bit(msg, p) == 1 && !is_bad[i]) {
        Set(i, 1);
        Set(i + 1, 0);
        p++;
        continue;
      }
      
      Set(i, 0);
      Set(i + 1, 0);
    }
  }
};

void Anna( int N, long long X, int K, int P[] ){
  n = N;
  msg = X;
  k = K;
  
  for (int i = 0; i < k; ++i) {
    bad_pos[i] = P[i];
  }

  solve();
}

// chrono::system_clock::now().time_since_epoch().count()
#include "Brunolib.h"
#include<bits/stdc++.h>

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define debug(x) cerr << #x << " = " << x << endl;

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

namespace {
  int n, arr[205];
  
  ll solve() {
    ll ret = 0;    
    int p = 0;
    
    for (int i = 0; i < n; i += 2) {
      if (arr[i] == 0 && arr[i + 1] == 0) {
        continue;
      }
      
      if (arr[i] == 1 && arr[i + 1] == 0) {
        ret += (1ll << p);
      }
      
      p++;
    }
    
    return ret;
  }
};

long long Bruno( int N, int A[] ){
  n = N;
  
  for (int i = 0; i < n; ++i) {
    arr[i] = A[i];
  }

  return solve();
}

Compilation message

Anna.cpp:28:8: warning: 'void {anonymous}::set(int, int)' defined but not used [-Wunused-function]
   28 |   void set(int p, int x) {
      |        ^~~

Subtask #1
41.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 56 ms 3056 KB Output is partially correct - L* = 17
2 Partially correct 55 ms 3328 KB Output is partially correct - L* = 16
3 Partially correct 53 ms 3056 KB Output is partially correct - L* = 18
4 Partially correct 51 ms 3056 KB Output is partially correct - L* = 17
5 Partially correct 46 ms 3072 KB Output is partially correct - L* = 17
6 Partially correct 52 ms 3056 KB Output is partially correct - L* = 20
7 Partially correct 55 ms 3056 KB Output is partially correct - L* = 18
8 Partially correct 46 ms 3072 KB Output is partially correct - L* = 18
9 Partially correct 49 ms 3072 KB Output is partially correct - L* = 18
10 Partially correct 48 ms 3072 KB Output is partially correct - L* = 16
11 Partially correct 46 ms 3024 KB Output is partially correct - L* = 17
12 Partially correct 46 ms 3072 KB Output is partially correct - L* = 22
13 Partially correct 47 ms 3064 KB Output is partially correct - L* = 18
14 Partially correct 47 ms 3072 KB Output is partially correct - L* = 18
15 Partially correct 49 ms 3064 KB Output is partially correct - L* = 16
16 Partially correct 55 ms 3056 KB Output is partially correct - L* = 17
17 Partially correct 50 ms 3072 KB Output is partially correct - L* = 22
18 Partially correct 45 ms 3056 KB Output is partially correct - L* = 16
19 Partially correct 57 ms 3056 KB Output is partially correct - L* = 18
20 Partially correct 45 ms 3056 KB Output is partially correct - L* = 18
21 Partially correct 64 ms 3056 KB Output is partially correct - L* = 15
22 Partially correct 60 ms 3056 KB Output is partially correct - L* = 16
23 Partially correct 46 ms 3072 KB Output is partially correct - L* = 18
24 Partially correct 47 ms 3072 KB Output is partially correct - L* = 17
25 Partially correct 48 ms 3072 KB Output is partially correct - L* = 21
26 Partially correct 45 ms 3056 KB Output is partially correct - L* = 16
27 Partially correct 51 ms 3072 KB Output is partially correct - L* = 15
28 Partially correct 46 ms 3056 KB Output is partially correct - L* = 16
29 Partially correct 49 ms 3056 KB Output is partially correct - L* = 16
30 Partially correct 62 ms 3072 KB Output is partially correct - L* = 21
31 Partially correct 54 ms 2984 KB Output is partially correct - L* = 16
32 Partially correct 51 ms 3096 KB Output is partially correct - L* = 18
33 Partially correct 46 ms 3056 KB Output is partially correct - L* = 17
34 Partially correct 45 ms 3056 KB Output is partially correct - L* = 18
35 Partially correct 48 ms 3056 KB Output is partially correct - L* = 15
36 Partially correct 48 ms 3072 KB Output is partially correct - L* = 20
37 Partially correct 56 ms 3072 KB Output is partially correct - L* = 16
38 Partially correct 51 ms 2968 KB Output is partially correct - L* = 18
39 Partially correct 54 ms 3072 KB Output is partially correct - L* = 17
40 Partially correct 48 ms 3056 KB Output is partially correct - L* = 15