oj.uz

답안 #834664

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
834664 2023-08-22T16:45:35 Z tranxuanbach Vision Program (IOI19_vision) C++17
100 / 100
 38 ms 4468 KB 
#include "vision.h"

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

const int N = 2e2 + 5, M = 1e4 + 5;

int n, m, k;

int cnt_dia;
vector <int> query;

int offset_tmp;

int offset_original;
int zero, one;
int offset_maindia; // y - x
int offset_antidia; // y + x

int offset_k_maindia;
int offset_k_antidia;
int offset_kn1_maindia;
int offset_kn1_antidia;

int same_maindia;
int same_antidia;
int within_k;
int within_kn1;

void construct_network(int _n, int _m, int _k){
	n = _n; m = _m; k = _k;

	cnt_dia = n + m - 1;

	offset_original = 0;
	query = {offset_original + (0 * m + 0), add_not(offset_original + (0 * m + 0))};
	zero = add_and(query);
	one = add_or(query);

	offset_maindia = one + 1 - (0 - (n - 1));
	for (int dia = 0 - (n - 1); dia <= (m - 1) - 0; dia++){
		query.clear();
		for (int y = 0; y < m; y++){
			int x = y - dia;
			if (not (0 <= x and x < n)){
				continue;
			}
			query.emplace_back(offset_original + (x * m + y));
		}
		add_xor(query);
	}
	offset_antidia = offset_maindia + ((m - 1) - 0) + 1 - (0 + 0);
	for (int dia = 0 + 0; dia <= (n - 1) + (m - 1); dia++){
		query.clear();
		for (int y = 0; y < m; y++){
			int x = dia - y;
			if (not (0 <= x and x < n)){
				continue;
			}
			query.emplace_back(offset_original + (x * m + y));
		}
		add_xor(query);
	}

	offset_tmp = offset_antidia + ((n - 1) + (m - 1)) + 1 - (0 - (n - 1));
	for (int dia = 0 - (n - 1); dia <= (m - 1) - 0; dia++){
		query = {zero};
		for (int dia2 = dia + 1; dia2 <= min(dia + k, (m - 1) - 0); dia2++){
			query.emplace_back(offset_maindia + dia2);
		}
		add_or(query);
	}
	offset_k_maindia = offset_tmp + ((m - 1) - 0) + 1 - (0 - (n - 1));
	for (int dia = 0 - (n - 1); dia <= (m - 1) - 0; dia++){
		query = {offset_maindia + dia, offset_tmp + dia};
		add_and(query);
	}
	offset_tmp = offset_k_maindia + ((m - 1) - 0) + 1 - (0 + 0);
	for (int dia = 0 + 0; dia <= (n - 1) + (m - 1); dia++){
		query = {zero};
		for (int dia2 = dia + 1; dia2 <= min(dia + k, (n - 1) + (m - 1)); dia2++){
			query.emplace_back(offset_antidia + dia2);
		}
		add_or(query);
	}
	offset_k_antidia = offset_tmp + ((n - 1) + (m - 1)) + 1 - (0 + 0);
	for (int dia = 0 + 0; dia <= (n - 1) + (m - 1); dia++){
		query = {offset_antidia + dia, offset_tmp + dia};
		add_and(query);
	}

	offset_tmp = offset_k_antidia + ((n - 1) + (m - 1)) + 1 - (0 - (n - 1));
	for (int dia = 0 - (n - 1); dia <= (m - 1) - 0; dia++){
		query = {zero};
		for (int dia2 = dia + 1; dia2 <= min(dia + (k - 1), (m - 1) - 0); dia2++){
			query.emplace_back(offset_maindia + dia2);
		}
		add_or(query);
	}
	offset_kn1_maindia = offset_tmp + ((m - 1) - 0) + 1 - (0 - (n - 1));
	for (int dia = 0 - (n - 1); dia <= (m - 1) - 0; dia++){
		query = {offset_maindia + dia, offset_tmp + dia};
		add_and(query);
	}
	offset_tmp = offset_kn1_maindia + ((m - 1) - 0) + 1 - (0 + 0);
	for (int dia = 0 + 0; dia <= (n - 1) + (m - 1); dia++){
		query = {zero};
		for (int dia2 = dia + 1; dia2 <= min(dia + (k - 1), (n - 1) + (m - 1)); dia2++){
			query.emplace_back(offset_antidia + dia2);
		}
		add_or(query);
	}
	offset_kn1_antidia = offset_tmp + ((n - 1) + (m - 1)) + 1 - (0 + 0);
	for (int dia = 0 + 0; dia <= (n - 1) + (m - 1); dia++){
		query = {offset_antidia + dia, offset_tmp + dia};
		add_and(query);
	}

	offset_tmp = offset_kn1_antidia + ((n - 1) + (m - 1)) + 1 - (0);
	query = {};
	for (int dia = 0 - (n - 1); dia <= (m - 1) - 0; dia++){
		query.emplace_back(offset_maindia + dia);
	}
	add_or(query);
	same_maindia = add_not(offset_tmp + 0);
	offset_tmp = same_maindia + 1 - (0);
	query = {};
	for (int dia = 0; dia <= (n - 1) + (m - 1); dia++){
		query.emplace_back(offset_antidia + dia);
	}
	add_or(query);
	same_antidia = add_not(offset_tmp + 0);

	offset_tmp = same_antidia + 1 - (0);
	query = {same_maindia};
	for (int dia = 0 - (n - 1); dia <= (m - 1) - 0; dia++){
		query.emplace_back(offset_k_maindia + dia);
	}
	add_or(query);
	query = {same_antidia};
	for (int dia = 0; dia <= (n - 1) + (m - 1); dia++){
		query.emplace_back(offset_k_antidia + dia);
	}
	add_or(query);
	query = {offset_tmp + 0, offset_tmp + 1};
	within_k = add_and(query);

	offset_tmp = within_k + 1 - (0);
	query = {same_maindia};
	for (int dia = 0 - (n - 1); dia <= (m - 1) - 0; dia++){
		query.emplace_back(offset_kn1_maindia + dia);
	}
	add_or(query);
	query = {same_antidia};
	for (int dia = 0; dia <= (n - 1) + (m - 1); dia++){
		query.emplace_back(offset_kn1_antidia + dia);
	}
	add_or(query);
	query = {offset_tmp + 0, offset_tmp + 1};
	within_kn1 = add_and(query);

	query = {within_k, add_not(within_kn1)};
	add_and(query);
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 256 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 256 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 5 ms 852 KB Output is correct
39 Correct 1 ms 412 KB Output is correct
40 Correct 2 ms 468 KB Output is correct
41 Correct 2 ms 468 KB Output is correct
42 Correct 5 ms 852 KB Output is correct
43 Correct 3 ms 596 KB Output is correct
44 Correct 5 ms 844 KB Output is correct
45 Correct 7 ms 1108 KB Output is correct
46 Correct 8 ms 1364 KB Output is correct
47 Correct 10 ms 1404 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 5 ms 852 KB Output is correct
3 Correct 6 ms 872 KB Output is correct
4 Correct 7 ms 980 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 5 ms 684 KB Output is correct
7 Correct 6 ms 980 KB Output is correct
8 Correct 7 ms 1040 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 4 ms 596 KB Output is correct
11 Correct 5 ms 852 KB Output is correct
12 Correct 5 ms 852 KB Output is correct
13 Correct 7 ms 980 KB Output is correct
14 Correct 7 ms 980 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 4 ms 724 KB Output is correct
17 Correct 6 ms 892 KB Output is correct
18 Correct 6 ms 852 KB Output is correct
19 Correct 6 ms 980 KB Output is correct
20 Correct 7 ms 1100 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct

Subtask #6
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 3 ms 596 KB Output is correct
6 Correct 4 ms 724 KB Output is correct
7 Correct 4 ms 668 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 4 ms 704 KB Output is correct
10 Correct 5 ms 852 KB Output is correct
11 Correct 6 ms 1008 KB Output is correct
12 Correct 7 ms 1108 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 4 ms 724 KB Output is correct
15 Correct 6 ms 980 KB Output is correct
16 Correct 7 ms 1040 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 6 ms 852 KB Output is correct
19 Correct 7 ms 1036 KB Output is correct
20 Correct 5 ms 928 KB Output is correct
21 Correct 12 ms 1800 KB Output is correct
22 Correct 23 ms 2388 KB Output is correct
23 Correct 18 ms 2700 KB Output is correct
24 Correct 5 ms 876 KB Output is correct
25 Correct 15 ms 2184 KB Output is correct
26 Correct 20 ms 2684 KB Output is correct
27 Correct 8 ms 1304 KB Output is correct
28 Correct 19 ms 2772 KB Output is correct
29 Correct 26 ms 3648 KB Output is correct
30 Correct 32 ms 4232 KB Output is correct
31 Correct 38 ms 4468 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 1332 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 5 ms 836 KB Output is correct
8 Correct 5 ms 940 KB Output is correct
9 Correct 9 ms 1388 KB Output is correct
10 Correct 1 ms 296 KB Output is correct
11 Correct 0 ms 212 KB Output is correct

Subtask #8
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 256 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 5 ms 852 KB Output is correct
39 Correct 1 ms 412 KB Output is correct
40 Correct 2 ms 468 KB Output is correct
41 Correct 2 ms 468 KB Output is correct
42 Correct 5 ms 852 KB Output is correct
43 Correct 3 ms 596 KB Output is correct
44 Correct 5 ms 844 KB Output is correct
45 Correct 7 ms 1108 KB Output is correct
46 Correct 8 ms 1364 KB Output is correct
47 Correct 10 ms 1404 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 5 ms 852 KB Output is correct
50 Correct 6 ms 872 KB Output is correct
51 Correct 7 ms 980 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 5 ms 684 KB Output is correct
54 Correct 6 ms 980 KB Output is correct
55 Correct 7 ms 1040 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 4 ms 596 KB Output is correct
58 Correct 5 ms 852 KB Output is correct
59 Correct 5 ms 852 KB Output is correct
60 Correct 7 ms 980 KB Output is correct
61 Correct 7 ms 980 KB Output is correct
62 Correct 2 ms 340 KB Output is correct
63 Correct 4 ms 724 KB Output is correct
64 Correct 6 ms 892 KB Output is correct
65 Correct 6 ms 852 KB Output is correct
66 Correct 6 ms 980 KB Output is correct
67 Correct 7 ms 1100 KB Output is correct
68 Correct 0 ms 212 KB Output is correct
69 Correct 1 ms 212 KB Output is correct
70 Correct 0 ms 212 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Correct 1 ms 340 KB Output is correct
73 Correct 2 ms 468 KB Output is correct
74 Correct 3 ms 596 KB Output is correct
75 Correct 4 ms 724 KB Output is correct
76 Correct 4 ms 668 KB Output is correct
77 Correct 2 ms 468 KB Output is correct
78 Correct 4 ms 704 KB Output is correct
79 Correct 5 ms 852 KB Output is correct
80 Correct 6 ms 1008 KB Output is correct
81 Correct 7 ms 1108 KB Output is correct
82 Correct 1 ms 340 KB Output is correct
83 Correct 4 ms 724 KB Output is correct
84 Correct 6 ms 980 KB Output is correct
85 Correct 7 ms 1040 KB Output is correct
86 Correct 1 ms 340 KB Output is correct
87 Correct 6 ms 852 KB Output is correct
88 Correct 7 ms 1036 KB Output is correct
89 Correct 5 ms 928 KB Output is correct
90 Correct 12 ms 1800 KB Output is correct
91 Correct 23 ms 2388 KB Output is correct
92 Correct 18 ms 2700 KB Output is correct
93 Correct 5 ms 876 KB Output is correct
94 Correct 15 ms 2184 KB Output is correct
95 Correct 20 ms 2684 KB Output is correct
96 Correct 8 ms 1304 KB Output is correct
97 Correct 19 ms 2772 KB Output is correct
98 Correct 26 ms 3648 KB Output is correct
99 Correct 32 ms 4232 KB Output is correct
100 Correct 38 ms 4468 KB Output is correct
101 Correct 0 ms 212 KB Output is correct
102 Correct 0 ms 212 KB Output is correct
103 Correct 8 ms 1332 KB Output is correct
104 Correct 0 ms 212 KB Output is correct
105 Correct 1 ms 340 KB Output is correct
106 Correct 2 ms 468 KB Output is correct
107 Correct 1 ms 340 KB Output is correct
108 Correct 1 ms 340 KB Output is correct
109 Correct 5 ms 836 KB Output is correct
110 Correct 5 ms 940 KB Output is correct
111 Correct 9 ms 1388 KB Output is correct
112 Correct 1 ms 296 KB Output is correct
113 Correct 0 ms 212 KB Output is correct
114 Correct 19 ms 2744 KB Output is correct
115 Correct 9 ms 980 KB Output is correct
116 Correct 2 ms 468 KB Output is correct
117 Correct 18 ms 2588 KB Output is correct
118 Correct 9 ms 1412 KB Output is correct
119 Correct 26 ms 3584 KB Output is correct
120 Correct 26 ms 3636 KB Output is correct
121 Correct 26 ms 3688 KB Output is correct
122 Correct 27 ms 3740 KB Output is correct
123 Correct 8 ms 1328 KB Output is correct
124 Correct 18 ms 2772 KB Output is correct
125 Correct 26 ms 3660 KB Output is correct
126 Correct 26 ms 3736 KB Output is correct
127 Correct 32 ms 4292 KB Output is correct
128 Correct 34 ms 4436 KB Output is correct