oj.uz

답안 #260532

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
260532 2020-08-10T13:27:09 Z sjimed Broken Device (JOI17_broken_device) C++14
0 / 100
 64 ms 3568 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[] ){
  int chk[222] = {};
  for(int i=0; i<K; i++) {
    chk[P[i]] = 1;
  }
  
  for(int i=0, j=0; i<N; i+=3) {
    if(chk[i] + chk[i+1] + chk[i+2] == 0) {
      if(((X >> j) & 3LL) == 3) chk[i] = chk[i+1] = chk[i+2] = 1;
      if(((X >> j) & 3LL) == 2) chk[i] = 1, chk[i+1] = 0, chk[i+2] = 1;
      if(((X >> j) & 3LL) == 1) chk[i] = 0, chk[i+1] = 1, chk[i+2] = 0;
      if(((X >> j) & 3LL) == 0) chk[i] = 0, chk[i+1] = chk[i+2] = 1;
      j += 2;
    }
    else if(chk[i] + chk[i+1] + chk[i+2] == 1) {
      if(chk[i]) {
        if((X >> j) & 1LL) chk[i] = chk[i+1] = 0, chk[i+2] = 1;
        else if((X >> j+1) & 1LL)  chk[i] = 0, chk[i+1] = 1, chk[i+2] = 0, j++;
        else chk[i] = 0, chk[i+1] = chk[i+2] = 1, j++;

        j++;
      }
      else if(chk[i+1]) {
        if((X >> j) & 1LL) chk[i] = chk[i+1] = 0, chk[i+2] = 1;
        else chk[i] = 1, chk[i+1] = chk[i+2] = 0;

        j++;
      }
      else {
        if((X >> j) & 1LL) chk[i] = chk[i+1] = 1, chk[i+2] = 0;
        else chk[i] = 1, chk[i+1] = chk[i+2] = 0;

        j++;
      }
    }
    else chk[i] = chk[i+1] = chk[i+2] = 0;
  }

  for(int i=0; i<N; i++) Set(i, chk[i]);
}

#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; i+=3) {
    int x = A[i]*4 + A[i+1]*2 + A[i+2];

    if(x == 7) ans |= 3LL << j, j+=2;
    else if(x == 5) ans |= 2LL << j, j+=2;
    else if(x == 2) ans |= 1LL << j, j+=2;
    else if(x == 3) j+=2;
    else if(x == 4) j++;
    else if(x == 1 || x == 6) ans |= 1LL << j, j++;
  }

  return ans;
}

Compilation message

Anna.cpp: In function 'void Anna(int, long long int, int, int*)':
Anna.cpp:30:24: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
         else if((X >> j+1) & 1LL)  chk[i] = 0, chk[i+1] = 1, chk[i+2] = 0, j++;
                       ~^~

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 45 ms 3312 KB Output isn't correct - L* = 0
2 Partially correct 48 ms 3312 KB Output isn't correct - L* = 0
3 Partially correct 50 ms 3312 KB Output isn't correct - L* = 0
4 Partially correct 45 ms 3312 KB Output isn't correct - L* = 0
5 Partially correct 45 ms 3312 KB Output isn't correct - L* = 0
6 Partially correct 44 ms 3328 KB Output isn't correct - L* = 0
7 Partially correct 47 ms 3312 KB Output isn't correct - L* = 0
8 Partially correct 44 ms 3312 KB Output isn't correct - L* = 0
9 Partially correct 44 ms 3312 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 3312 KB Output isn't correct - L* = 0
12 Partially correct 46 ms 3312 KB Output isn't correct - L* = 0
13 Partially correct 44 ms 3328 KB Output isn't correct - L* = 0
14 Partially correct 47 ms 3312 KB Output isn't correct - L* = 0
15 Partially correct 53 ms 3328 KB Output isn't correct - L* = 0
16 Partially correct 48 ms 3312 KB Output isn't correct - L* = 0
17 Partially correct 48 ms 3568 KB Output isn't correct - L* = 0
18 Partially correct 45 ms 3328 KB Output isn't correct - L* = 0
19 Partially correct 53 ms 3312 KB Output isn't correct - L* = 0
20 Partially correct 49 ms 3312 KB Output isn't correct - L* = 0
21 Partially correct 45 ms 3312 KB Output isn't correct - L* = 0
22 Partially correct 45 ms 3320 KB Output isn't correct - L* = 0
23 Partially correct 44 ms 3328 KB Output isn't correct - L* = 0
24 Partially correct 45 ms 3328 KB Output isn't correct - L* = 0
25 Partially correct 44 ms 3312 KB Output isn't correct - L* = 0
26 Partially correct 45 ms 3312 KB Output isn't correct - L* = 0
27 Partially correct 44 ms 3312 KB Output isn't correct - L* = 0
28 Partially correct 44 ms 3232 KB Output isn't correct - L* = 0
29 Partially correct 44 ms 3312 KB Output isn't correct - L* = 0
30 Partially correct 64 ms 3312 KB Output isn't correct - L* = 0
31 Partially correct 49 ms 3312 KB Output isn't correct - L* = 0
32 Partially correct 55 ms 3312 KB Output isn't correct - L* = 0
33 Partially correct 47 ms 3320 KB Output isn't correct - L* = 0
34 Partially correct 44 ms 3328 KB Output isn't correct - L* = 0
35 Partially correct 45 ms 3312 KB Output isn't correct - L* = 0
36 Partially correct 45 ms 3312 KB Output isn't correct - L* = 0
37 Partially correct 45 ms 3328 KB Output isn't correct - L* = 0
38 Partially correct 45 ms 3328 KB Output isn't correct - L* = 0
39 Partially correct 44 ms 3328 KB Output isn't correct - L* = 0
40 Partially correct 45 ms 3312 KB Output isn't correct - L* = 0