답안 #330878

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
330878	2020-11-26T19:39:47 Z	NachoLibre	Broken Device (JOI17_broken_device)	C++14	0 / 100	53 ms	2984 KB

Anna

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

#ifdef WEEE
#define ANNACPP ANNACPP
#define BRUNOCPP BRUNOCPP

int mc[150];
void Set(int pos, int val) {
	mc[pos] = val;
}

#endif

#ifdef ANNACPP
#ifndef WEEE
#include "Annalib.h"
#endif

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 >= 2 || bt > 60) {
			v.push_back(0);
			v.push_back(0);
			v.push_back(0);
		} else if(jg == 0) {
			int tx = (((x & (1ll << bt)) << 1) | ((x & (1ll << (bt + 1))) >> 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);
			}
		}
	}
	for(int i = 0; i < n; ++i) {
		Set(i, v[i]);
	}
}

#endif

#ifdef BRUNOCPP
#ifndef WEEE
#include "Brunolib.h"
#endif

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

mt19937_64 rnd(time(NULL));
long long mx = 1000000000000000001ll;
int a[150];

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	while(true) {
		long long x = rnd() % mx;
		for(int i = 0; i < 40; ++i) {
			a[i] = rnd() % 150;
		}
		Anna(150, x, 40, a);
		long long y = Bruno(150, mc);
		if(x != y) {
			cout << x << " " << y << endl;
			exit(0);
		} else {
			// cout << "YAY\n" << flush;
		}
	}
	return 0;
}
#endif

Bruno

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

#ifdef WEEE
#define ANNACPP ANNACPP
#define BRUNOCPP BRUNOCPP

int mc[150];
void Set(int pos, int val) {
	mc[pos] = val;
}

#endif

#ifdef ANNACPP
#ifndef WEEE
#include "Annalib.h"
#endif

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 >= 2 || bt > 60) {
			v.push_back(0);
			v.push_back(0);
			v.push_back(0);
		} else if(jg == 0) {
			int tx = (((x & (1ll << bt)) << 1) | ((x & (1ll << (bt + 1))) >> 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);
			}
		}
	}
	for(int i = 0; i < n; ++i) {
		Set(i, v[i]);
	}
}

#endif

#ifdef BRUNOCPP
#ifndef WEEE
#include "Brunolib.h"
#endif

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

mt19937_64 rnd(time(NULL));
long long mx = 1000000000000000001ll;
int a[150];

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	while(true) {
		long long x = rnd() % mx;
		for(int i = 0; i < 40; ++i) {
			a[i] = rnd() % 150;
		}
		Anna(150, x, 40, a);
		long long y = Bruno(150, mc);
		if(x != y) {
			cout << x << " " << y << endl;
			exit(0);
		} else {
			// cout << "YAY\n" << flush;
		}
	}
	return 0;
}
#endif

Subtask #1

0.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Partially correct	40 ms	2688 KB	Output isn't correct - L* = 0
2	Partially correct	41 ms	2688 KB	Output isn't correct - L* = 0
3	Partially correct	48 ms	2984 KB	Output isn't correct - L* = 0
4	Partially correct	47 ms	2620 KB	Output isn't correct - L* = 0
5	Partially correct	41 ms	2696 KB	Output isn't correct - L* = 0
6	Partially correct	41 ms	2492 KB	Output isn't correct - L* = 0
7	Partially correct	53 ms	2580 KB	Output isn't correct - L* = 0
8	Partially correct	40 ms	2536 KB	Output isn't correct - L* = 0
9	Partially correct	40 ms	2688 KB	Output isn't correct - L* = 0
10	Partially correct	40 ms	2620 KB	Output isn't correct - L* = 0
11	Partially correct	40 ms	2732 KB	Output isn't correct - L* = 0
12	Partially correct	40 ms	2636 KB	Output isn't correct - L* = 0
13	Partially correct	40 ms	2492 KB	Output isn't correct - L* = 0
14	Partially correct	40 ms	2696 KB	Output isn't correct - L* = 0
15	Partially correct	40 ms	2492 KB	Output isn't correct - L* = 0
16	Partially correct	40 ms	2492 KB	Output isn't correct - L* = 0
17	Partially correct	42 ms	2620 KB	Output isn't correct - L* = 0
18	Partially correct	47 ms	2736 KB	Output isn't correct - L* = 0
19	Partially correct	41 ms	2688 KB	Output isn't correct - L* = 0
20	Partially correct	41 ms	2876 KB	Output isn't correct - L* = 0
21	Partially correct	40 ms	2492 KB	Output isn't correct - L* = 0
22	Partially correct	43 ms	2536 KB	Output isn't correct - L* = 0
23	Partially correct	43 ms	2696 KB	Output isn't correct - L* = 0
24	Partially correct	41 ms	2640 KB	Output isn't correct - L* = 0
25	Partially correct	40 ms	2824 KB	Output isn't correct - L* = 0
26	Partially correct	47 ms	2696 KB	Output isn't correct - L* = 0
27	Partially correct	40 ms	2492 KB	Output isn't correct - L* = 0
28	Partially correct	43 ms	2492 KB	Output isn't correct - L* = 0
29	Partially correct	42 ms	2748 KB	Output isn't correct - L* = 0
30	Partially correct	41 ms	2620 KB	Output isn't correct - L* = 0
31	Partially correct	40 ms	2688 KB	Output isn't correct - L* = 0
32	Partially correct	44 ms	2620 KB	Output isn't correct - L* = 0
33	Partially correct	41 ms	2620 KB	Output isn't correct - L* = 0
34	Partially correct	43 ms	2492 KB	Output isn't correct - L* = 0
35	Partially correct	47 ms	2492 KB	Output isn't correct - L* = 0
36	Partially correct	47 ms	2620 KB	Output isn't correct - L* = 0
37	Partially correct	45 ms	2560 KB	Output isn't correct - L* = 0
38	Partially correct	40 ms	2816 KB	Output isn't correct - L* = 0
39	Partially correct	45 ms	2620 KB	Output isn't correct - L* = 0
40	Partially correct	40 ms	2636 KB	Output isn't correct - L* = 0