제출 #69069

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
69069		IvanC	Broken Device (JOI17_broken_device)	C++17	41 / 100	73 ms	3808 KiB

Anna

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

const int MAXN = 150;

static int possivel[MAXN],resposta[MAXN];

void Anna( int N, long long X, int K, int P[] ){

	memset(possivel,1,sizeof(possivel));
	memset(resposta,0,sizeof(resposta));
	possivel[N] = 0;

	for(int i = 0;i<K;i++) possivel[P[i]] = 0;

	vector<int> digitos;
	while(X != 0){
		digitos.push_back(X % 2);
		X /= 2;
	}
	reverse(digitos.begin(),digitos.end());

	for(int i =0;i+1<N && !digitos.empty();i++){
		if(!possivel[i]){
			continue;
		}
		if(digitos.back() == 0){
			resposta[i] = 1;
			resposta[i+1] = 0;
			possivel[i+1] = 0;
			digitos.pop_back();
		}
		else{
			if(possivel[i+1]){
				resposta[i] = 1;
				resposta[i+1] = 1;
				possivel[i+1] = 0;
				digitos.pop_back();
			}
			else{
				continue;
			}
		}
	}

	for(int i = 0;i<N;i++){
		Set( i, resposta[i] );
	}

}

Bruno

#include "Brunolib.h"

long long Bruno( int N, int A[] ){

	long long ans = 0;
	int last = 0;
	
	for(int i = 0;i+1<N;i++){
		if(A[i] == 0) continue;
		if(A[i+1] == 0){
			last++;
		}
		else{
			ans += (1LL << last);
			last++;
			A[i+1] = 0;
		}
	}

	return ans;

}

• Subtask 1: 41 / 100