Submission #1077297

#	Time	Username	Problem	Language	Result	Execution time	Memory
1077297		veehj	Broken Device (JOI17_broken_device)	C++17	85 / 100	31 ms	2720 KiB

Anna

#include "Annalib.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define F first
#define S second
#define pb push_back
#define sz(a) (ll) a.size()
#define all(x) (x).begin(), (x).end()

void Anna( int N, long long X, int K, int P[] ){
  set<int> s={};
  stack<ll> st;
  while(X!=0){
    st.push(X%3);
    X/=3;
  }
  for(int i=0; i<K; i++) s.insert(P[i]);
  for(int i=0; i<N; i+=2){
    if(s.count(i) || (i+1<N && s.count(i+1)) || st.size()==0){
      Set(i, 0);
      Set(i+1, 0);
      continue;
    }
    if(st.top()==0){
      Set(i, 0);
      Set(i+1, 1);
    }
    if(st.top()==1){
      Set(i, 1);
      Set(i+1, 0);
    }
    if(st.top()==2){
      Set(i, 1);
      Set(i+1, 1);
    }
    st.pop();
  }
}

Bruno

#include "Brunolib.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define F first
#define S second
#define pb push_back
#define sz(a) (ll) a.size()
#define all(x) (x).begin(), (x).end()

long long Bruno( int N, int A[] ){
  ll ans=0;
  for(int i=0; i<N; i+=2){
    if(A[i]==0 && A[i+1]==0) continue;
    int x=A[i]*2+A[i+1]-1;
    ans*=3;
    ans+=x;
  }
  return ans;
}

• Subtask 1: 85 / 100