oj.uz

답안 #70392

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
70392 2018-08-22T19:12:35 Z Just_Solve_The_Problem Broken Device (JOI17_broken_device) C++11
0 / 100
 87 ms 4064 KB 
#include <bits/stdc++.h>
#include "Annalib.h"
//#include "grader.cpp"

#define pb push_back

using namespace std;

void Anna( int N, long long X, int K, int P[] ){
  vector < int > used(N, 0);
  vector < int > u(N, 0);
  for (int i = 0; i < K; i++) {
    used[P[i]] = 1;
  }
  for (int i = 0; i < N; i += 3) {
    if (used[i] + used[i + 1] + used[i + 2] >= 2) continue;
    if (used[i] + used[i + 1] + used[i + 2] == 1) {
      if (X % 2 == 0) {
        if (used[i]) {
          u[i + 2] = 1;
        } else if (used[i + 1]) {
          u[i + 2] = 1;
        } else {
          u[i] = u[i + 1] = 1;
        }
      } else {
        if (used[i]) {
          if (X % 4 == 1) {
            u[i + 1] = 1;
          } else {
            u[i + 1] = u[i + 2] = 1;
          }
          X /= 2;
        }
        if (used[i + 1]) {
          u[i] = 1;
        }
        if (used[i + 2]) {
          u[i] = 1;
        }
      }
      X /= 2;
    } else {
      u[i] = u[i + 1] = u[i + 2] = 1;
      if (X % 4 == 1) u[i] = u[i + 2] = 0;
      else if (X % 4 == 2) u[i + 1] = 0;
      else if (X % 4 == 3) u[i] = 0;
      X /= 4;
    }
  }
  for (int i = 0; i < N; i++) {
    Set(i, u[i]);
  }
}
/*
7 = (3, 4)
6 = (2, 4)
5 = (1, 4)
4 = (0, 4)
3 = (1, 2)
2 = (0, 2)
1 = (0, 2)
0 = (1, 2)
*/

#include <bits/stdc++.h>
#include "Brunolib.h"
//#include "grader.cpp"

#define ll long long
#define pb push_back

using namespace std;

pair < int, int > get(int x, int y, int z) {
  int t = x * 4 + y * 2 + z;
  if (t == 0) return {0, 1};
  if (t == 1) return {0, 2};
  if (t == 2) return {1, 4};
  if (t == 3) return {3, 4};
  if (t == 4) return {1, 2};
  if (t == 5) return {1, 4};
  if (t == 6) return {2, 4};
  if (t == 7) return {0, 4};
}

long long Bruno( int N, int A[] ){
  ll ret = 0;
  for (int i = N - 3; i >= 0; i -= 3) {
    ret = ret * get(A[i], A[i + 1], A[i + 2]).second + get(A[i], A[i + 1], A[i + 2]).first;
  }
  return ret;
}

Compilation message

Bruno.cpp: In function 'std::pair<int, int> get(int, int, int)':
Bruno.cpp:20:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 47 ms 2800 KB Output isn't correct - L* = 0
2 Incorrect 41 ms 3632 KB Output isn't correct - L* = 0
3 Incorrect 45 ms 3632 KB Output isn't correct - L* = 0
4 Incorrect 41 ms 3632 KB Output isn't correct - L* = 0
5 Incorrect 40 ms 3632 KB Output isn't correct - L* = 0
6 Incorrect 64 ms 3632 KB Output isn't correct - L* = 0
7 Incorrect 62 ms 3632 KB Output isn't correct - L* = 0
8 Incorrect 70 ms 3656 KB Output isn't correct - L* = 0
9 Incorrect 45 ms 3792 KB Output isn't correct - L* = 0
10 Incorrect 43 ms 3792 KB Output isn't correct - L* = 0
11 Incorrect 49 ms 3792 KB Output isn't correct - L* = 0
12 Incorrect 44 ms 3792 KB Output isn't correct - L* = 0
13 Incorrect 57 ms 3792 KB Output isn't correct - L* = 0
14 Incorrect 52 ms 3808 KB Output isn't correct - L* = 0
15 Incorrect 79 ms 4032 KB Output isn't correct - L* = 0
16 Incorrect 59 ms 4032 KB Output isn't correct - L* = 0
17 Incorrect 46 ms 4032 KB Output isn't correct - L* = 0
18 Incorrect 50 ms 4032 KB Output isn't correct - L* = 0
19 Incorrect 50 ms 4056 KB Output isn't correct - L* = 0
20 Incorrect 87 ms 4064 KB Output isn't correct - L* = 0
21 Incorrect 46 ms 4064 KB Output isn't correct - L* = 0
22 Incorrect 47 ms 4064 KB Output isn't correct - L* = 0
23 Incorrect 41 ms 4064 KB Output isn't correct - L* = 0
24 Incorrect 41 ms 4064 KB Output isn't correct - L* = 0
25 Incorrect 41 ms 4064 KB Output isn't correct - L* = 0
26 Incorrect 67 ms 4064 KB Output isn't correct - L* = 0
27 Incorrect 46 ms 4064 KB Output isn't correct - L* = 0
28 Incorrect 43 ms 4064 KB Output isn't correct - L* = 0
29 Incorrect 52 ms 4064 KB Output isn't correct - L* = 0
30 Incorrect 63 ms 4064 KB Output isn't correct - L* = 0
31 Incorrect 82 ms 4064 KB Output isn't correct - L* = 0
32 Incorrect 59 ms 4064 KB Output isn't correct - L* = 0
33 Incorrect 59 ms 4064 KB Output isn't correct - L* = 0
34 Incorrect 43 ms 4064 KB Output isn't correct - L* = 0
35 Incorrect 43 ms 4064 KB Output isn't correct - L* = 0
36 Incorrect 40 ms 4064 KB Output isn't correct - L* = 0
37 Incorrect 41 ms 4064 KB Output isn't correct - L* = 0
38 Incorrect 49 ms 4064 KB Output isn't correct - L* = 0
39 Incorrect 43 ms 4064 KB Output isn't correct - L* = 0
40 Incorrect 47 ms 4064 KB Output isn't correct - L* = 0