oj.uz

Submission #260350

# Submission time Handle Problem Language Result Execution time Memory
260350 2020-08-10T06:24:03 Z 임성재(#5050) Broken Device (JOI17_broken_device) C++14
0 / 100
 52 ms 3584 KB 
#include "Annalib.h"
#include<bits/stdc++.h>
using namespace std;

#define fast ios::sync_with_stdio(false); cin.tie(0);
#define fi first
#define se second
#define em emplace
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define mp make_pair

void Anna( int N, long long X, int K, int P[] ){
  bool chk[222];
  for(int i=0; i<K; i++) {
    chk[P[i]/2] = true;
  }
  
  for(int i=0, j = 0; i<N/2; i++, j++) {
    if(chk[i]) Set(i*2, 0), Set(i*2+1, 0), j--;
    else if(X & (1LL << j)) Set(i*2, 1), Set(i*2+1, 1);
    else Set(i*2, 0), Set(i*2+1, 1);
  }
}

#include "Brunolib.h"
#include<bits/stdc++.h>
using namespace std;

#define fast ios::sync_with_stdio(false); cin.tie(0);
#define fi first
#define se second
#define em emplace
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define mp make_pair

typedef long long ll;

long long Bruno( int N, int A[] ){
  ll ans = 0;
  for(int i=0, j = 0; i<N/2; i++) {
    if(!A[i*2+1]) continue;
    if(A[i*2]) ans |= 1LL << j;
    
    j++;
  }

  return ans;
}

Subtask #1
0.0 / 100.0

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