Submission #715722

#	Time	Username	Problem	Language	Result	Execution time	Memory
715722		valerikk	Broken Device (JOI17_broken_device)	C++17	69 / 100	45 ms	2412 KiB

Anna

#include "Annalib.h"
#include <bits/stdc++.h>

using namespace std;

void Anna( int N, long long X, int K, int P[] ){
	mt19937 rnd(239);
	vector<int> ord(N);
	iota(ord.begin(), ord.end(), 0);
	shuffle(ord.begin(), ord.end(), rnd);
	vector<int> bad(N, 0);
	for (int i = 0; i < K; ++i) {
		bad[P[i]] = 1;
	}
	vector<int> a(N, 0);
	for (int i = 0; i + 2 < N; i += 3) {
		if (!bad[ord[i]] && !bad[ord[i + 1]] && !bad[ord[i + 2]]) {
			int mask = X % 7 + 1;
			for (int j = 0; j < 3; ++j) {
				a[ord[i + j]] = (mask >> j) & 1;
			}
			X /= 7;
		}
	}
	for (int i = 0; i < N; ++i) {
		Set(i, a[i]);
	}
}

Bruno

#include "Brunolib.h"
#include <bits/stdc++.h>

using namespace std;

long long Bruno( int N, int A[] ){
	mt19937 rnd(239);
	vector<int> ord(N);
	iota(ord.begin(), ord.end(), 0);
	shuffle(ord.begin(), ord.end(), rnd);
	long long X = 0;
	vector<int> digits;
	for (int i = 0; i + 2 < N; i += 3) {
		if (A[ord[i]] || A[ord[i + 1]] || A[ord[i + 2]]) {
			int mask = 0;
			for (int j = 2; j >= 0; --j) {
				mask = mask * 2 + A[ord[i + j]];
			}
			digits.push_back(mask - 1);
		}
	}
	reverse(digits.begin(), digits.end());
	for (int d : digits) {
		X = X * 7 + d;
	}
	return X;
}

• Subtask 1: 69 / 100