Submission #1208557

#	Time	Username	Problem	Language	Result	Execution time	Memory
1208557		mychecksedad	Broken Device (JOI17_broken_device)	C++20	65 / 100	25 ms	1560 KiB

Anna

/* Author : Mychecksdead  */
#include<bits/stdc++.h>
#include "Annalib.h"
using namespace std;
#define ll long long int
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define pb push_back
#define all(x) x.begin(), x.end()
#define en cout << '\n'
#define ff first
#define ss second
#define pii pair<int,int>
#define vi vector<int>
const int N = 1e6+100, M = 1e5+10, K = 52, MX = 30;

void Anna( int n, long long X, int k, int p[] ){
  vi O = {140, 43, 52, 107, 66, 124, 37, 63, 108, 40, 32, 31, 137, 39, 12, 24, 27, 4, 15, 19, 148, 105, 46, 42, 95, 2, 48, 122, 125, 23, 71, 50, 98, 8, 67, 60, 58, 17, 87, 136, 33, 26, 79, 104, 13, 73, 29, 70, 94, 147, 126, 90, 130, 114, 81, 56, 129, 109, 68, 83, 64, 85, 131, 14, 133, 80, 102, 110, 61, 121, 93, 132, 0, 34, 144, 36, 65, 82, 11, 89, 111, 139, 45, 117, 21, 28, 74, 59, 118, 18, 20, 120, 86, 3, 115, 47, 100, 97, 25, 113, 22, 92, 51, 106, 143, 127, 145, 149, 134, 77, 141, 38, 103, 146, 91, 5, 138, 7, 35, 69, 44, 30, 119, 84, 88, 53, 55, 96, 54, 16, 49, 10, 128, 135, 142, 1, 9, 116, 76, 75, 123, 6, 72, 62, 57, 78, 99, 112, 41, 101};

  vector<int> good(n, 1);
  for(int i = 0; i < k; ++i) good[p[i]] = 0;
    
  vi bits;
  while(X){
    bits.pb(X%2);
    X /= 2;
  }

  for(int i = 2; i < n; i += 3){
    int bad = 3 - good[O[i]] - good[O[i - 1]] - good[O[i - 2]];
    if(bad >= 2 || bits.empty()){
      Set(O[i], 0);
      Set(O[i-1], 0);
      Set(O[i-2], 0);
    }else{
      if(bad == 0){
        if(bits.size() == 1){
          Set(O[i], 0);
          Set(O[i-1], bits.back() ^ 1);
          Set(O[i-2], bits.back());
          bits.pop_back();
        }else{
          Set(O[i], 1);
          Set(O[i-2], bits.back()); bits.pop_back();
          Set(O[i - 1], bits.back()); bits.pop_back();
        }
      }else{
        if(good[O[i]] == 0){
          int val = bits.back();
          bits.pop_back();
          Set(O[i], 0);
          if(val){
            Set(O[i - 1], 0);
            Set(O[i - 2], 1);
          }else{
            Set(O[i - 1], 1);
            Set(O[i - 2], 1);
          }
        }else{
          bool side = !good[O[i - 2]]; 
          if(side ^ bits.back()){
            Set(O[i], 0);
            if(side == 0){
              Set(O[i-1], 0);
              Set(O[i-2], 1);
            }else{
              Set(O[i-1], 1);
              Set(O[i-2], 0);
            }
            bits.pop_back();
          }else{  
            Set(O[i], 0);
            Set(O[i-1], 0);
            Set(O[i-2], 0);
          }
        }
      }
    }
  }
}

Bruno

#include<bits/stdc++.h>
#include "Brunolib.h"
using namespace std;
#define ll long long int
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define pb push_back
#define all(x) x.begin(), x.end()
#define en cout << '\n'
#define ff first
#define ss second
#define pii pair<int,int>
#define vi vector<int>
const int N = 1e6+100, M = 1e5+10, K = 52, MX = 30;

long long Bruno( int n, int a[] ){
  vi O = {140, 43, 52, 107, 66, 124, 37, 63, 108, 40, 32, 31, 137, 39, 12, 24, 27, 4, 15, 19, 148, 105, 46, 42, 95, 2, 48, 122, 125, 23, 71, 50, 98, 8, 67, 60, 58, 17, 87, 136, 33, 26, 79, 104, 13, 73, 29, 70, 94, 147, 126, 90, 130, 114, 81, 56, 129, 109, 68, 83, 64, 85, 131, 14, 133, 80, 102, 110, 61, 121, 93, 132, 0, 34, 144, 36, 65, 82, 11, 89, 111, 139, 45, 117, 21, 28, 74, 59, 118, 18, 20, 120, 86, 3, 115, 47, 100, 97, 25, 113, 22, 92, 51, 106, 143, 127, 145, 149, 134, 77, 141, 38, 103, 146, 91, 5, 138, 7, 35, 69, 44, 30, 119, 84, 88, 53, 55, 96, 54, 16, 49, 10, 128, 135, 142, 1, 9, 116, 76, 75, 123, 6, 72, 62, 57, 78, 99, 112, 41, 101};

  ll ans = 0;
  vi v;
  // for(int i = 1; i <= n; ++i){
  //   cerr << a[O[i-1]] << ' ';
  // }
  for(int i = 2; i < n; i += 3){
    if(a[O[i]]){
      v.pb(a[O[i-2]]);
      v.pb(a[O[i-1]]);
    }else{
      if(a[O[i-1]] || a[O[i-2]]){
        if(a[O[i-1]] && a[O[i-2]]){
          v.pb(0);
        }else if(a[O[i-1]]) v.pb(0);
        else v.pb(1);
      }
    }
  }
  for(int b: v){
    ans *= 2;
    ans += b;
  }

  return ans;
}

• Subtask 1: 65 / 100