oj.uz

Submission #232803

# Submission time Handle Problem Language Result Execution time Memory
232803 2020-05-18T08:18:51 Z AlexLuchianov Broken Device (JOI17_broken_device) C++14
0 / 100
 66 ms 3328 KB 
#include "Annalib.h"
#include <iostream>

using ll = long long;
  namespace Alice{
  int const nmax = 150;
  int const modulo = 1000000007;
  int const base = 13;
  int const rest = 7;


  int block[1 + nmax];
  int v[1 + nmax];

  int root;

  int myrand(){
    root = (1LL * root * base + rest) % modulo;
    return root;
  }

  void staticshuffle(int n){
    for(int i = 0; i < n; i++)
      v[i] = i;
    for(int i = 0; i < 3 * n; i++){
      int x = myrand() % n;
      int y = myrand() % n;

      std::swap(v[x], v[y]);
    }
  }
}
using namespace Alice;

void Anna( int n, long long X, int k, int P[] ){
  root = 1;
  staticshuffle(n);

  for(int i = 0; i < k; i++)
    block[P[i]] = 1;

  for(int i = 0; i < n; i += 2){
    if(X == 0 || block[v[i]] == 1 || block[v[i + 1]] == 1) {
      Set(v[i], 0);
      Set(v[i + 1], 0);
    } else {
      int number = X % 3 + 1;
      X /= 3;
      Set(v[i], (0 < (number & 2)));
      Set(v[i + 1], (number & 1));
    }
  }
}

#include "Brunolib.h"
#include <iostream>

using ll = long long;

namespace Ban{
  int const nmax = 150;
  int const modulo = 1000000007;
  int const base = 13;
  int const rest = 7;

  int v[1 + nmax];

  int root;

  int myrand(){
    root = (1LL * root * base + rest) % modulo;
    return root;
  }

  void staticshuffle(int n){
    for(int i = 0; i < n; i++)
      v[i] = i;
    for(int i = 0; i < 3 * n; i++){
      int x = myrand() % n;
      int y = myrand() % n;
      std::swap(v[x], v[y]);
    }
  }
}
using namespace Ban;

long long Bruno(int n, int A[] ){
  root = 1;
  staticshuffle(n);

  ll result = 0;
  for(int i = n - 2; 0 <= i; i -= 2){
    if(A[v[i]] == 0 && A[v[i + 1]] == 0) {
      continue;
    } else {
      int number = (A[v[i]]<<1) + A[v[i + 1]] - 1;
      result = result * 3 + number;
    }
  }
  return result;
}

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 63 ms 3072 KB Output isn't correct - L* = 0
2 Partially correct 62 ms 3056 KB Output isn't correct - L* = 0
3 Partially correct 64 ms 3064 KB Output isn't correct - L* = 0
4 Partially correct 62 ms 3072 KB Output isn't correct - L* = 0
5 Partially correct 64 ms 3072 KB Output isn't correct - L* = 0
6 Partially correct 65 ms 3056 KB Output isn't correct - L* = 0
7 Partially correct 63 ms 2808 KB Output isn't correct - L* = 0
8 Partially correct 61 ms 3056 KB Output isn't correct - L* = 0
9 Partially correct 63 ms 3072 KB Output isn't correct - L* = 0
10 Partially correct 65 ms 2896 KB Output isn't correct - L* = 0
11 Partially correct 64 ms 3056 KB Output isn't correct - L* = 0
12 Partially correct 64 ms 3056 KB Output isn't correct - L* = 0
13 Partially correct 63 ms 3056 KB Output isn't correct - L* = 0
14 Partially correct 66 ms 3056 KB Output isn't correct - L* = 0
15 Partially correct 64 ms 3056 KB Output isn't correct - L* = 0
16 Partially correct 63 ms 3056 KB Output isn't correct - L* = 0
17 Partially correct 64 ms 3056 KB Output isn't correct - L* = 0
18 Partially correct 63 ms 3056 KB Output isn't correct - L* = 0
19 Partially correct 63 ms 3072 KB Output isn't correct - L* = 0
20 Partially correct 62 ms 3056 KB Output isn't correct - L* = 0
21 Partially correct 62 ms 3056 KB Output isn't correct - L* = 0
22 Partially correct 61 ms 3072 KB Output isn't correct - L* = 0
23 Partially correct 62 ms 3072 KB Output isn't correct - L* = 0
24 Partially correct 62 ms 3056 KB Output isn't correct - L* = 0
25 Partially correct 65 ms 3056 KB Output isn't correct - L* = 0
26 Partially correct 63 ms 3056 KB Output isn't correct - L* = 0
27 Partially correct 63 ms 3312 KB Output isn't correct - L* = 0
28 Partially correct 63 ms 3056 KB Output isn't correct - L* = 0
29 Partially correct 63 ms 3056 KB Output isn't correct - L* = 0
30 Partially correct 62 ms 3072 KB Output isn't correct - L* = 0
31 Partially correct 62 ms 3056 KB Output isn't correct - L* = 0
32 Partially correct 62 ms 3000 KB Output isn't correct - L* = 0
33 Partially correct 62 ms 3056 KB Output isn't correct - L* = 0
34 Partially correct 65 ms 3056 KB Output isn't correct - L* = 0
35 Partially correct 62 ms 3056 KB Output isn't correct - L* = 0
36 Partially correct 63 ms 3056 KB Output isn't correct - L* = 0
37 Partially correct 66 ms 3072 KB Output isn't correct - L* = 0
38 Partially correct 62 ms 3056 KB Output isn't correct - L* = 0
39 Partially correct 65 ms 3056 KB Output isn't correct - L* = 0
40 Partially correct 65 ms 3328 KB Output isn't correct - L* = 0