제출 #1077293

#제출 시각아이디문제언어결과실행 시간메모리
1077293LCJLYBroken Device (JOI17_broken_device)C++14
45 / 100
30 ms3024 KiB
#include "Annalib.h"
#include <bits/stdc++.h>
//#include "grader.cpp"
using namespace std;
 
#define show(x,y) cout << y << " " << #x << endl;
#define show2(x,y,i,j) cout << y << " " << #x << "  " << j << " " << #i << endl;
#define show3(x,y,i,j,p,q) cout << y << " " << #x << "  " << j << " " << i << "  " << q << " " << #p << endl;
#define show4(x,y) for(auto it:y) cout << it << " "; cout << #x << endl;
typedef pair<int,int>pii; 
 
void Anna(int n, long long val, int k, int p[]){
	bool amos[155];
	memset(amos,0,sizeof(amos));
	for(int x=0;x<k;x++){
		amos[p[x]]=true;
	}
	
	vector<int>v;
	for(int x=0;x<60;x++){
		if(val&(1LL<<x)) v.push_back(1);
		else v.push_back(0);
	}
	
	int ptr=0;
	for(int x=0;x<n;x++){
		if(ptr<(int)v.size()&&x+3<n&&!amos[x]&&!amos[x+1]&&!amos[x+2]&&!amos[x+3]){
			Set(x,1);
			Set(x+1,v[ptr]);
			ptr++;
			Set(x+2,v[ptr]);
			ptr++;
			Set(x+3,v[ptr]);
			ptr++;
			x+=3;
		}
		else Set(x,0);
	}
}
#include "Brunolib.h"
#include <bits/stdc++.h>
//#include "grader.cpp"
using namespace std;
 
#define show(x,y) cout << y << " " << #x << endl;
#define show2(x,y,i,j) cout << y << " " << #x << "  " << j << " " << #i << endl;
#define show3(x,y,i,j,p,q) cout << y << " " << #x << "  " << j << " " << i << "  " << q << " " << #p << endl;
#define show4(x,y) for(auto it:y) cout << it << " "; cout << #x << endl;
typedef pair<int,int>pii; 
 
long long Bruno(int n, int a[]){
	long long val=0;
	int cur=0;
	//for(int x=0;x<n;x++) cout << a[x] << " ";
	//cout << endl;
	for(int x=0;x<n;x++){
		if(a[x]==1){
			if(a[x+1]==1){
				val+=1LL<<cur;
			}
			cur++;
			if(a[x+2]==1){
				val+=1LL<<cur;
			}
			cur++;
			if(a[x+3]==1){
				val+=1LL<<cur;
			}
			cur++;
			x+=3;
		}
	}
	//cout << "check" << endl;
	return val;
}
#Verdict Execution timeMemoryGrader output
Fetching results...