Submission #1215564

#	Time	Username	Problem	Language	Result	Execution time	Memory
1215564		Gray	Broken Device (JOI17_broken_device)	C++20	51 / 100	27 ms	1388 KiB

Anna

#include "Annalib.h"
#include <algorithm>
#include <bits/stdc++.h>
#define ll long long
using namespace std;

void Anna( int N, long long X, int K, int P[] ){
    map<ll, ll> unfree;
    for (ll i=0; i<K; i++){
        unfree[P[i]]=1;
    }
    vector<ll> nums;
    for (ll i=0; i<60; i++){
        if ((1ull<<i)&X) nums.push_back(1);
        else nums.push_back(0);
    }
    reverse(nums.begin(), nums.end());
    for (ll i=2; i<N; i+=3){
        if (unfree.count(i) or unfree.count(i-1) or nums.empty() or unfree.count(i-2)){
            Set(i, 0); Set(i-1, 0); Set(i-2, 0);
        }else{
            Set(i, 1); Set(i-2, nums.back());
            nums.pop_back();
            Set(i-1, nums.back()); nums.pop_back();
        }
    }
}

Bruno

#include "Brunolib.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;

long long Bruno( int N, int A[] ){
    vector<ll> nums;
    // for (ll i=0; i<N; i++) cout << A[i] << endl;
    for (ll i=2; i<N and nums.size()<60; i+=3){
        if (A[i]==0) continue;
        else{
            nums.push_back(A[i-2]); nums.push_back(A[i-1]);
        }
    }
    ll x=0;
    for (ll i=0; i<60; i++){
        if (nums[i]) x+=(1ull<<i);
    }
  return x;
}

• Subtask 1: 51 / 100