제출 #231533

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
231533		cstuart	Broken Device (JOI17_broken_device)	C++17	75 / 100	56 ms	3328 KiB

Anna

#include <bits/stdc++.h>
using namespace std;
#include "Annalib.h"
 
void Anna (int N, long long X, int K, int P[]) {
  
  bool     fuc[N+5], init;
  int      pre[N+5], b;
  string   rep[4] = {"100110010101011010010110010110101010010110011010100110100101100110100101100101100101101010100101011001010101010110101001100101101001010110100110100101", "011001101010100101101001101001010101101001100101011001011010011001011010011010011010010101011010100110101010101001010110011010010110101001011001011010", "000010000100100000100000100100010000010000100000100100010000000100100010000100000100000100010000100001000100000000100010001000000110000010000001010000", "111011011110111111011111010111111011101110111011111011101111111011101111101111011011111011111011111011101111101111011101110111111011110011110111111110"};
  
  memset(fuc, 1, sizeof fuc);
  for (int i = 0; i < K; i++) fuc[P[i]] = 0;
  
  for (int s = 0; s < 4; s++) {
    init = 0;
    b = 0;
    for (int i = 0; i < N; i++) {
      if (!fuc[i]) pre[i] = 0;
      else if (!init && i % 4 == s) pre[i] = 1, init = 1;
      else if (!init) pre[i] = 0;
      else if (b == 60) pre[i] = 0;
      else if (((1ll << b) & X) == 0 && rep[s][i % (int)rep[s].length()] == '1') pre[i] = 0;
      else if (((1ll << b) & X) > 0  && rep[s][i % (int)rep[s].length()] == '0') pre[i] = 0;
      else pre[i] = 1, b++;
    }
    if (b == 60) {
      for (int i = 0; i < N; i++) Set(i, pre[i]);
      return;
    }
  }
  
  for (int i = 0; i < N; i++) Set(i, pre[i]);
  
}

Bruno

#include <bits/stdc++.h>
using namespace std;
#include "Brunolib.h"
 
long long Bruno (int N, int A[]) {
  
  string     rep[4] = {"100110010101011010010110010110101010010110011010100110100101100110100101100101100101101010100101011001010101010110101001100101101001010110100110100101", "011001101010100101101001101001010101101001100101011001011010011001011010011010011010010101011010100110101010101001010110011010010110101001011001011010", "000010000100100000100000100100010000010000100000100100010000000100100010000100000100000100010000100001000100000000100010001000000110000010000001010000", "111011011110111111011111010111111011101110111011111011101111111011101111101111011011111011111011111011101111101111011101110111111011110011110111111110"};
  long long  V = 0;
  int        s = -1;
  int        b = 0;
  
  for (int i = 0; i < N; i++) {
    if (A[i] == 1) {
      if (s == -1) s = i % 4;
      else if (rep[s][i % (int)rep[s].length()] == '1') V += (1ll << b), b++;
      else b++;
    }
  }
  
  return V;
}

• Subtask 1: 75 / 100