Submission #313378

#TimeUsernameProblemLanguageResultExecution timeMemory
313378peuchBroken Device (JOI17_broken_device)C++17
41 / 100
46 ms3584 KiB
#include "Annalib.h"
#include<bits/stdc++.h>
using namespace std;

const int MAXN = 200;

void Anna(int N, long long X, int K, int P[]){
	
	int marc[MAXN];
	int on[MAXN];
	memset(marc, 0, sizeof(marc));
	memset(on, 0, sizeof(on));

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

	long long it = 0;
	for(int i = 0; i < N; i += 2){
		if(it > 60) continue;
		if((1LL << it) & X){
			if(marc[i]) continue;
			it++;
			on[i] = 1;
		}
		else{
			if(marc[i + 1]) continue;
			it++;
			on[i + 1] = 1;
		}
	}
	
	for(int i = 0; i < N; i++)
		Set(i, on[i]);

	return;
}
#include "Brunolib.h"
#include<bits/stdc++.h>
using namespace std;

long long Bruno(int N, int A[]){
	
	long long it = 0;
	long long ret = 0;

	for(int i = 0; i < N; i += 2){
		if(A[i] == 0 && A[i + 1] == 0) continue;
		ret |= (long long) A[i] << it;
		it++;
	}

	return ret;
}
#Verdict Execution timeMemoryGrader output
Fetching results...