oj.uz

Submission #871343

# Submission time Handle Problem Language Result Execution time Memory
871343 2023-11-10T15:23:50 Z hgmhc Vision Program (IOI19_vision) C++17
100 / 100
 28 ms 3800 KB 
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;

int No() {
	return add_xor({0,0});
}
int Yes() {
	return add_not(add_xor({0,0}));
}

int solve(int H, int W, int K) {
	
	auto get1 = [&](int x) {
		int i, j;
		vi res;
		for (i=0, j=x; i<H; ++i, --j) {
			if (0 <= j && j < W) {
				res.push_back(i*W+j);
			}
		}
		return res;
	};
	
	auto get2 = [&](int x) {
		int i, j;
		vi res;
		for (i=0, j=W-1-x; i<H; ++i, ++j) {
			if (0 <= j && j < W) {
				res.push_back(i*W+j);
			}
		}
		return res;
	};
	
	vi candidate_conditions;
	
	for (int k = 0; k < H+W; ++k) {
		vi A = get1(k), B = get1(k+K);
		if (empty(A) || empty(B)) continue;
		
		int a = add_xor(A), b = add_xor(B);
		candidate_conditions.push_back(add_and({a,b}));
	}
	
	for (int k = 0; k < H+W; ++k) {
		vi A = get2(k), B = get2(k+K);
		if (empty(A) || empty(B)) continue;
		
		int a = add_xor(A), b = add_xor(B);
		candidate_conditions.push_back(add_and({a,b}));
	}
	
	if (empty(candidate_conditions)) return No();
	return add_or(candidate_conditions);
}

void construct_network(int H, int W, int K) {
	
	auto hor_box = [&] {
		vi res;
		vi P(H), Q(H);
		for (int i=0; i<H; ++i) {
			vi box;
			for (int j=0; j<W; ++j) box.push_back(i*W+j);
			P[i] = add_or(box);
			Q[i] = add_xor(box);
		}
		for (int i=1; i<H; ++i) {
			P[i] = add_or({P[i-1], P[i]});
			Q[i] = add_xor({Q[i-1], Q[i]});
		}
		for (int k=0; k+K<H; ++k) {
			vi box;
			int x = P[k+K];
			if (k) x = add_xor({x,P[k-1]});
			int y = Q[k+K];
			if (k) y = add_xor({y,Q[k-1]});
			
			res.push_back( add_and({ x, add_not(y) }) );
		}
		if (empty(res)) return Yes();
		return add_or(res);
	};
	
	auto ver_box = [&] {
		vi res;
		vi P(W), Q(W);
		for (int i=0; i<W; ++i) {
			vi box;
			for (int j=0; j<H; ++j) box.push_back(j*W+i);
			P[i] = add_or(box);
			Q[i] = add_xor(box);
		}
		for (int i=1; i<W; ++i) {
			P[i] = add_or({P[i-1], P[i]});
			Q[i] = add_xor({Q[i-1], Q[i]});
		}
		for (int k=0; k+K<W; ++k) {
			vi box;
			int x = P[k+K];
			if (k) x = add_xor({x,P[k-1]});
			int y = Q[k+K];
			if (k) y = add_xor({y,Q[k-1]});
			
			res.push_back( add_and({ x, add_not(y) }) );
		}
		if (empty(res)) return Yes();
		return add_or(res);
	};
	
	int condition1 = add_and({ ver_box(), hor_box() });
	int condition2 = solve(H,W,K);
	
	add_and({condition1,condition2});
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 380 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 380 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 380 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 380 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 7 ms 1116 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 4 ms 928 KB Output is correct
42 Correct 2 ms 604 KB Output is correct
43 Correct 8 ms 1116 KB Output is correct
44 Correct 7 ms 1112 KB Output is correct
45 Correct 6 ms 860 KB Output is correct
46 Correct 4 ms 860 KB Output is correct
47 Correct 4 ms 636 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 344 KB Output is correct

Subtask #6
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 3 ms 612 KB Output is correct
4 Correct 2 ms 608 KB Output is correct
5 Correct 2 ms 600 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 5 ms 860 KB Output is correct
9 Correct 5 ms 860 KB Output is correct
10 Correct 4 ms 604 KB Output is correct
11 Correct 3 ms 604 KB Output is correct
12 Correct 3 ms 604 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 17 ms 2088 KB Output is correct
21 Correct 13 ms 1880 KB Output is correct
22 Correct 9 ms 1372 KB Output is correct
23 Correct 7 ms 1168 KB Output is correct
24 Correct 15 ms 2004 KB Output is correct
25 Correct 11 ms 1584 KB Output is correct
26 Correct 7 ms 1116 KB Output is correct
27 Correct 28 ms 3792 KB Output is correct
28 Correct 27 ms 3404 KB Output is correct
29 Correct 21 ms 2892 KB Output is correct
30 Correct 16 ms 2136 KB Output is correct
31 Correct 14 ms 1880 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 3792 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 3 ms 604 KB Output is correct
4 Correct 5 ms 860 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 17 ms 2008 KB Output is correct
8 Correct 15 ms 2008 KB Output is correct
9 Correct 28 ms 3788 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct

Subtask #8
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 380 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 7 ms 1116 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 4 ms 928 KB Output is correct
42 Correct 2 ms 604 KB Output is correct
43 Correct 8 ms 1116 KB Output is correct
44 Correct 7 ms 1112 KB Output is correct
45 Correct 6 ms 860 KB Output is correct
46 Correct 4 ms 860 KB Output is correct
47 Correct 4 ms 636 KB Output is correct
48 Correct 2 ms 604 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 1 ms 604 KB Output is correct
53 Correct 1 ms 600 KB Output is correct
54 Correct 1 ms 348 KB Output is correct
55 Correct 1 ms 348 KB Output is correct
56 Correct 1 ms 600 KB Output is correct
57 Correct 1 ms 604 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 1 ms 600 KB Output is correct
61 Correct 1 ms 348 KB Output is correct
62 Correct 1 ms 604 KB Output is correct
63 Correct 1 ms 604 KB Output is correct
64 Correct 1 ms 348 KB Output is correct
65 Correct 1 ms 348 KB Output is correct
66 Correct 1 ms 348 KB Output is correct
67 Correct 1 ms 348 KB Output is correct
68 Correct 0 ms 344 KB Output is correct
69 Correct 0 ms 344 KB Output is correct
70 Correct 0 ms 348 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 3 ms 612 KB Output is correct
73 Correct 2 ms 608 KB Output is correct
74 Correct 2 ms 600 KB Output is correct
75 Correct 2 ms 604 KB Output is correct
76 Correct 1 ms 348 KB Output is correct
77 Correct 5 ms 860 KB Output is correct
78 Correct 5 ms 860 KB Output is correct
79 Correct 4 ms 604 KB Output is correct
80 Correct 3 ms 604 KB Output is correct
81 Correct 3 ms 604 KB Output is correct
82 Correct 1 ms 600 KB Output is correct
83 Correct 1 ms 604 KB Output is correct
84 Correct 1 ms 344 KB Output is correct
85 Correct 1 ms 348 KB Output is correct
86 Correct 1 ms 604 KB Output is correct
87 Correct 1 ms 348 KB Output is correct
88 Correct 1 ms 348 KB Output is correct
89 Correct 17 ms 2088 KB Output is correct
90 Correct 13 ms 1880 KB Output is correct
91 Correct 9 ms 1372 KB Output is correct
92 Correct 7 ms 1168 KB Output is correct
93 Correct 15 ms 2004 KB Output is correct
94 Correct 11 ms 1584 KB Output is correct
95 Correct 7 ms 1116 KB Output is correct
96 Correct 28 ms 3792 KB Output is correct
97 Correct 27 ms 3404 KB Output is correct
98 Correct 21 ms 2892 KB Output is correct
99 Correct 16 ms 2136 KB Output is correct
100 Correct 14 ms 1880 KB Output is correct
101 Correct 1 ms 348 KB Output is correct
102 Correct 0 ms 348 KB Output is correct
103 Correct 28 ms 3792 KB Output is correct
104 Correct 0 ms 348 KB Output is correct
105 Correct 3 ms 604 KB Output is correct
106 Correct 5 ms 860 KB Output is correct
107 Correct 1 ms 604 KB Output is correct
108 Correct 2 ms 604 KB Output is correct
109 Correct 17 ms 2008 KB Output is correct
110 Correct 15 ms 2008 KB Output is correct
111 Correct 28 ms 3788 KB Output is correct
112 Correct 0 ms 348 KB Output is correct
113 Correct 0 ms 348 KB Output is correct
114 Correct 26 ms 3460 KB Output is correct
115 Correct 1 ms 344 KB Output is correct
116 Correct 1 ms 604 KB Output is correct
117 Correct 8 ms 1112 KB Output is correct
118 Correct 14 ms 2136 KB Output is correct
119 Correct 21 ms 2896 KB Output is correct
120 Correct 20 ms 2892 KB Output is correct
121 Correct 21 ms 2908 KB Output is correct
122 Correct 21 ms 2900 KB Output is correct
123 Correct 28 ms 3800 KB Output is correct
124 Correct 26 ms 3544 KB Output is correct
125 Correct 21 ms 2896 KB Output is correct
126 Correct 20 ms 2908 KB Output is correct
127 Correct 16 ms 2140 KB Output is correct
128 Correct 15 ms 1884 KB Output is correct