oj.uz

Submission #749767

# Submission time Handle Problem Language Result Execution time Memory
749767 2023-05-28T13:00:20 Z Alan Vision Program (IOI19_vision) C++17
100 / 100
 11 ms 1488 KB 
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;

int id, id0, id1;
vector<vector<int>> bruh;

vector<int> extract(vector<int> bits, int guard_id, int x) {
	vector<vector<int>> t (8);
	for (int i = 0; i < x; i++) {
		for (int j = 0; j < 8; j++) if (i & (1<<j)) t[j].push_back(add_and({guard_id, bits[i]}));
		guard_id = add_xor({guard_id, bits[i]});
	}
	vector<int> res (8, id0);
	for (int i = 0; i < 8; i++) if (!t[i].empty()) res[i] = add_or(t[i]);
	return res;
}

vector<int> add (vector<int> a, vector<int> b) {
	int sz = a.size();
	vector<int> res, carry {id0};
	for (int i = 0; i < sz; i++) {
		int xor_id = add_xor({a[i], b[i]});
		res.push_back(add_xor({xor_id, carry[i]}));
		carry.push_back(add_or({add_and({a[i], b[i]}), add_and({xor_id, carry[i]})}));
	}
	res.push_back(carry.back());
	return res;
}

vector<int> neg (vector<int> bits) {
	int sz = bits.size();
	vector<int> t, one {id1};
	for (int i = 0; i < sz; i++) t.push_back(add_not(bits[i]));
	for (int i = 1; i < sz; i++) one.push_back(id0);
	vector<int> res = add(t, one);
	res.pop_back();
	return res;
}

vector<int> proc(vector<int> ids, int x) {
	int guard_id = id1;
	vector<int> pos_id1 = extract(ids, guard_id, x);
	guard_id = id0;
	vector<int> pos_id2 = extract(ids, guard_id, x);
	pos_id1 = neg(pos_id1);
	vector<int> res = add(pos_id1, pos_id2);
	res.pop_back();
	return res;
}

void construct_network(int H, int W, int K) {
	id = H*W;
	vector<int> rid, cid;
	for (int i = 0; i < H; i++) {
		vector<int> v;
		for (int j = i*W; j < (i+1)*W; j++) v.push_back(j);
		rid.push_back(add_xor(v));
	}
	for (int i = 0; i < W; i++) {
		vector<int> v;
		for (int j = i; j < H*W; j += W) v.push_back(j);
		cid.push_back(add_xor(v));
	}
	id0 = add_and({0, add_not(0)});
	id1 = add_not(id0);
	vector<int> diffr = proc(rid, H), diffc = proc(cid, W);
	vector<int> diff = add(diffr, diffc);
	K--;
	vector<int> kid;
	for (int i = 0; i < 9; i++) kid.push_back((K & (1<<i)) ? id0 : id1);
	vector<int> res = add(diff, kid);
	res.pop_back();
	int ans_inv = add_or(res);
	add_not(ans_inv);
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 296 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 304 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 296 KB Output is correct
18 Correct 1 ms 304 KB Output is correct

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 296 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 304 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 296 KB Output is correct
18 Correct 1 ms 304 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 296 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 276 KB Output is correct
29 Correct 1 ms 304 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 300 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 296 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 300 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 296 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 304 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 296 KB Output is correct
18 Correct 1 ms 304 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 296 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 276 KB Output is correct
29 Correct 1 ms 304 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 300 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 296 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 300 KB Output is correct
38 Correct 4 ms 724 KB Output is correct
39 Correct 2 ms 428 KB Output is correct
40 Correct 1 ms 428 KB Output is correct
41 Correct 3 ms 428 KB Output is correct
42 Correct 3 ms 468 KB Output is correct
43 Correct 4 ms 680 KB Output is correct
44 Correct 3 ms 668 KB Output is correct
45 Correct 3 ms 680 KB Output is correct
46 Correct 4 ms 724 KB Output is correct
47 Correct 3 ms 684 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 468 KB Output is correct
2 Correct 2 ms 552 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 556 KB Output is correct
7 Correct 3 ms 468 KB Output is correct
8 Correct 2 ms 508 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 2 ms 488 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 2 ms 556 KB Output is correct
15 Correct 2 ms 552 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct

Subtask #6
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 2 ms 424 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 424 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 3 ms 468 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 3 ms 468 KB Output is correct
11 Correct 4 ms 468 KB Output is correct
12 Correct 3 ms 560 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 2 ms 560 KB Output is correct
15 Correct 3 ms 552 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 2 ms 556 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 6 ms 980 KB Output is correct
21 Correct 6 ms 980 KB Output is correct
22 Correct 6 ms 980 KB Output is correct
23 Correct 7 ms 944 KB Output is correct
24 Correct 7 ms 984 KB Output is correct
25 Correct 6 ms 980 KB Output is correct
26 Correct 8 ms 892 KB Output is correct
27 Correct 10 ms 1360 KB Output is correct
28 Correct 10 ms 1360 KB Output is correct
29 Correct 10 ms 1392 KB Output is correct
30 Correct 11 ms 1360 KB Output is correct
31 Correct 11 ms 1360 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 1368 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 2 ms 556 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 6 ms 940 KB Output is correct
8 Correct 8 ms 980 KB Output is correct
9 Correct 10 ms 1360 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 2 ms 300 KB Output is correct

Subtask #8
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 296 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 304 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 296 KB Output is correct
18 Correct 1 ms 304 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 296 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 276 KB Output is correct
29 Correct 1 ms 304 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 300 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 296 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 300 KB Output is correct
38 Correct 4 ms 724 KB Output is correct
39 Correct 2 ms 428 KB Output is correct
40 Correct 1 ms 428 KB Output is correct
41 Correct 3 ms 428 KB Output is correct
42 Correct 3 ms 468 KB Output is correct
43 Correct 4 ms 680 KB Output is correct
44 Correct 3 ms 668 KB Output is correct
45 Correct 3 ms 680 KB Output is correct
46 Correct 4 ms 724 KB Output is correct
47 Correct 3 ms 684 KB Output is correct
48 Correct 2 ms 468 KB Output is correct
49 Correct 2 ms 552 KB Output is correct
50 Correct 2 ms 468 KB Output is correct
51 Correct 2 ms 468 KB Output is correct
52 Correct 2 ms 468 KB Output is correct
53 Correct 2 ms 556 KB Output is correct
54 Correct 3 ms 468 KB Output is correct
55 Correct 2 ms 508 KB Output is correct
56 Correct 2 ms 468 KB Output is correct
57 Correct 2 ms 468 KB Output is correct
58 Correct 2 ms 488 KB Output is correct
59 Correct 2 ms 468 KB Output is correct
60 Correct 2 ms 468 KB Output is correct
61 Correct 2 ms 556 KB Output is correct
62 Correct 2 ms 552 KB Output is correct
63 Correct 2 ms 468 KB Output is correct
64 Correct 2 ms 468 KB Output is correct
65 Correct 2 ms 468 KB Output is correct
66 Correct 2 ms 468 KB Output is correct
67 Correct 2 ms 468 KB Output is correct
68 Correct 1 ms 212 KB Output is correct
69 Correct 1 ms 212 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Correct 2 ms 424 KB Output is correct
73 Correct 2 ms 468 KB Output is correct
74 Correct 2 ms 424 KB Output is correct
75 Correct 2 ms 468 KB Output is correct
76 Correct 2 ms 468 KB Output is correct
77 Correct 3 ms 468 KB Output is correct
78 Correct 2 ms 468 KB Output is correct
79 Correct 3 ms 468 KB Output is correct
80 Correct 4 ms 468 KB Output is correct
81 Correct 3 ms 560 KB Output is correct
82 Correct 2 ms 468 KB Output is correct
83 Correct 2 ms 560 KB Output is correct
84 Correct 3 ms 552 KB Output is correct
85 Correct 2 ms 468 KB Output is correct
86 Correct 2 ms 556 KB Output is correct
87 Correct 2 ms 468 KB Output is correct
88 Correct 2 ms 468 KB Output is correct
89 Correct 6 ms 980 KB Output is correct
90 Correct 6 ms 980 KB Output is correct
91 Correct 6 ms 980 KB Output is correct
92 Correct 7 ms 944 KB Output is correct
93 Correct 7 ms 984 KB Output is correct
94 Correct 6 ms 980 KB Output is correct
95 Correct 8 ms 892 KB Output is correct
96 Correct 10 ms 1360 KB Output is correct
97 Correct 10 ms 1360 KB Output is correct
98 Correct 10 ms 1392 KB Output is correct
99 Correct 11 ms 1360 KB Output is correct
100 Correct 11 ms 1360 KB Output is correct
101 Correct 1 ms 212 KB Output is correct
102 Correct 1 ms 212 KB Output is correct
103 Correct 10 ms 1368 KB Output is correct
104 Correct 1 ms 296 KB Output is correct
105 Correct 2 ms 468 KB Output is correct
106 Correct 3 ms 468 KB Output is correct
107 Correct 2 ms 556 KB Output is correct
108 Correct 2 ms 468 KB Output is correct
109 Correct 6 ms 940 KB Output is correct
110 Correct 8 ms 980 KB Output is correct
111 Correct 10 ms 1360 KB Output is correct
112 Correct 1 ms 212 KB Output is correct
113 Correct 2 ms 300 KB Output is correct
114 Correct 11 ms 1416 KB Output is correct
115 Correct 3 ms 520 KB Output is correct
116 Correct 2 ms 468 KB Output is correct
117 Correct 6 ms 980 KB Output is correct
118 Correct 7 ms 980 KB Output is correct
119 Correct 10 ms 1436 KB Output is correct
120 Correct 11 ms 1360 KB Output is correct
121 Correct 10 ms 1488 KB Output is correct
122 Correct 10 ms 1360 KB Output is correct
123 Correct 10 ms 1400 KB Output is correct
124 Correct 10 ms 1384 KB Output is correct
125 Correct 10 ms 1360 KB Output is correct
126 Correct 11 ms 1444 KB Output is correct
127 Correct 11 ms 1448 KB Output is correct
128 Correct 10 ms 1452 KB Output is correct