oj.uz

Submission #966457

# Submission time Handle Problem Language Result Execution time Memory
966457 2024-04-19T23:33:14 Z pavement Ancient Machine (JOI21_ancient_machine) C++17
97 / 100
 48 ms 8288 KB 
#include "Anna.h"
#include <bits/stdc++.h>
using namespace std;

using ull = unsigned long long;

#define pb push_back

const int BLK_SZ = 90;

void Anna(int N, vector<char> S) {
	int first_X = -1;
	vector<bool> positions(N);
	vector<ull> fib(BLK_SZ + 5);
	fib[0] = fib[1] = 1;
	for (int i = 2; i < BLK_SZ + 5; i++) {
		fib[i] = fib[i - 1] + fib[i - 2];
	}
	for (int i = 0; i < N; i++) {
		if (S[i] == 'X' && first_X == -1) {
			first_X = i;
		} else if (first_X == -1) {
			continue;
		} else if (S[i] == 'Z') {
			assert(i);
			if (positions[i - 1] == 1) {
				positions[i - 1] = 0;
			}
			positions[i] = 1;
		}
	}
	for (int i = 0; i < N; i += BLK_SZ) {
		int r = min(N, i + BLK_SZ);
		// [i, r)
		ull cur = 0;
		for (int j = i; j < r; j++) {
			if (positions[j]) {
				cur += fib[r - j];
			}
		}
		for (int j = 0; j < 64; j++) {
			Send(!!(cur & (1ll << j)));
		}
	}
	for (int j = 0; j < 17; j++) {
		Send(!!((first_X + 1) & (1ll << j)));
	}
}

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

using ull = unsigned long long;

#define pb push_back

const int BLK_SZ = 90;

void Bruno(int N, int L, vector<int> A) {
	int first_X = 0;
	vector<bool> positions(N);
	vector<ull> fib(BLK_SZ + 5);
	fib[0] = fib[1] = 1;
	for (int i = 2; i < BLK_SZ + 5; i++) {
		fib[i] = fib[i - 1] + fib[i - 2];
	}
	for (int j = L - 17; j < L; j++) {
		if (A[j]) {
			first_X |= (1 << (j - (L - 17)));
		}
	}
	first_X--;
	if (first_X == -1) {
		for (int i = 0; i < N; i++) {
			Remove(i);
		}
		return;
	}
	for (int i = 0, l = 0; i < L - 17; i += 64, l += BLK_SZ) {
		int r = min(N, l + BLK_SZ);
		ull cur = 0;
		for (int j = i; j < min(L, i + 64); j++) {
			if (A[j]) {
				cur |= (1ll << (j - i));
			}
		}
		// [l, r)
		for (int j = l; j < r; j++) {
			if (fib[r - j] > cur) {
				positions[j] = 0;
			} else {
				positions[j] = 1;
				cur -= fib[r - j];
				j++;
			}
		}
	}
	for (int i = 0; i < first_X; i++) {
		Remove(i);
	}
	vector<int> buf;
	for (int i = first_X + 1; i < N; i++) {
		if (positions[i]) {
			while (!buf.empty()) {
				Remove(buf.back());
				buf.pop_back();
			}
			Remove(i);
		} else {
			buf.pb(i);
		}
	}
	buf.pb(first_X);
	while (!buf.empty()) {
		Remove(buf.back());
		buf.pop_back();
	}
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 784 KB Output is correct
2 Correct 0 ms 784 KB Output is correct
3 Correct 0 ms 784 KB Output is correct
4 Correct 0 ms 784 KB Output is correct
5 Correct 1 ms 784 KB Output is correct
6 Correct 0 ms 784 KB Output is correct
7 Correct 0 ms 800 KB Output is correct
8 Correct 0 ms 784 KB Output is correct
9 Correct 1 ms 784 KB Output is correct
10 Correct 0 ms 796 KB Output is correct
11 Correct 0 ms 796 KB Output is correct

Subtask #2
92.0 / 95.0

# Verdict Execution time Memory Grader output
1 Partially correct 42 ms 8148 KB Partially correct
2 Partially correct 41 ms 7904 KB Partially correct
3 Partially correct 36 ms 8008 KB Partially correct
4 Partially correct 36 ms 7968 KB Partially correct
5 Partially correct 37 ms 7940 KB Partially correct
6 Partially correct 38 ms 8028 KB Partially correct
7 Partially correct 46 ms 8028 KB Partially correct
8 Partially correct 36 ms 7856 KB Partially correct
9 Partially correct 38 ms 8276 KB Partially correct
10 Partially correct 37 ms 8164 KB Partially correct
11 Partially correct 40 ms 8092 KB Partially correct
12 Partially correct 37 ms 7940 KB Partially correct
13 Partially correct 43 ms 7952 KB Partially correct
14 Partially correct 42 ms 8056 KB Partially correct
15 Partially correct 38 ms 8288 KB Partially correct
16 Partially correct 38 ms 8180 KB Partially correct
17 Partially correct 42 ms 8020 KB Partially correct
18 Partially correct 42 ms 7924 KB Partially correct
19 Partially correct 41 ms 7920 KB Partially correct
20 Partially correct 43 ms 8216 KB Partially correct
21 Partially correct 36 ms 7852 KB Partially correct
22 Partially correct 42 ms 7932 KB Partially correct
23 Partially correct 36 ms 8252 KB Partially correct
24 Partially correct 41 ms 8260 KB Partially correct
25 Partially correct 48 ms 7972 KB Partially correct
26 Partially correct 42 ms 8284 KB Partially correct
27 Partially correct 41 ms 7940 KB Partially correct
28 Partially correct 41 ms 8264 KB Partially correct
29 Partially correct 41 ms 8156 KB Partially correct
30 Partially correct 42 ms 7732 KB Partially correct
31 Partially correct 41 ms 7932 KB Partially correct
32 Partially correct 38 ms 7932 KB Partially correct
33 Partially correct 43 ms 8160 KB Partially correct