제출 #990768

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
990768		abczz	Broken Device (JOI17_broken_device)	C++14	41 / 100	155 ms	2980 KiB

Anna

#include "Annalib.h"
#include <iostream>
#include <random>
#define ll long long

using namespace std;

void Anna( int N, long long X, int K, int P[] ){
  srand(7318371);
  ll x = 580879096216018200, L[60][150];
  bool B[150], F[150];
  for (int i=0; i<N; ++i) B[i] = F[i] = 0;
  for (int i=0; i<K; ++i) B[P[i]] = 1;
  x ^= X;
  for (int i=0; i<60; ++i) {
    for (int j=0; j<N; ++j) {
      L[i][j] = rand() & 1;
    }
  }
  ll p = 0;
  for (int i=59; i>=0; --i) {
    ll bit = (bool)(x & (1LL<<i));
    for (int j=0; j<N; ++j) {
      if (L[i][j] == bit && !B[p+j]) {
        //cout << i << " " << j << endl;
        F[p+j] = 1;
        p += j+1;
        break;
      }
    }
  }
  for (int i=0; i<N; ++i) {
    Set(i, F[i]);
  }
}

Bruno

#include "Brunolib.h"
#include <iostream>
#include <vector>
#include <random>
#define ll long long

using namespace std;

long long Bruno( int N, int A[] ){
  srand(7318371);
  ll x = 580879096216018200, L[60][150];
  vector <ll> V;
  for (int i=0; i<60; ++i) {
    for (int j=0; j<N; ++j) {
      L[i][j] = rand() & 1;
    }
  }
  ll p = 0;
  for (int i=0; i<N; ++i) {
    if (A[i]) {
      V.push_back(i);
    }
  }
  int j = 0;
  for (int i=59; i>=0; --i) {
    //cout << i << " " << V[j]-p << endl;
    if (L[i][V[j]-p]) x ^= (1LL<<i);
    p = V[j++]+1;
  }
  return x;
}

• Subtask 1: 41 / 100