oj.uz

답안 #126508

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
126508 2019-07-08T02:04:51 Z briansu Broken Device (JOI17_broken_device) C++14
41 / 100
 43 ms 3312 KB 
#include "Annalib.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for(int i = 0;i < n;i ++)

void Anna( int N, long long X, int K, int P[] ){
  vector<ll> v(N, 1);
  REP(i, K)v[P[i]] = 0;
  ll ct = 0;
  ll x = X;
  vector<ll> d(N, 0);
  REP(i, N)
  {
  	if(ct == 61 || i == N-1)d[i] = 0;
  	else if(!(x & 1) && v[i])d[i] = 1, d[i + 1] = 0, i ++, ct ++, x /= 2;
  	else if(v[i] && v[i + 1])d[i] = 1, d[i + 1] = 1, i ++, ct ++, x /= 2;
  	else d[i] = 0;
  }
  if(ct != 61)
  {
  	ct = 0, x = X;
  	REP(i, N)
	  {
	  	if(ct == 61 || i == N-1)d[i] = 0;
	  	else if((x & 1) && v[i])d[i] = 1, d[i + 1] = 0, i ++, ct ++, x /= 2;
	  	else if(v[i] && v[i + 1])d[i] = 1, d[i + 1] = 1, i ++, ct ++, x /= 2;
	  	else d[i] = 0;
	  }
  }
  REP(i, N)Set(i, d[i]);
}

#include "Brunolib.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for(int i = 0;i < n;i ++)

long long Bruno( int N, int A[] ){
  ll n = N;
  ll tt = 0, t = 1;
  REP(i, n)if(A[i])tt += t * A[i + 1], t *= 2, i ++;
  if(tt & (1LL<<60))tt ^= ((1LL<<61) - 1);
  return tt;
}

Subtask #1
41.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 39 ms 3056 KB Output is partially correct - L* = 15
2 Partially correct 40 ms 3056 KB Output is partially correct - L* = 15
3 Partially correct 39 ms 3056 KB Output is partially correct - L* = 19
4 Partially correct 39 ms 3056 KB Output is partially correct - L* = 16
5 Partially correct 39 ms 3056 KB Output is partially correct - L* = 17
6 Partially correct 39 ms 3056 KB Output is partially correct - L* = 15
7 Partially correct 39 ms 3056 KB Output is partially correct - L* = 18
8 Partially correct 39 ms 2864 KB Output is partially correct - L* = 18
9 Partially correct 40 ms 3000 KB Output is partially correct - L* = 18
10 Partially correct 39 ms 3056 KB Output is partially correct - L* = 16
11 Partially correct 39 ms 3056 KB Output is partially correct - L* = 19
12 Partially correct 41 ms 3056 KB Output is partially correct - L* = 22
13 Partially correct 39 ms 3056 KB Output is partially correct - L* = 18
14 Partially correct 39 ms 3056 KB Output is partially correct - L* = 15
15 Partially correct 39 ms 3056 KB Output is partially correct - L* = 16
16 Partially correct 39 ms 3056 KB Output is partially correct - L* = 19
17 Partially correct 41 ms 3312 KB Output is partially correct - L* = 20
18 Partially correct 39 ms 3056 KB Output is partially correct - L* = 16
19 Partially correct 39 ms 3056 KB Output is partially correct - L* = 18
20 Partially correct 40 ms 3056 KB Output is partially correct - L* = 15
21 Partially correct 40 ms 3000 KB Output is partially correct - L* = 15
22 Partially correct 40 ms 3056 KB Output is partially correct - L* = 16
23 Partially correct 40 ms 3056 KB Output is partially correct - L* = 15
24 Partially correct 40 ms 3056 KB Output is partially correct - L* = 17
25 Partially correct 41 ms 3056 KB Output is partially correct - L* = 15
26 Partially correct 40 ms 3056 KB Output is partially correct - L* = 16
27 Partially correct 41 ms 3056 KB Output is partially correct - L* = 15
28 Partially correct 39 ms 3056 KB Output is partially correct - L* = 15
29 Partially correct 40 ms 3056 KB Output is partially correct - L* = 16
30 Partially correct 39 ms 3056 KB Output is partially correct - L* = 15
31 Partially correct 39 ms 3056 KB Output is partially correct - L* = 17
32 Partially correct 40 ms 3056 KB Output is partially correct - L* = 18
33 Partially correct 40 ms 3056 KB Output is partially correct - L* = 18
34 Partially correct 43 ms 3056 KB Output is partially correct - L* = 16
35 Partially correct 39 ms 3056 KB Output is partially correct - L* = 15
36 Partially correct 40 ms 3056 KB Output is partially correct - L* = 15
37 Partially correct 43 ms 3056 KB Output is partially correct - L* = 16
38 Partially correct 41 ms 3056 KB Output is partially correct - L* = 18
39 Partially correct 40 ms 3056 KB Output is partially correct - L* = 17
40 Partially correct 41 ms 3056 KB Output is partially correct - L* = 15