oj.uz

답안 #946087

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
946087 2024-03-14T10:02:51 Z PenguinsAreCute Vision Program (IOI19_vision) C++17
100 / 100
 13 ms 2000 KB 
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
// i dont think this is the intended solution...

// adds 2 bits. uses 2 instructions and 4 inputs.
vector<int> half_adder(int a, int b) {
	return {add_xor({a,b}),add_and({a,b})};
}
// adds 3 bits. uses 5 instructions and 12 inputs.
vector<int> full_adder(int a, int b, int c) {
	return {add_xor({a,b,c}), add_or({add_and({a,b}),add_and({b,c}),add_and({a,c})})};
}

// adds 2 9-bit integers. uses 42 instructions and 100 inputs.
vector<int> ninebit_add(vector<int> a, vector<int> b) {
	vector<int> ans(9);
	auto v = half_adder(a[0],b[0]);
	int carry = v[1]; ans[0] = v[0];
	for(int i=1;i<9;i++) {
		v = full_adder(a[i],b[i],carry);
		carry = v[1]; ans[i] = v[0];
	}
	return ans;
}
void construct_network(int H, int W, int K) {
	vector<int> x1(9), x2(9), y1(9), y2(9);
	int arr[max(H,W)], arr1[max(H,W)];
	for(int i=0;i<H;i++) {
		vector<int> v;
		for(int j=0;j<W;j++) v.push_back(i*W+j);
		arr[i] = add_or(v);
	}
	arr1[0] = arr[0];
	for(int i=1;i<H;i++) arr1[i] = add_or({arr1[i-1],arr[i]});
	for(int i=0;i<9;i++) {
		vector<int> v;
		for(int j=1;j<H;j++) if((-j)&(1<<i)) v.push_back(add_and({arr1[j],add_not(arr1[j-1])}));
		if(v.size()) x1[i] = add_or(v);
		else x1[i] = add_xor({0,0});
	}
	arr1[H-1] = arr[H-1];
	for(int i=H-1;i--;) arr1[i] = add_or({arr1[i+1],arr[i]});
	for(int i=0;i<9;i++) {
		vector<int> v;
		if((H-1)&(1<<i)) v.push_back(arr1[H-1]);
		for(int j=0;j<H-1;j++) if(j&(1<<i)) v.push_back(add_and({arr1[j],add_not(arr1[j+1])}));
		if(v.size()) x2[i] = add_or(v);
		else x2[i] = add_xor({0,0});
	}

	for(int i=0;i<W;i++) {
		vector<int> v;
		for(int j=0;j<H;j++) v.push_back(j*W+i);
		arr[i] = add_or(v);
	}
	arr1[0] = arr[0];
	for(int i=1;i<W;i++) arr1[i] = add_or({arr1[i-1],arr[i]});
	for(int i=0;i<9;i++) {
		vector<int> v;
		for(int j=1;j<W;j++) if((-j)&(1<<i)) v.push_back(add_and({arr1[j],add_not(arr1[j-1])}));
		if(v.size()) y1[i] = add_or(v);
		else y1[i] = add_xor({0,0});
	}
	arr1[W-1] = arr[W-1];
	for(int i=W-1;i--;) arr1[i] = add_or({arr1[i+1],arr[i]});
	for(int i=0;i<9;i++) {
		vector<int> v;
		if((W-1)&(1<<i)) v.push_back(arr1[W-1]);
		for(int j=0;j<W-1;j++) if(j&(1<<i)) v.push_back(add_and({arr1[j],add_not(arr1[j+1])}));
		if(v.size()) y2[i] = add_or(v);
		else y2[i] = add_xor({0,0});
	}

	vector<int> dist = ninebit_add(ninebit_add(x1,y1),ninebit_add(x2,y2));
	vector<int> v;
	for(int i=0;i<9;i++) v.push_back((K&(1<<i))?dist[i]:add_not(dist[i]));
	add_and(v);
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 432 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 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 344 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 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 432 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 432 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 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 344 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 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 432 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 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 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 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 432 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 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 344 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 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 432 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 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 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 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 600 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 344 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 352 KB Output is correct
37 Correct 1 ms 352 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 432 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 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 344 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 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 432 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 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 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 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 600 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 344 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 352 KB Output is correct
37 Correct 1 ms 352 KB Output is correct
38 Correct 4 ms 856 KB Output is correct
39 Correct 1 ms 608 KB Output is correct
40 Correct 1 ms 436 KB Output is correct
41 Correct 2 ms 604 KB Output is correct
42 Correct 2 ms 612 KB Output is correct
43 Correct 4 ms 812 KB Output is correct
44 Correct 4 ms 860 KB Output is correct
45 Correct 4 ms 860 KB Output is correct
46 Correct 4 ms 932 KB Output is correct
47 Correct 4 ms 856 KB Output is correct

Subtask #5
12.0 / 12.0

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

Subtask #6
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 3 ms 860 KB Output is correct
5 Correct 2 ms 600 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 3 ms 844 KB Output is correct
9 Correct 3 ms 604 KB Output is correct
10 Correct 3 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 2 ms 728 KB Output is correct
14 Correct 2 ms 728 KB Output is correct
15 Correct 2 ms 860 KB Output is correct
16 Correct 2 ms 728 KB Output is correct
17 Correct 3 ms 728 KB Output is correct
18 Correct 2 ms 1008 KB Output is correct
19 Correct 2 ms 980 KB Output is correct
20 Correct 6 ms 1208 KB Output is correct
21 Correct 6 ms 1204 KB Output is correct
22 Correct 6 ms 1112 KB Output is correct
23 Correct 6 ms 1116 KB Output is correct
24 Correct 6 ms 1372 KB Output is correct
25 Correct 6 ms 1368 KB Output is correct
26 Correct 6 ms 1372 KB Output is correct
27 Correct 10 ms 1836 KB Output is correct
28 Correct 10 ms 1748 KB Output is correct
29 Correct 10 ms 1744 KB Output is correct
30 Correct 10 ms 1748 KB Output is correct
31 Correct 10 ms 1748 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 1748 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 3 ms 604 KB Output is correct
5 Correct 2 ms 728 KB Output is correct
6 Correct 2 ms 748 KB Output is correct
7 Correct 6 ms 1116 KB Output is correct
8 Correct 6 ms 1372 KB Output is correct
9 Correct 10 ms 1748 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct

Subtask #8
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 432 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 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 344 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 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 432 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 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 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 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 600 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 344 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 352 KB Output is correct
37 Correct 1 ms 352 KB Output is correct
38 Correct 4 ms 856 KB Output is correct
39 Correct 1 ms 608 KB Output is correct
40 Correct 1 ms 436 KB Output is correct
41 Correct 2 ms 604 KB Output is correct
42 Correct 2 ms 612 KB Output is correct
43 Correct 4 ms 812 KB Output is correct
44 Correct 4 ms 860 KB Output is correct
45 Correct 4 ms 860 KB Output is correct
46 Correct 4 ms 932 KB Output is correct
47 Correct 4 ms 856 KB Output is correct
48 Correct 2 ms 728 KB Output is correct
49 Correct 2 ms 724 KB Output is correct
50 Correct 2 ms 728 KB Output is correct
51 Correct 2 ms 724 KB Output is correct
52 Correct 2 ms 728 KB Output is correct
53 Correct 2 ms 728 KB Output is correct
54 Correct 2 ms 728 KB Output is correct
55 Correct 2 ms 728 KB Output is correct
56 Correct 2 ms 728 KB Output is correct
57 Correct 2 ms 728 KB Output is correct
58 Correct 2 ms 724 KB Output is correct
59 Correct 2 ms 728 KB Output is correct
60 Correct 2 ms 728 KB Output is correct
61 Correct 2 ms 728 KB Output is correct
62 Correct 2 ms 724 KB Output is correct
63 Correct 2 ms 728 KB Output is correct
64 Correct 2 ms 728 KB Output is correct
65 Correct 3 ms 724 KB Output is correct
66 Correct 2 ms 728 KB Output is correct
67 Correct 2 ms 728 KB Output is correct
68 Correct 0 ms 348 KB Output is correct
69 Correct 0 ms 348 KB Output is correct
70 Correct 1 ms 348 KB Output is correct
71 Correct 1 ms 344 KB Output is correct
72 Correct 2 ms 604 KB Output is correct
73 Correct 3 ms 860 KB Output is correct
74 Correct 2 ms 600 KB Output is correct
75 Correct 2 ms 604 KB Output is correct
76 Correct 2 ms 604 KB Output is correct
77 Correct 3 ms 844 KB Output is correct
78 Correct 3 ms 604 KB Output is correct
79 Correct 3 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 2 ms 728 KB Output is correct
83 Correct 2 ms 728 KB Output is correct
84 Correct 2 ms 860 KB Output is correct
85 Correct 2 ms 728 KB Output is correct
86 Correct 3 ms 728 KB Output is correct
87 Correct 2 ms 1008 KB Output is correct
88 Correct 2 ms 980 KB Output is correct
89 Correct 6 ms 1208 KB Output is correct
90 Correct 6 ms 1204 KB Output is correct
91 Correct 6 ms 1112 KB Output is correct
92 Correct 6 ms 1116 KB Output is correct
93 Correct 6 ms 1372 KB Output is correct
94 Correct 6 ms 1368 KB Output is correct
95 Correct 6 ms 1372 KB Output is correct
96 Correct 10 ms 1836 KB Output is correct
97 Correct 10 ms 1748 KB Output is correct
98 Correct 10 ms 1744 KB Output is correct
99 Correct 10 ms 1748 KB Output is correct
100 Correct 10 ms 1748 KB Output is correct
101 Correct 0 ms 348 KB Output is correct
102 Correct 1 ms 348 KB Output is correct
103 Correct 10 ms 1748 KB Output is correct
104 Correct 0 ms 348 KB Output is correct
105 Correct 2 ms 604 KB Output is correct
106 Correct 3 ms 604 KB Output is correct
107 Correct 2 ms 728 KB Output is correct
108 Correct 2 ms 748 KB Output is correct
109 Correct 6 ms 1116 KB Output is correct
110 Correct 6 ms 1372 KB Output is correct
111 Correct 10 ms 1748 KB Output is correct
112 Correct 0 ms 348 KB Output is correct
113 Correct 1 ms 348 KB Output is correct
114 Correct 13 ms 1752 KB Output is correct
115 Correct 2 ms 724 KB Output is correct
116 Correct 2 ms 728 KB Output is correct
117 Correct 6 ms 1116 KB Output is correct
118 Correct 7 ms 1372 KB Output is correct
119 Correct 10 ms 1656 KB Output is correct
120 Correct 10 ms 1744 KB Output is correct
121 Correct 10 ms 1748 KB Output is correct
122 Correct 10 ms 1748 KB Output is correct
123 Correct 10 ms 1832 KB Output is correct
124 Correct 10 ms 2000 KB Output is correct
125 Correct 10 ms 1748 KB Output is correct
126 Correct 10 ms 1748 KB Output is correct
127 Correct 10 ms 2000 KB Output is correct
128 Correct 10 ms 1744 KB Output is correct