제출 #502641

#제출 시각아이디문제언어결과실행 시간메모리
502641MilosMilutinovicBroken Device (JOI17_broken_device)C++14
0 / 100
41 ms2740 KiB
#include "Annalib.h"
#include <bits/stdc++.h>
using namespace std;

int b[]={2,4,5,6,7,8,12,15,17,19,21,22,24,27,33,36,37,38,39,43,44,47,49,52,57,61,62,63,68,72,75,76,78,79,81,82,87,88,89,91,94,97,99,101,107,108,109,113,115,117,118,124,126,127,134,135,136,137,138,139,145,147,148,149};

void Anna(int N,long long X,int K,int P[]){
	vector<int> arr(150);
	for (int i=0;i<64;i++) {
		if (X&(1ll<<i)) {
			arr[b[i]-1]=1;
		}
	}
	for (int i=0;i<150;i++) Set(i,arr[i]);
}
#include "Brunolib.h"
#include <bits/stdc++.h>
using namespace std;

int b[]={2,4,5,6,7,8,12,15,17,19,21,22,24,27,33,36,37,38,39,43,44,47,49,52,57,61,62,63,68,72,75,76,78,79,81,82,87,88,89,91,94,97,99,101,107,108,109,113,115,117,118,124,126,127,134,135,136,137,138,139,145,147,148,149};

long long Bruno(int N,int A[]) {
	long long x=0;
	for (int i=0;i<64;i++) {
		if (A[b[i]-1]) x+=(1ll<<i);
	}
	return x;
}
#Verdict Execution timeMemoryGrader output
Fetching results...