oj.uz

Submission #549315

# Submission time Handle Problem Language Result Execution time Memory
549315 2022-04-15T15:19:01 Z jesus_coconut Vision Program (IOI19_vision) C++17
100 / 100
 18 ms 1608 KB 
#include <bits/stdc++.h>
#include "vision.h"
#define pb push_back
#define eb emplace_back

using namespace std;

int h, w, k;

void consLine(int H, int W, int K) {
	vector<int> v;
	for (int i = 0; i + K < max(H, W); ++i) {
		v.pb(add_and({i, i + K}));
	}
	add_or(v);
}

vector<int> getRows() {
	vector<int> ret(h);
	vector<int> tmp(w);
	for (int i = 0; i < h; ++i) {
		for (int j = 0; j < w; ++j) {
			tmp[j] = w * i + j;
		}
		ret[i] = add_xor(tmp);
	}
	return ret;
}

vector<int> getCols() {
	vector<int> ret(w), tmp(h);
	for (int j = 0; j < w; ++j) {
		for (int i = 0; i < h; ++i) {
			tmp[i] = w * i + j;
		}
		ret[j] = add_xor(tmp);
	}
	return ret;
}

void solvek1() {
	auto rows = getRows();
	auto cols = getCols();
	vector<int> adjRows, adjCols;
	for (int i = 0; i + 1 < size(rows); ++i) adjRows.eb(add_and({rows[i], rows[i+1]}));
	for (int i = 0; i + 1 < size(cols); ++i) adjCols.eb(add_and({cols[i], cols[i+1]}));
	int x = add_or(adjRows);
	int y = add_or(adjCols);
	int a = add_xor({x, y});
	int z1 = add_xor(rows);
	int z2 = add_xor(cols);
	int b = add_xor({z1, z2});
	add_and({a, b});
}

vector<int> pref_xor(vector<int> const &v) {
	vector<int> ret;
	ret.pb(v.front());
	for (int i = 1; i < size(v); ++i) {
		ret.pb(add_xor({v[i], ret[i - 1]}));
	}
	return ret;
}

int zero;

vector<int> calcSum(vector<int> &a, vector<int> &b) {
	vector<int> ret;
	int carry = zero;
	a.resize(max(size(a), size(b)), zero);
	b.resize(max(size(a), size(b)), zero);
	for (int i = 0; i < size(a); ++i) {
		ret.pb(add_xor({a[i], b[i], carry}));
		int tmp = add_or({a[i], b[i], carry});
		int tmp2 = add_and({a[i], b[i], carry});
		int nb = add_not(ret.back());
		int tmp3 = add_or({tmp2, nb});
		carry = add_and({tmp, tmp3});
	}
	ret.pb(carry);
	return ret;
}

vector<int> getSum(vector<int> const &v, int l, int r) {
	if (r - l == 1) return {v[l]};
	if (r - l <= 0) return {zero};
	int m = (r + l) / 2;
	auto x = getSum(v, l, m);
	auto y = getSum(v, m, r);
	return calcSum(x, y);
}


void construct_network(int H, int W, int K) {
	h = H;
	w = W;
	k = K;
	if (min(H, W) == 1) {
		consLine(H, W, K);
		return;
	}
	int tmp = add_not(0);
	zero = add_and({0, tmp});
	auto v = pref_xor(getRows());
	for (auto a : pref_xor(getCols())) v.pb(a);
	auto s = getSum(v, 0, size(v));
	for (int i = 0; i < size(s); ++i) {
		if (((k >> i) & 1) == 0) {
			s[i] = add_not(s[i]);
		}
	}
	add_and(s);
}

Compilation message

vision.cpp: In function 'void solvek1()':
vision.cpp:45:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |  for (int i = 0; i + 1 < size(rows); ++i) adjRows.eb(add_and({rows[i], rows[i+1]}));
      |                  ~~~~~~^~~~~~~~~~~~
vision.cpp:46:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |  for (int i = 0; i + 1 < size(cols); ++i) adjCols.eb(add_and({cols[i], cols[i+1]}));
      |                  ~~~~~~^~~~~~~~~~~~
vision.cpp: In function 'std::vector<int> pref_xor(const std::vector<int>&)':
vision.cpp:59:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |  for (int i = 1; i < size(v); ++i) {
      |                  ~~^~~~~~~~~
vision.cpp: In function 'std::vector<int> calcSum(std::vector<int>&, std::vector<int>&)':
vision.cpp:72:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |  for (int i = 0; i < size(a); ++i) {
      |                  ~~^~~~~~~~~
vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:107:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  107 |  for (int i = 0; i < size(s); ++i) {
      |                  ~~^~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory 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 300 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory 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 300 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 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 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 300 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory 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 300 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 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 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 300 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 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

# Verdict Execution time Memory 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 300 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 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 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 300 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 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 4 ms 724 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 3 ms 556 KB Output is correct
42 Correct 5 ms 596 KB Output is correct
43 Correct 6 ms 724 KB Output is correct
44 Correct 4 ms 724 KB Output is correct
45 Correct 4 ms 684 KB Output is correct
46 Correct 4 ms 724 KB Output is correct
47 Correct 4 ms 724 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 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 0 ms 212 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 0 ms 212 KB Output is correct
13 Correct 1 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 1 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 0 ms 212 KB Output is correct
22 Correct 0 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 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 424 KB Output is correct
6 Correct 3 ms 468 KB Output is correct
7 Correct 2 ms 468 KB Output is correct
8 Correct 3 ms 596 KB Output is correct
9 Correct 3 ms 556 KB Output is correct
10 Correct 3 ms 596 KB Output is correct
11 Correct 3 ms 596 KB Output is correct
12 Correct 4 ms 552 KB Output is correct
13 Correct 1 ms 296 KB Output is correct
14 Correct 1 ms 300 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 9 ms 1068 KB Output is correct
21 Correct 8 ms 976 KB Output is correct
22 Correct 9 ms 980 KB Output is correct
23 Correct 7 ms 1064 KB Output is correct
24 Correct 7 ms 976 KB Output is correct
25 Correct 7 ms 928 KB Output is correct
26 Correct 7 ms 956 KB Output is correct
27 Correct 12 ms 1568 KB Output is correct
28 Correct 12 ms 1580 KB Output is correct
29 Correct 12 ms 1488 KB Output is correct
30 Correct 12 ms 1568 KB Output is correct
31 Correct 12 ms 1608 KB Output is correct
32 Correct 0 ms 304 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 1516 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 3 ms 596 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 7 ms 1004 KB Output is correct
8 Correct 7 ms 1064 KB Output is correct
9 Correct 14 ms 1488 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct

Subtask #8
19.0 / 19.0

# Verdict Execution time Memory 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 300 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 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 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 300 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 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 4 ms 724 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 3 ms 556 KB Output is correct
42 Correct 5 ms 596 KB Output is correct
43 Correct 6 ms 724 KB Output is correct
44 Correct 4 ms 724 KB Output is correct
45 Correct 4 ms 684 KB Output is correct
46 Correct 4 ms 724 KB Output is correct
47 Correct 4 ms 724 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 308 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 0 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 1 ms 212 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 0 ms 212 KB Output is correct
56 Correct 1 ms 212 KB Output is correct
57 Correct 1 ms 212 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 1 ms 212 KB Output is correct
61 Correct 0 ms 212 KB Output is correct
62 Correct 1 ms 212 KB Output is correct
63 Correct 1 ms 212 KB Output is correct
64 Correct 0 ms 212 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 0 ms 212 KB Output is correct
67 Correct 0 ms 212 KB Output is correct
68 Correct 0 ms 212 KB Output is correct
69 Correct 0 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 468 KB Output is correct
73 Correct 2 ms 468 KB Output is correct
74 Correct 2 ms 424 KB Output is correct
75 Correct 3 ms 468 KB Output is correct
76 Correct 2 ms 468 KB Output is correct
77 Correct 3 ms 596 KB Output is correct
78 Correct 3 ms 556 KB Output is correct
79 Correct 3 ms 596 KB Output is correct
80 Correct 3 ms 596 KB Output is correct
81 Correct 4 ms 552 KB Output is correct
82 Correct 1 ms 296 KB Output is correct
83 Correct 1 ms 300 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 0 ms 212 KB Output is correct
86 Correct 1 ms 212 KB Output is correct
87 Correct 1 ms 212 KB Output is correct
88 Correct 1 ms 212 KB Output is correct
89 Correct 9 ms 1068 KB Output is correct
90 Correct 8 ms 976 KB Output is correct
91 Correct 9 ms 980 KB Output is correct
92 Correct 7 ms 1064 KB Output is correct
93 Correct 7 ms 976 KB Output is correct
94 Correct 7 ms 928 KB Output is correct
95 Correct 7 ms 956 KB Output is correct
96 Correct 12 ms 1568 KB Output is correct
97 Correct 12 ms 1580 KB Output is correct
98 Correct 12 ms 1488 KB Output is correct
99 Correct 12 ms 1568 KB Output is correct
100 Correct 12 ms 1608 KB Output is correct
101 Correct 0 ms 304 KB Output is correct
102 Correct 1 ms 212 KB Output is correct
103 Correct 10 ms 1516 KB Output is correct
104 Correct 0 ms 212 KB Output is correct
105 Correct 2 ms 468 KB Output is correct
106 Correct 3 ms 596 KB Output is correct
107 Correct 1 ms 212 KB Output is correct
108 Correct 1 ms 212 KB Output is correct
109 Correct 7 ms 1004 KB Output is correct
110 Correct 7 ms 1064 KB Output is correct
111 Correct 14 ms 1488 KB Output is correct
112 Correct 1 ms 212 KB Output is correct
113 Correct 1 ms 212 KB Output is correct
114 Correct 12 ms 1572 KB Output is correct
115 Correct 0 ms 212 KB Output is correct
116 Correct 1 ms 212 KB Output is correct
117 Correct 6 ms 1068 KB Output is correct
118 Correct 7 ms 976 KB Output is correct
119 Correct 11 ms 1576 KB Output is correct
120 Correct 11 ms 1500 KB Output is correct
121 Correct 18 ms 1548 KB Output is correct
122 Correct 12 ms 1560 KB Output is correct
123 Correct 11 ms 1488 KB Output is correct
124 Correct 11 ms 1572 KB Output is correct
125 Correct 12 ms 1556 KB Output is correct
126 Correct 14 ms 1576 KB Output is correct
127 Correct 14 ms 1576 KB Output is correct
128 Correct 12 ms 1572 KB Output is correct