oj.uz

Submission #147135

# Submission time Handle Problem Language Result Execution time Memory
147135 2019-08-27T22:36:02 Z Mamnoon_Siam Vision Program (IOI19_vision) C++17
100 / 100
 15 ms 1524 KB 
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;

const int maxn = 202;

int H, W, K;
int one, zero;

int cell(int i, int j) {
	return i * W + j;
}

vector<int> binary_addition(vector<int> A, vector<int> B) {
	int carry = zero;
	vector<int> ret;
	int len = max(A.size(), B.size()) + 1;
	while(A.size() < len) A.emplace_back(zero);
	while(B.size() < len) B.emplace_back(zero);
	for(int i = 0; i < len - 1; i++) {
		ret.emplace_back(add_xor({carry, A[i], B[i]}));
		int ab = add_and({carry, A[i]});
		int bc = add_and({A[i], B[i]});
		int ca = add_and({carry, B[i]});
		carry = add_or({ab, bc, ca});
	} ret.emplace_back(carry);
	return ret;
}

void construct_network(int _H, int _W, int _K) {
	H = _H, W = _W, K = _K;
	if(H * W == 2) {
		one = 0;
		zero = add_not(one);
	} else {
		zero = add_and({0, 1, 2});
		one = add_not(zero);
	}
	vector<int> R_prefix, C_prefix;
	{
		int prev = zero;
		for(int i = 0; i < H - 1; i++) {
			vector<int> tmp;
			for(int j = 0; j < W; j++) {
				tmp.emplace_back(cell(i, j));
			}
			tmp.emplace_back(prev);
			R_prefix.emplace_back(add_xor(tmp));
			prev = R_prefix.back();
		}
		R_prefix.emplace_back(zero);
	}
	{
		int prev = zero;
		for(int j = 0; j < W - 1; j++) {
			vector<int> tmp;
			for(int i = 0; i < H; i++) {
				tmp.emplace_back(cell(i, j));
			}
			tmp.emplace_back(prev);
			C_prefix.emplace_back(add_xor(tmp));
			prev = C_prefix.back();
		}
		C_prefix.emplace_back(zero);
	}
	vector<int> R_sum;
	for(int i = 0; i < H - 1; i++) {
		vector<int> tmp;
		int carry = R_prefix[i];
		for(int j = 0; j < R_sum.size(); j++) {
			tmp.emplace_back(add_xor({carry, R_sum[j]}));
			carry = add_and({carry, R_sum[j]});
		}
		if(tmp.size() < 32 - __builtin_clz(i + 1)) {
			tmp.emplace_back(carry);
		}
		R_sum = tmp;
	}
	vector<int> C_sum;
	for(int i = 0; i < W - 1; i++) {
		vector<int> tmp;
		int carry = C_prefix[i];
		for(int j = 0; j < C_sum.size(); j++) {
			tmp.emplace_back(add_xor({carry, C_sum[j]}));
			carry = add_and({carry, C_sum[j]});
		}
		if(tmp.size() < 32 - __builtin_clz(i + 1)) {
			tmp.emplace_back(carry);
		}
		C_sum = tmp;
	}

	vector<int> tot = binary_addition(R_sum, C_sum);

	vector<int> allzero, allone;
	for(int i = 0; i < tot.size(); i++) {
		if(K & (1 << i)) {
			allzero.emplace_back(add_xor({one, tot[i]}));
		} else {
			allzero.emplace_back(add_xor({zero, tot[i]}));
		}
	}
	for(int i = 0; i < allzero.size(); i++) {
		allone.emplace_back(add_not(allzero[i]));
	}
	add_and(allone);
}

Compilation message

vision.cpp: In function 'std::vector<int> binary_addition(std::vector<int>, std::vector<int>)':
vision.cpp:18:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while(A.size() < len) A.emplace_back(zero);
        ~~~~~~~~~^~~~~
vision.cpp:19:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while(B.size() < len) B.emplace_back(zero);
        ~~~~~~~~~^~~~~
vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:70:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int j = 0; j < R_sum.size(); j++) {
                  ~~^~~~~~~~~~~~~~
vision.cpp:74:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(tmp.size() < 32 - __builtin_clz(i + 1)) {
      ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
vision.cpp:83:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int j = 0; j < C_sum.size(); j++) {
                  ~~^~~~~~~~~~~~~~
vision.cpp:87:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(tmp.size() < 32 - __builtin_clz(i + 1)) {
      ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
vision.cpp:96:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < tot.size(); i++) {
                 ~~^~~~~~~~~~~~
vision.cpp:103:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < allzero.size(); i++) {
                 ~~^~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 252 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 256 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 256 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 312 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 3 ms 376 KB Output is correct
35 Correct 3 ms 380 KB Output is correct
36 Correct 3 ms 376 KB Output is correct
37 Correct 3 ms 376 KB Output is correct
38 Correct 6 ms 760 KB Output is correct
39 Correct 3 ms 504 KB Output is correct
40 Correct 3 ms 504 KB Output is correct
41 Correct 4 ms 504 KB Output is correct
42 Correct 4 ms 504 KB Output is correct
43 Correct 5 ms 760 KB Output is correct
44 Correct 6 ms 760 KB Output is correct
45 Correct 6 ms 760 KB Output is correct
46 Correct 5 ms 760 KB Output is correct
47 Correct 6 ms 760 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 504 KB Output is correct
2 Correct 4 ms 632 KB Output is correct
3 Correct 4 ms 504 KB Output is correct
4 Correct 4 ms 760 KB Output is correct
5 Correct 4 ms 504 KB Output is correct
6 Correct 4 ms 636 KB Output is correct
7 Correct 3 ms 504 KB Output is correct
8 Correct 4 ms 504 KB Output is correct
9 Correct 4 ms 632 KB Output is correct
10 Correct 3 ms 632 KB Output is correct
11 Correct 4 ms 632 KB Output is correct
12 Correct 4 ms 632 KB Output is correct
13 Correct 4 ms 504 KB Output is correct
14 Correct 4 ms 632 KB Output is correct
15 Correct 4 ms 504 KB Output is correct
16 Correct 5 ms 504 KB Output is correct
17 Correct 4 ms 504 KB Output is correct
18 Correct 3 ms 504 KB Output is correct
19 Correct 4 ms 504 KB Output is correct
20 Correct 4 ms 632 KB Output is correct
21 Correct 2 ms 256 KB Output is correct
22 Correct 2 ms 376 KB Output is correct

Subtask #6
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 3 ms 504 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 3 ms 504 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 3 ms 504 KB Output is correct
8 Correct 4 ms 632 KB Output is correct
9 Correct 4 ms 676 KB Output is correct
10 Correct 5 ms 632 KB Output is correct
11 Correct 4 ms 632 KB Output is correct
12 Correct 4 ms 632 KB Output is correct
13 Correct 4 ms 504 KB Output is correct
14 Correct 4 ms 632 KB Output is correct
15 Correct 4 ms 632 KB Output is correct
16 Correct 4 ms 632 KB Output is correct
17 Correct 4 ms 632 KB Output is correct
18 Correct 4 ms 632 KB Output is correct
19 Correct 4 ms 632 KB Output is correct
20 Correct 9 ms 1012 KB Output is correct
21 Correct 9 ms 1012 KB Output is correct
22 Correct 9 ms 1012 KB Output is correct
23 Correct 9 ms 1012 KB Output is correct
24 Correct 8 ms 1012 KB Output is correct
25 Correct 9 ms 1012 KB Output is correct
26 Correct 8 ms 1012 KB Output is correct
27 Correct 14 ms 1524 KB Output is correct
28 Correct 13 ms 1524 KB Output is correct
29 Correct 14 ms 1524 KB Output is correct
30 Correct 14 ms 1524 KB Output is correct
31 Correct 14 ms 1524 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 1524 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 3 ms 380 KB Output is correct
4 Correct 5 ms 632 KB Output is correct
5 Correct 4 ms 508 KB Output is correct
6 Correct 4 ms 504 KB Output is correct
7 Correct 9 ms 1008 KB Output is correct
8 Correct 9 ms 1012 KB Output is correct
9 Correct 14 ms 1520 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 256 KB Output is correct

Subtask #8
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 252 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 256 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 256 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 312 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 3 ms 376 KB Output is correct
35 Correct 3 ms 380 KB Output is correct
36 Correct 3 ms 376 KB Output is correct
37 Correct 3 ms 376 KB Output is correct
38 Correct 6 ms 760 KB Output is correct
39 Correct 3 ms 504 KB Output is correct
40 Correct 3 ms 504 KB Output is correct
41 Correct 4 ms 504 KB Output is correct
42 Correct 4 ms 504 KB Output is correct
43 Correct 5 ms 760 KB Output is correct
44 Correct 6 ms 760 KB Output is correct
45 Correct 6 ms 760 KB Output is correct
46 Correct 5 ms 760 KB Output is correct
47 Correct 6 ms 760 KB Output is correct
48 Correct 4 ms 504 KB Output is correct
49 Correct 4 ms 632 KB Output is correct
50 Correct 4 ms 504 KB Output is correct
51 Correct 4 ms 760 KB Output is correct
52 Correct 4 ms 504 KB Output is correct
53 Correct 4 ms 636 KB Output is correct
54 Correct 3 ms 504 KB Output is correct
55 Correct 4 ms 504 KB Output is correct
56 Correct 4 ms 632 KB Output is correct
57 Correct 3 ms 632 KB Output is correct
58 Correct 4 ms 632 KB Output is correct
59 Correct 4 ms 632 KB Output is correct
60 Correct 4 ms 504 KB Output is correct
61 Correct 4 ms 632 KB Output is correct
62 Correct 4 ms 504 KB Output is correct
63 Correct 5 ms 504 KB Output is correct
64 Correct 4 ms 504 KB Output is correct
65 Correct 3 ms 504 KB Output is correct
66 Correct 4 ms 504 KB Output is correct
67 Correct 4 ms 632 KB Output is correct
68 Correct 2 ms 256 KB Output is correct
69 Correct 2 ms 376 KB Output is correct
70 Correct 2 ms 256 KB Output is correct
71 Correct 2 ms 380 KB Output is correct
72 Correct 3 ms 504 KB Output is correct
73 Correct 3 ms 504 KB Output is correct
74 Correct 3 ms 504 KB Output is correct
75 Correct 3 ms 504 KB Output is correct
76 Correct 3 ms 504 KB Output is correct
77 Correct 4 ms 632 KB Output is correct
78 Correct 4 ms 676 KB Output is correct
79 Correct 5 ms 632 KB Output is correct
80 Correct 4 ms 632 KB Output is correct
81 Correct 4 ms 632 KB Output is correct
82 Correct 4 ms 504 KB Output is correct
83 Correct 4 ms 632 KB Output is correct
84 Correct 4 ms 632 KB Output is correct
85 Correct 4 ms 632 KB Output is correct
86 Correct 4 ms 632 KB Output is correct
87 Correct 4 ms 632 KB Output is correct
88 Correct 4 ms 632 KB Output is correct
89 Correct 9 ms 1012 KB Output is correct
90 Correct 9 ms 1012 KB Output is correct
91 Correct 9 ms 1012 KB Output is correct
92 Correct 9 ms 1012 KB Output is correct
93 Correct 8 ms 1012 KB Output is correct
94 Correct 9 ms 1012 KB Output is correct
95 Correct 8 ms 1012 KB Output is correct
96 Correct 14 ms 1524 KB Output is correct
97 Correct 13 ms 1524 KB Output is correct
98 Correct 14 ms 1524 KB Output is correct
99 Correct 14 ms 1524 KB Output is correct
100 Correct 14 ms 1524 KB Output is correct
101 Correct 2 ms 376 KB Output is correct
102 Correct 2 ms 376 KB Output is correct
103 Correct 13 ms 1524 KB Output is correct
104 Correct 2 ms 380 KB Output is correct
105 Correct 3 ms 380 KB Output is correct
106 Correct 5 ms 632 KB Output is correct
107 Correct 4 ms 508 KB Output is correct
108 Correct 4 ms 504 KB Output is correct
109 Correct 9 ms 1008 KB Output is correct
110 Correct 9 ms 1012 KB Output is correct
111 Correct 14 ms 1520 KB Output is correct
112 Correct 2 ms 376 KB Output is correct
113 Correct 2 ms 256 KB Output is correct
114 Correct 14 ms 1524 KB Output is correct
115 Correct 4 ms 504 KB Output is correct
116 Correct 4 ms 632 KB Output is correct
117 Correct 9 ms 1012 KB Output is correct
118 Correct 9 ms 1012 KB Output is correct
119 Correct 14 ms 1524 KB Output is correct
120 Correct 14 ms 1524 KB Output is correct
121 Correct 15 ms 1524 KB Output is correct
122 Correct 14 ms 1520 KB Output is correct
123 Correct 14 ms 1524 KB Output is correct
124 Correct 14 ms 1524 KB Output is correct
125 Correct 13 ms 1524 KB Output is correct
126 Correct 14 ms 1524 KB Output is correct
127 Correct 14 ms 1524 KB Output is correct
128 Correct 14 ms 1524 KB Output is correct