Submission #295057

#	Time	Username	Problem	Language	Result	Execution time	Memory
295057		BThero	Broken Device (JOI17_broken_device)	C++17	0 / 100	62 ms	3328 KiB

Anna

// chrono::system_clock::now().time_since_epoch().count()
#include "Annalib.h"
#include<bits/stdc++.h>

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define debug(x) cerr << #x << " = " << x << endl;

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

namespace {
  int seed[] = {136, 241, 13, 4, 59};
  int n, k, bad_pos[45];
  int is_bad[205];
  int perm[205];
  ll msg;
  
  int bit(ll x, int p) {
    if (p > 60) return 0;
    return (x >> p) & 1;
  }
  
  void set(int p, int x) {
    if (p < n) {
      Set(p, x);
    }
  }
  
  void solve() {
    fill(is_bad, is_bad + n, 0);
  
    for (int i = 0; i < k; ++i) {
      is_bad[bad_pos[i]] = 1;
    }
    
    for (int i = 0; i < n; ++i) {
      perm[i] = i;
    }
    
    mt19937 rnd(seed[0]);
    
    for (int i = 1; i < n; ++i) {
      swap(perm[i], perm[rnd() % i]);
    }
    
    int p = 0;
    
    for (int i = 0; i < n; i += 2) {
      if (is_bad[perm[i]] || is_bad[perm[i + 1]]) {
        set(perm[i], 0);
        set(perm[i + 1], 0);
      }
      else {
        set(perm[i], 1);
        set(perm[i + 1], bit(msg, p++));
      }
    }
  }
};

void Anna( int N, long long X, int K, int P[] ){
  n = N;
  msg = X;
  k = K;
  
  for (int i = 0; i < k; ++i) {
    bad_pos[i] = P[i];
  }

  solve();
}

Bruno

// chrono::system_clock::now().time_since_epoch().count()
#include "Brunolib.h"
#include<bits/stdc++.h>

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define debug(x) cerr << #x << " = " << x << endl;

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

namespace {
  int seed[] = {136, 241, 13, 4, 59};
  int n, arr[205], perm[205];
  
  ll solve() {
    ll ret = 0;
    
    for (int i = 0; i < n; ++i) {
      perm[i] = i;
    }
    
    mt19937 rnd(perm[0]);
    
    for (int i = 1; i < n; ++i) {
      swap(perm[i], perm[rnd() % i]);
    }
    
    int p = 0;
    
    for (int i = 0; i < n; i += 2) {
      if (arr[perm[i]] == 0) {
        continue;
      }
      
      if (arr[perm[i + 1]]) {
        ret += (1ll << p);
      }
      
      p++;
    }
    
    return ret;
  }
};

long long Bruno( int N, int A[] ){
  n = N;
  
  for (int i = 0; i < n; ++i) {
    arr[i] = A[i];
  }

  return solve();
}

Compilation message (stderr)

Bruno.cpp:19:7: warning: '{anonymous}::seed' defined but not used [-Wunused-variable]
   19 |   int seed[] = {136, 241, 13, 4, 59};
      |       ^~~~

• Subtask 1: 0 / 100