제출 #113952

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
113952		anayk	Broken Device (JOI17_broken_device)	C++14	0 / 100	2075 ms	384 KiB

Anna

#include "Annalib.h"
#include <iostream>

#define LOGX 60

void Anna(int N, long long X, int K, int P[])
{
	int bin[LOGX];
	long long pow[LOGX];
	
	pow[0] = 1;
	for(int i = 1; i < LOGX; i++)
		pow[i] = pow[i-1]*2;
	
	for(int i = LOGX - 1; i >= 0; i++)
	{
		if(pow[i] <= X)
		{
			bin[i] = 1;
			X -= pow[i];
		}
		else
			bin[i] = 0;
	}
	
	int cur = 0;
	int ptr = 0;
	int next = 0;
	
	while(ptr < 60)
	{
		if(P[next] - cur < 3)
		{
			Set(cur, 0);
			cur++;
		}
		else
		{
			Set(cur, 1);
			cur++;
			for(int i = 0; i < 2; i++)
				Set(cur++, bin[ptr++]);
		}
		
		if(P[next] < cur)
			next++;
	}
	
	while(cur < N)
	{
		Set(cur, 0);
		cur++;
	}
}

Bruno

#include "Brunolib.h"

#define LOGX 60

long long Bruno(int N, int A[])
{
	long long pow[LOGX];
	
	pow[0] = 1;
	for(int i = 1; i < LOGX; i++)
		pow[i] = pow[i-1]*2;
	
	long long X = 0;
	int cur = 0;
	for(int i = 0; i < N; i++)
	{
		if(A[i] == 1)
		{
			for(int j = 0; j < 2; j++)
				if(A[++i])
					X += pow[cur++];
		}
	}
	
	return X;
}

• Subtask 1: 0 / 100