oj.uz

답안 #231498

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
231498 2020-05-13T20:07:17 Z cstuart Broken Device (JOI17_broken_device) C++17
0 / 100
 51 ms 3840 KB 
#include <bits/stdc++.h>
using namespace std;
#include "Annalib.h"

void Anna (int N, long long X, int K, int P[]) {
  
  bool     func[N+5];
  int      b = 0;
  string   rep = "011010010010111010101011010001";
  
  memset(func, 1, sizeof func);
  for (int i = 0; i < K; i++) func[P[i]] = 0;
  
  for (int i = 0; i < N; i++) {
    if (b == 60) Set(i, 0);
    else if (((1ll << b) & X) == 0 && rep[i % (int)rep.length()] == '1') Set(i, 0);
    else if (((1ll << b) & X) > 0  && rep[i % (int)rep.length()] == '0') Set(i, 0);
    else {
      Set(i, 1);
      b++;
    }
  }
  
}
#include <bits/stdc++.h>
using namespace std;
#include "Brunolib.h"

long long Bruno (int N, int A[]) {
  
  string     rep = "011010010010111010101011010001";
  long long  V = 0;
  int        b = 0;
  
  for (int i = 0; i < N; i++) {
    if (A[i] == 1) {
      V += (1ll << b);
      b++;
    }
  }
  
  return V;
}

Subtask #1
0.0 / 100.0

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