제출 #100050

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

Anna

#include "Annalib.h"
#include <bits/stdc++.h>
using namespace std;
void Anna( int N, long long X, int K, int P[] ){
    //printf("anna");
    bool isbroken[N]; memset(isbroken,0,sizeof(isbroken));
    for (int i = 0; i < K; i++){
        isbroken[P[i]] = true;
    }
    int s = 0;
    while (X && s < N){
        if (isbroken[s]||isbroken[s+1]){
            Set(s,0);
            Set(s+1,0);
        }
        else{
            //printf("%d",X%2);
            if (X % 2 == 1){
                Set(s,1);
                Set(s+1,0);
            }
            else{
                Set(s,1);
                Set(s+1,1);
            }
            X /= 2;
        }
        s+=2;
    }
    for (int i = s; i < N; i++){
        Set(i,0);
    }
    //printf("\n");
}

Bruno

#include "Brunolib.h"
#include <bits/stdc++.h>
using namespace std;
long long Bruno( int N, int A[] ){
    //printf("bruno");
    long long ans = 0ll;
    int s = 0;
    int num = 0;
    stack<bool> st;
    while (s<N){
        if (A[s] || A[s+1]){
            num++;
            //printf("%d",(A[s]^A[e]));
            st.push(A[s]^A[s+1]);
        }
        s+=2;
    }
    while (st.size()){
        //printf("%d",st.top());
        ans*=2;
        ans+=st.top();
        st.pop();
    }
    //printf("\n%lld\n",ans);
    return ans;
}

• Subtask 1: 41 / 100