Submission #330859

#	Time	Username	Problem	Language	Result	Execution time	Memory
330859		NachoLibre	Broken Device (JOI17_broken_device)	C++14	0 / 100	53 ms	3200 KiB

Anna

#include <bits/stdc++.h>
using namespace std;
#define ANNACPP ANNACPP
// #define BRUNOCPP BRUNOCPP

#ifdef ANNACPP
#include "Annalib.h"

void Anna(int n, long long x, int k, int* p) {
	vector<int> v, g;
	g.resize(n, 0);
	for(int i = 0; i < k; ++i) {
		g[p[i]] = 1;
	}
	int bt = 0;
	for(int i = 0; i < n; i += 3) {
		int jg = g[i] + g[i + 1] + g[i + 2];
		if(jg == 0) {
			int tx = ((x & (1ll << bt)) | (x & (1ll << (bt + 1)))) >> bt;
			bt += 2;
			if(tx == 0) {
				v.push_back(0);
				v.push_back(1);
				v.push_back(1);
			} else if(tx == 1) {
				v.push_back(1);
				v.push_back(0);
				v.push_back(1);
			} else if(tx == 2) {
				v.push_back(1);
				v.push_back(1);
				v.push_back(0);
			} else if(tx == 3) {
				v.push_back(1);
				v.push_back(1);
				v.push_back(1);
			} else {
				exit(1);
			}
		} else if(jg == 1) {
			int tx = (x & (1ll << bt)) >> bt;
			++bt;
			if(tx == 0) {
				if(g[i + 1]) {
					tx = (x & (1ll << bt)) >> bt;
					++bt;
					if(tx == 0) {
						v.push_back(0);
						v.push_back(1);
						v.push_back(1);
					} else if(tx == 1) {
						v.push_back(1);
						v.push_back(0);
						v.push_back(1);
					} else {
						exit(1);
					}
				} else {
					v.push_back(0);
					v.push_back(1);
					v.push_back(0);
				}
			} else if(tx == 1) {
				if(g[i]) {
					v.push_back(0);
					v.push_back(0);
					v.push_back(1);
				} else {
					v.push_back(1);
					v.push_back(0);
					v.push_back(0);
				}
			} else {
				exit(1);
			}
		} else {
			v.push_back(0);
			v.push_back(0);
			v.push_back(0);
		}
	}
	for(int i = 0; i < n; ++i) {
		Set(i, v[i]);
	}
}

#endif

#ifdef BRUNOCPP
#include "Brunolib.h"

long long Bruno(int n, int* a) {
	long long x = 0;
	int bt = 0;
	for(int i = 0; i < n; i += 3) {
		int m = a[i] * 4 + a[i + 1] * 2 + a[i + 2];
		if(m == 0);
		else if(m == 1) x |= (1ll << bt), ++bt;
		else if(m == 2) ++bt;
		else if(m == 3) bt += 2;
		else if(m == 4) x |= (1ll << bt), ++bt;
		else if(m == 5) ++bt, x |= (1ll << bt), ++bt;
		else if(m == 6) x |= (1ll << bt), bt += 2;
		else if(m == 7) x |= (1ll << bt), ++bt, x |= (1ll << bt), ++bt;
	}
	return x;
}

#endif


#ifdef WEEE
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	return 0;
}
#endif

Bruno

#include <bits/stdc++.h>
using namespace std;
// #define ANNACPP ANNACPP
#define BRUNOCPP BRUNOCPP

#ifdef ANNACPP
#include "Annalib.h"

void Anna(int n, long long x, int k, int* p) {
	vector<int> v, g;
	g.resize(n, 0);
	for(int i = 0; i < k; ++i) {
		g[p[i]] = 1;
	}
	int bt = 0;
	for(int i = 0; i < n; i += 3) {
		int jg = g[i] + g[i + 1] + g[i + 2];
		if(jg == 0) {
			int tx = ((x & (1ll << bt)) | (x & (1ll << (bt + 1)))) >> bt;
			bt += 2;
			if(tx == 0) {
				v.push_back(0);
				v.push_back(1);
				v.push_back(1);
			} else if(tx == 1) {
				v.push_back(1);
				v.push_back(0);
				v.push_back(1);
			} else if(tx == 2) {
				v.push_back(1);
				v.push_back(1);
				v.push_back(0);
			} else if(tx == 3) {
				v.push_back(1);
				v.push_back(1);
				v.push_back(1);
			} else {
				exit(1);
			}
		} else if(jg == 1) {
			int tx = (x & (1ll << bt)) >> bt;
			++bt;
			if(tx == 0) {
				if(g[i + 1]) {
					tx = (x & (1ll << bt)) >> bt;
					++bt;
					if(tx == 0) {
						v.push_back(0);
						v.push_back(1);
						v.push_back(1);
					} else if(tx == 1) {
						v.push_back(1);
						v.push_back(0);
						v.push_back(1);
					} else {
						exit(1);
					}
				} else {
					v.push_back(0);
					v.push_back(1);
					v.push_back(0);
				}
			} else if(tx == 1) {
				if(g[i]) {
					v.push_back(0);
					v.push_back(0);
					v.push_back(1);
				} else {
					v.push_back(1);
					v.push_back(0);
					v.push_back(0);
				}
			} else {
				exit(1);
			}
		} else {
			v.push_back(0);
			v.push_back(0);
			v.push_back(0);
		}
	}
	for(int i = 0; i < n; ++i) {
		Set(i, v[i]);
	}
}

#endif

#ifdef BRUNOCPP
#include "Brunolib.h"

long long Bruno(int n, int* a) {
	long long x = 0;
	int bt = 0;
	for(int i = 0; i < n; i += 3) {
		int m = a[i] * 4 + a[i + 1] * 2 + a[i + 2];
		if(m == 0);
		else if(m == 1) x |= (1ll << bt), ++bt;
		else if(m == 2) ++bt;
		else if(m == 3) bt += 2;
		else if(m == 4) x |= (1ll << bt), ++bt;
		else if(m == 5) ++bt, x |= (1ll << bt), ++bt;
		else if(m == 6) x |= (1ll << bt), bt += 2;
		else if(m == 7) x |= (1ll << bt), ++bt, x |= (1ll << bt), ++bt;
	}
	return x;
}

#endif


#ifdef WEEE
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	return 0;
}
#endif

• Subtask 1: 0 / 100