oj.uz

답안 #1002405

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1002405 2024-06-19T14:19:13 Z zsombor Ancient Machine 2 (JOI23_ancient2) C++17
100 / 100
 35 ms 1112 KB 
#include "ancient2.h"
#include <iostream>
#include <vector>
#include <bitset>
using namespace std;

int n, m = 102;
vector <int> ans(1e3, -1);
vector <bitset <1001>> v(1e3);

void get1(int x) {
	vector <int> a(x + 3, 0);
	vector <int> b(x + 3, 0);
	for (int i = 0; i < x; i++) a[i] = b[i] = i + 1;
	a[x] = x + 1;
	b[x] = x + 2;
	a[x + 1] = b[x + 1] = x + 1;
	a[x + 2] = b[x + 2] = x + 2;
	ans[x] = Query(x + 3, a, b) - x - 1;
}

void solve1() {
	for (int i = 0; i < m - 2; i++) get1(i);
}

void get2(int x) {
	vector <int> s(1, -1);
	s.push_back(1);
	for (int i = x + 1; i < n; i++) s.push_back(ans[i]);
	s.push_back(-1);
	int l = s.size() - 2;

	vector <int> pi(l + 1, 0);
	pi[0] = -1;
	for (int i = 1; i <= l; i++) {
		for (int j = pi[i - 1]; j >= 0; j = pi[j]) {
			if (s[i] == s[j + 1]) { pi[i] = j + 1; break; }
		}
	}

	vector <int> a(l + 1, 0);
	vector <int> b(l + 1, 1);
	for (int i = 1; i <= l; i++) {
		a[i] = (s[i + 1] == 0 ? i + 1 : a[pi[i]]);
		b[i] = (s[i + 1] == 1 ? i + 1 : b[pi[i]]);
	}
	ans[x] = (Query(l + 1, a, b) == l);
}

void solve2() {
	for (int i = n - 1; i > n - m; i--) get2(i);
}

int make_query(int p, int q) {
	vector <int> a(2 * p, 0);
	vector <int> b(2 * p, 0);
	for (int i = 0; i < 2 * p; i++) a[i] = b[i] = (i + 1) % p + i / p * p;
	swap(b[q], b[p + q]);
	return (Query(2 * p, a, b) >= p);
}

void try_add(int p, int q) {
	bitset <1001> b;
	for (int i = 0; i < n; i++) b[i] = int(i % p == q);
	b[1000] = 0;
	for (int i = 0; i < n; i++) if (b[i]) b ^= v[i];

	int k = -1;
	for (int i = 0; i < n; i++) if (b[i]) k = i;
	if (k == -1) return;

	b[1000] = int(b[1000]) ^ make_query(p, q);
	for (int i = 0; i < n; i++) if (v[i][k]) v[i] ^= b;
	v[k] = b;
}

void solve3() {
	for (int i = 0; i < n; i++) {
		if (ans[i] == -1) continue;
		v[i][i] = 1;
		v[i][1000] = ans[i];
	}
	for (int i = 1; i <= 60; i++) {
		for (int j = 0; j < i; j++) {
			try_add(i, j);
		}
	}
	for (int i = 0; i < n; i++) ans[i] = v[i][1000];
}

string Solve(int N) {
	n = N;
	solve1();
	solve2();
	solve3();
	string s;
	for (int i = 0; i < n; i++) s.push_back('0' + ans[i]);
	return s;
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 344 KB Output is correct
2 Correct 22 ms 564 KB Output is correct
3 Correct 25 ms 592 KB Output is correct
4 Correct 19 ms 588 KB Output is correct
5 Correct 21 ms 344 KB Output is correct
6 Correct 25 ms 600 KB Output is correct
7 Correct 19 ms 344 KB Output is correct
8 Correct 30 ms 600 KB Output is correct
9 Correct 28 ms 824 KB Output is correct
10 Correct 22 ms 600 KB Output is correct
11 Correct 28 ms 588 KB Output is correct
12 Correct 22 ms 600 KB Output is correct
13 Correct 26 ms 588 KB Output is correct
14 Correct 21 ms 344 KB Output is correct
15 Correct 20 ms 344 KB Output is correct
16 Correct 21 ms 600 KB Output is correct
17 Correct 21 ms 584 KB Output is correct
18 Correct 19 ms 568 KB Output is correct
19 Correct 21 ms 344 KB Output is correct
20 Correct 24 ms 584 KB Output is correct
21 Correct 21 ms 600 KB Output is correct
22 Correct 21 ms 344 KB Output is correct
23 Correct 32 ms 344 KB Output is correct
24 Correct 22 ms 344 KB Output is correct
25 Correct 21 ms 344 KB Output is correct
26 Correct 25 ms 600 KB Output is correct
27 Correct 24 ms 592 KB Output is correct
28 Correct 21 ms 344 KB Output is correct
29 Correct 30 ms 568 KB Output is correct
30 Correct 21 ms 592 KB Output is correct
31 Correct 22 ms 588 KB Output is correct
32 Correct 21 ms 584 KB Output is correct
33 Correct 21 ms 344 KB Output is correct
34 Correct 24 ms 1112 KB Output is correct
35 Correct 29 ms 564 KB Output is correct
36 Correct 33 ms 568 KB Output is correct
37 Correct 31 ms 344 KB Output is correct
38 Correct 25 ms 592 KB Output is correct
39 Correct 22 ms 604 KB Output is correct
40 Correct 28 ms 824 KB Output is correct
41 Correct 29 ms 568 KB Output is correct
42 Correct 25 ms 848 KB Output is correct
43 Correct 21 ms 568 KB Output is correct
44 Correct 22 ms 344 KB Output is correct
45 Correct 24 ms 584 KB Output is correct
46 Correct 26 ms 600 KB Output is correct
47 Correct 29 ms 600 KB Output is correct
48 Correct 23 ms 580 KB Output is correct
49 Correct 25 ms 824 KB Output is correct
50 Correct 23 ms 572 KB Output is correct
51 Correct 23 ms 600 KB Output is correct
52 Correct 22 ms 568 KB Output is correct
53 Correct 35 ms 600 KB Output is correct
54 Correct 26 ms 572 KB Output is correct
55 Correct 27 ms 564 KB Output is correct
56 Correct 22 ms 600 KB Output is correct
57 Correct 22 ms 592 KB Output is correct
58 Correct 21 ms 344 KB Output is correct
59 Correct 22 ms 600 KB Output is correct
60 Correct 21 ms 344 KB Output is correct
61 Correct 21 ms 588 KB Output is correct
62 Correct 22 ms 592 KB Output is correct
63 Correct 23 ms 344 KB Output is correct