oj.uz

답안 #295010

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
295010 2020-09-09T12:09:22 Z BThero Broken Device (JOI17_broken_device) C++17
0 / 100
 52 ms 3376 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[150];
  ll msg;
  
  int bit(ll x, int p) {
    if (p > 60) return 0;
    return (x >> p) & 1;
  }
  
  void solve() {
    assert(n % 2 == 0);
    fill(is_bad, is_bad + n, 0);
  
    for (int i = 0; i < k; ++i) {
      is_bad[bad_pos[i]] = 1;
    }
    
    int ptr = 0, i = 0;
    
    while (i < n) {
      if (is_bad[i]) {
        Set(i++, 0);
      }
      else {
        Set(i++, 1);
        
        if (i < n) {
          Set(i++, bit(msg, ptr++));
        }
      }
    }
  }
};

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[150];
  
  ll solve() {
    assert(n % 2 == 0);
    ll ret = 0;
    int ptr = 0, i = 0;
    
    while (i < n) {
      if (arr[i] == 0) {
        i++;
      }
      else {
        i++;
        
        if (i < n && arr[i]) {
          ret += (1ll << ptr++);
          i++;
        }
      }
    }
    
    return ret;
  }
};

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

  return solve();
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 45 ms 3320 KB Output isn't correct - L* = 0
2 Partially correct 45 ms 3328 KB Output isn't correct - L* = 0
3 Partially correct 47 ms 3328 KB Output isn't correct - L* = 0
4 Partially correct 47 ms 3312 KB Output isn't correct - L* = 0
5 Partially correct 45 ms 3328 KB Output isn't correct - L* = 0
6 Partially correct 45 ms 3328 KB Output isn't correct - L* = 0
7 Partially correct 46 ms 3312 KB Output isn't correct - L* = 0
8 Partially correct 45 ms 3312 KB Output isn't correct - L* = 0
9 Partially correct 46 ms 3328 KB Output isn't correct - L* = 0
10 Partially correct 47 ms 3312 KB Output isn't correct - L* = 0
11 Partially correct 46 ms 3328 KB Output isn't correct - L* = 0
12 Partially correct 48 ms 3312 KB Output isn't correct - L* = 0
13 Partially correct 47 ms 3328 KB Output isn't correct - L* = 0
14 Partially correct 47 ms 3328 KB Output isn't correct - L* = 0
15 Partially correct 46 ms 3328 KB Output isn't correct - L* = 0
16 Partially correct 46 ms 3328 KB Output isn't correct - L* = 0
17 Partially correct 46 ms 3312 KB Output isn't correct - L* = 0
18 Partially correct 46 ms 3328 KB Output isn't correct - L* = 0
19 Partially correct 47 ms 3328 KB Output isn't correct - L* = 0
20 Partially correct 46 ms 3328 KB Output isn't correct - L* = 0
21 Partially correct 45 ms 3112 KB Output isn't correct - L* = 0
22 Partially correct 48 ms 3328 KB Output isn't correct - L* = 0
23 Partially correct 47 ms 3312 KB Output isn't correct - L* = 0
24 Partially correct 47 ms 3312 KB Output isn't correct - L* = 0
25 Partially correct 46 ms 3328 KB Output isn't correct - L* = 0
26 Partially correct 48 ms 3312 KB Output isn't correct - L* = 0
27 Partially correct 47 ms 3208 KB Output isn't correct - L* = 0
28 Partially correct 48 ms 3328 KB Output isn't correct - L* = 0
29 Partially correct 48 ms 3312 KB Output isn't correct - L* = 0
30 Partially correct 46 ms 3136 KB Output isn't correct - L* = 0
31 Partially correct 47 ms 3312 KB Output isn't correct - L* = 0
32 Partially correct 46 ms 3376 KB Output isn't correct - L* = 0
33 Partially correct 49 ms 3312 KB Output isn't correct - L* = 0
34 Partially correct 46 ms 3328 KB Output isn't correct - L* = 0
35 Partially correct 49 ms 3312 KB Output isn't correct - L* = 0
36 Partially correct 47 ms 3312 KB Output isn't correct - L* = 0
37 Partially correct 46 ms 3312 KB Output isn't correct - L* = 0
38 Partially correct 52 ms 3328 KB Output isn't correct - L* = 0
39 Partially correct 47 ms 3312 KB Output isn't correct - L* = 0
40 Partially correct 46 ms 3328 KB Output isn't correct - L* = 0