Submission #300148

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
300148	2020-09-16T21:08:22 Z	mode149256	Broken Device (JOI17_broken_device)	C++14	0 / 100	1 ms	544 KB

Anna
Bruno

/*input

*/
#include <bits/stdc++.h>
#include "Annalib.h"
using namespace std;

namespace my_template {
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;

typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef vector<pi> vpi;
typedef vector<vpi> vpii;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
typedef vector<pd> vpd;
typedef vector<bool> vb;
typedef vector<vb> vbb;
typedef std::string str;
typedef std::vector<str> vs;

#define x first
#define y second
#define debug(...) cout<<"["<<#__VA_ARGS__<<": "<<__VA_ARGS__<<"]\n"

const ld PI = 3.14159265358979323846264338327950288419716939937510582097494L;

template<typename T>
pair<T, T> operator+(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.x + b.x, a.y + b.y); }
template<typename T>
pair<T, T> operator-(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.x - b.x, a.y - b.y); }
template<typename T>
T operator*(const pair<T, T> &a, const pair<T, T> &b) { return (a.x * b.x + a.y * b.y); }
template<typename T>
T operator^(const pair<T, T> &a, const pair<T, T> &b) { return (a.x * b.y - a.y * b.x); }

template<typename T>
void print(vector<T> vec, string name = "") {
	cout << name;
	for (auto u : vec)
		cout << u << ' ';
	cout << '\n';
}
}
using namespace my_template;

const int MOD = 1000000007;
const ll INF = std::numeric_limits<ll>::max();
const int MX = 100101;

const int LG = 60;

void Anna(int N, ll X, int K, int P[] ) {
	vi geras(N, 1);
	for (int i = 0; i < K; ++i)
		geras[P[i]] = 0;

	vi x;
	for (int i = 0; i < LG; ++i)
	{
		x.emplace_back((X >> i) & 1);
	}

	int j = 0;
	for (int i = 0; i < N; i++) {
		if (i + 1 < N and geras[i] and geras[i + 1] and j < LG) {
			Set(i, 1);
			Set(i + 1, x[j++]);
			i++;
		} else if (i + 1 < N and geras[i] and !geras[i + 1] and j < LG and x[j] == 0) {
			Set(i, 1);
			Set(i + 1, x[j++]);
			i++;
		} else {
			Set(i, 0);
		}
	}
	// printf("in Anna j = %d, lg = %d\n", j, LG);
	assert(j == LG);
}

/*input

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

namespace my_template {
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;

typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef vector<pi> vpi;
typedef vector<vpi> vpii;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
typedef vector<pd> vpd;
typedef vector<bool> vb;
typedef vector<vb> vbb;
typedef std::string str;
typedef std::vector<str> vs;

#define x first
#define y second
#define debug(...) cout<<"["<<#__VA_ARGS__<<": "<<__VA_ARGS__<<"]\n"

const ld PI = 3.14159265358979323846264338327950288419716939937510582097494L;

template<typename T>
pair<T, T> operator+(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.x + b.x, a.y + b.y); }
template<typename T>
pair<T, T> operator-(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.x - b.x, a.y - b.y); }
template<typename T>
T operator*(const pair<T, T> &a, const pair<T, T> &b) { return (a.x * b.x + a.y * b.y); }
template<typename T>
T operator^(const pair<T, T> &a, const pair<T, T> &b) { return (a.x * b.y - a.y * b.x); }

template<typename T>
void print(vector<T> vec, string name = "") {
	cout << name;
	for (auto u : vec)
		cout << u << ' ';
	cout << '\n';
}
}
using namespace my_template;

const int MOD = 1000000007;
const ll INF = std::numeric_limits<ll>::max();
const int MX = 100101;

long long Bruno( int N, int A[] ) {
	ll ats = 0;
	int b = 0;
	for (int i = 0; i < N; ++i)
	{
		if (A[i]) {
			ats |= (A[i + 1] << (b++));
			i++;
		}
	}
	return ats;
}

Subtask #1
0.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	1 ms	512 KB	Execution killed with signal 11
2	Runtime error	1 ms	512 KB	Execution killed with signal 11
3	Runtime error	1 ms	512 KB	Execution killed with signal 11
4	Runtime error	1 ms	512 KB	Execution killed with signal 11
5	Runtime error	1 ms	512 KB	Execution killed with signal 11
6	Runtime error	1 ms	512 KB	Execution killed with signal 11
7	Runtime error	1 ms	544 KB	Execution killed with signal 11
8	Runtime error	1 ms	512 KB	Execution killed with signal 11
9	Runtime error	1 ms	512 KB	Execution killed with signal 11
10	Runtime error	1 ms	512 KB	Execution killed with signal 11
11	Runtime error	1 ms	512 KB	Execution killed with signal 11
12	Runtime error	1 ms	512 KB	Execution killed with signal 11
13	Runtime error	1 ms	512 KB	Execution killed with signal 11
14	Runtime error	1 ms	544 KB	Execution killed with signal 11
15	Runtime error	1 ms	512 KB	Execution killed with signal 11
16	Runtime error	1 ms	512 KB	Execution killed with signal 11
17	Runtime error	1 ms	512 KB	Execution killed with signal 11
18	Runtime error	1 ms	512 KB	Execution killed with signal 11
19	Runtime error	1 ms	512 KB	Execution killed with signal 11
20	Runtime error	1 ms	512 KB	Execution killed with signal 11
21	Runtime error	1 ms	512 KB	Execution killed with signal 11
22	Runtime error	1 ms	512 KB	Execution killed with signal 11
23	Runtime error	1 ms	512 KB	Execution killed with signal 11
24	Runtime error	1 ms	512 KB	Execution killed with signal 11
25	Runtime error	1 ms	512 KB	Execution killed with signal 11
26	Runtime error	1 ms	512 KB	Execution killed with signal 11
27	Runtime error	1 ms	512 KB	Execution killed with signal 11
28	Runtime error	1 ms	512 KB	Execution killed with signal 11
29	Runtime error	1 ms	512 KB	Execution killed with signal 11
30	Runtime error	1 ms	512 KB	Execution killed with signal 11
31	Runtime error	1 ms	512 KB	Execution killed with signal 11
32	Runtime error	1 ms	512 KB	Execution killed with signal 11
33	Runtime error	1 ms	512 KB	Execution killed with signal 11
34	Runtime error	1 ms	512 KB	Execution killed with signal 11
35	Runtime error	1 ms	512 KB	Execution killed with signal 11
36	Runtime error	1 ms	512 KB	Execution killed with signal 11
37	Runtime error	1 ms	512 KB	Execution killed with signal 11
38	Runtime error	1 ms	512 KB	Execution killed with signal 11
39	Runtime error	1 ms	512 KB	Execution killed with signal 11
40	Runtime error	1 ms	512 KB	Execution killed with signal 11

Submission #300148

Compilation message

Subtask #1 0.0 / 100.0

Subtask #1
0.0 / 100.0