oj.uz

Submission #169553

# Submission time Handle Problem Language Result Execution time Memory
169553 2019-12-20T23:47:07 Z BessieTheCow Vision Program (IOI19_vision) C++17
100 / 100
 12 ms 1404 KB 
#include "vision.h"
#include <vector>

using namespace std;

constexpr int bits = 9;

int n, m, k, zero, one, rowor, color, rmax, rmin, cmax, cmin;

int flatten(int x, int y)
{
	return x * m + y;
}

int maxset(int begin, int ln, int startpos)
{
	add_or({ begin + ln - 1 });
	for (int i = 1, j = begin + ln - 2; i < ln; i++, j--)
	{
		add_or({ j, startpos + i - 1 });
	}
	for (int i = ln - 1; i >= 0; i--)
	{
		add_not({ startpos + i });
	}
	startpos += ln;
	for (int i = 0; i < ln - 1; i++)
	{
		add_and({ startpos + i + 1, begin + i });
	}
	add_and({ begin + ln - 1 });
	startpos += ln;
	return startpos;
}

int bwnot(int begin, int ln, int startpos)
{
	for (int i = 0; i < ln; i++)
	{
		add_not(begin + i);
	}
	return startpos;
}

int bwand(int begin1, int begin2, int ln, int startpos)
{
	for (int i = 0; i < ln; i++)
	{
		add_and({ begin1 + i, begin2 + i });
	}
	return startpos;
}

int bwor(int begin1, int begin2, int ln, int startpos)
{
	for (int i = 0; i < ln; i++)
	{
		add_or({ begin1 + i, begin2 + i });
	}
	return startpos;
}

int bwxor(int begin1, int begin2, int ln, int startpos)
{
	for (int i = 0; i < ln; i++)
	{
		add_xor({ begin1 + i, begin2 + i });
	}
	return startpos;
}

int bitindex(int begin, int ln, int startpos)
{
	for (int b = 0; b < bits; b++)
	{
		vector<int> inputs;
		inputs.reserve(ln / 2);
		for (int i = begin; i < begin + ln;)
		{
			if ((i - begin) & (1 << b))
			{
				inputs.push_back(i);
				i++;
			}
			else
			{
				i += 1 << b;
			}
		}
		if (inputs.empty())
		{
			add_xor({ 0, 0 });
		}
		else
		{
			add_or(inputs);
		}
	}
	return startpos;
}

int gate(int begin, int ln, int condition, int startpos)
{
	for (int i = 0; i < ln; i++)
	{
		add_and({ begin + i, condition });
	}
	return startpos;
}

int halfadder(int x1, int x2, int startpos)
{
	add_xor({ x1, x2 });
	add_and({ x1, x2 });
	return startpos;
}

int fulladder(int x1, int x2, int carry, int startpos)
{
	startpos = halfadder(x1, x2, startpos);
	add_and({ startpos, carry });
	add_xor({ startpos, carry });
	add_or({ startpos + 1, startpos + 2 });
	startpos += 3;
	return startpos;
}

int adder(int begin1, int begin2, int startpos)
{
	startpos = halfadder(begin1, begin2, startpos);
	vector<int> positions;
	positions.reserve(bits);
	positions.push_back(startpos);
	for (int i = 1; i < bits; i++)
	{
		startpos = fulladder(begin1 + i, begin2 + i, startpos + 1, startpos + 2);
		positions.push_back(startpos);
	}
	startpos += 2;
	for (int pos : positions)
	{
		add_or({ pos });
	}
	return startpos;
}

int increment(int begin, int startpos)
{
	startpos = halfadder(begin, one, startpos);
	vector<int> positions;
	positions.reserve(bits);
	positions.push_back(startpos);
	for (int i = 1; i < bits; i++)
	{
		startpos = halfadder(begin + i, startpos + 1, startpos + 2);
		positions.push_back(startpos);
	}
	startpos += 2;
	for (int pos : positions)
	{
		add_or({ pos });
	}
	return startpos;
}

int negator(int begin, int startpos)
{
	startpos = bwnot(begin, bits, startpos);
	startpos = increment(startpos, startpos + bits);
	return startpos;
}

int subtract(int begin1, int begin2, int startpos)
{
	startpos = negator(begin2, startpos);
	startpos = adder(startpos, begin1, startpos + bits);
	return startpos;
}

int allxor(int begin, int ln, int startpos)
{
	vector<int> inputs;
	inputs.reserve(ln);
	for (int i = 0; i < ln; i++)
	{
		inputs.push_back(begin + i);
	}
	add_xor(inputs);
	return startpos;
}

int compare(int begin, int x, int startpos)
{
	vector<int> inputs;
	for (int i = 0; i < bits; i++)
	{
		if (x & (1 << i))
		{
			inputs.push_back(add_or({ begin + i }));
		}
		else
		{
			inputs.push_back(add_not(begin + i));
		}
	}
	return add_and(inputs);
}

void construct_network(int N, int M, int K)
{
	n = N;
	m = M;
	k = K;
	zero = add_xor({ 0, 0 });
	one = add_not(zero);
	rowor = one + 1;
	color = rowor + n;
	for (int i = 0; i < n; i++)
	{
		vector<int> row;
		row.reserve(m);
		for (int j = 0; j < m; j++)
		{
			row.push_back(flatten(i, j));
		}
		add_or(row);
	}
	for (int j = 0; j < m; j++)
	{
		vector<int> col;
		col.reserve(n);
		for (int i = 0; i < n; i++)
		{
			col.push_back(flatten(i, j));
		}
		add_or(col);
	}
	int rmaxset = maxset(rowor, n, color + m);
	int cmaxset = maxset(color, m, rmaxset + n);
	int notrmaxset = bwnot(rmaxset, n, cmaxset + m);
	int notcmaxset = bwnot(cmaxset, m, notrmaxset + n);
	int rminset = bwand(rowor, notrmaxset, n, notcmaxset + m);
	int cminset = bwand(color, notcmaxset, m, rminset + n);
	int rmaxindex = bitindex(rmaxset, n, cminset + m);
	int cmaxindex = bitindex(cmaxset, m, rmaxindex + bits);
	int rminindex = bitindex(rminset, n, cmaxindex + bits);
	int cminindex = bitindex(cminset, m, rminindex + bits);
	int rdiff = subtract(rmaxindex, rminindex, cminindex + bits);
	int rxor = allxor(rowor, n, rdiff + bits);
	int rcond = add_not(rxor);
	rdiff = gate(rdiff, bits, rcond, rcond + 1);
	int cdiff = subtract(cmaxindex, cminindex, rdiff + bits);
	int cxor = allxor(color, m, cdiff + bits);
	int ccond = add_not(cxor);
	cdiff = gate(cdiff, bits, ccond, ccond + 1);
	int distance = adder(rdiff, cdiff, cdiff + bits);
	compare(distance, k, distance + bits);
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 252 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 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 376 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 376 KB Output is correct
17 Correct 2 ms 380 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 252 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 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 376 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 376 KB Output is correct
17 Correct 2 ms 380 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 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 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 252 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 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 376 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 376 KB Output is correct
17 Correct 2 ms 380 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 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 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 296 KB Output is correct
31 Correct 2 ms 380 KB Output is correct
32 Correct 2 ms 380 KB Output is correct
33 Correct 2 ms 348 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 376 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 252 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 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 376 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 376 KB Output is correct
17 Correct 2 ms 380 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 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 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 296 KB Output is correct
31 Correct 2 ms 380 KB Output is correct
32 Correct 2 ms 380 KB Output is correct
33 Correct 2 ms 348 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 376 KB Output is correct
38 Correct 5 ms 632 KB Output is correct
39 Correct 2 ms 376 KB Output is correct
40 Correct 2 ms 376 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 632 KB Output is correct
44 Correct 5 ms 632 KB Output is correct
45 Correct 5 ms 636 KB Output is correct
46 Correct 5 ms 632 KB Output is correct
47 Correct 5 ms 632 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 3 ms 504 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 504 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 504 KB Output is correct
12 Correct 3 ms 504 KB Output is correct
13 Correct 3 ms 504 KB Output is correct
14 Correct 3 ms 504 KB Output is correct
15 Correct 3 ms 484 KB Output is correct
16 Correct 3 ms 376 KB Output is correct
17 Correct 3 ms 504 KB Output is correct
18 Correct 3 ms 376 KB Output is correct
19 Correct 3 ms 504 KB Output is correct
20 Correct 3 ms 376 KB Output is correct
21 Correct 2 ms 376 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 376 KB Output is correct
2 Correct 2 ms 376 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 504 KB Output is correct
9 Correct 4 ms 504 KB Output is correct
10 Correct 4 ms 504 KB Output is correct
11 Correct 4 ms 504 KB Output is correct
12 Correct 4 ms 504 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 504 KB Output is correct
16 Correct 3 ms 504 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 3 ms 380 KB Output is correct
19 Correct 3 ms 504 KB Output is correct
20 Correct 7 ms 888 KB Output is correct
21 Correct 7 ms 888 KB Output is correct
22 Correct 7 ms 888 KB Output is correct
23 Correct 7 ms 888 KB Output is correct
24 Correct 8 ms 888 KB Output is correct
25 Correct 8 ms 888 KB Output is correct
26 Correct 7 ms 892 KB Output is correct
27 Correct 12 ms 1400 KB Output is correct
28 Correct 12 ms 1400 KB Output is correct
29 Correct 12 ms 1400 KB Output is correct
30 Correct 12 ms 1400 KB Output is correct
31 Correct 12 ms 1400 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 12 ms 1292 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 3 ms 552 KB Output is correct
4 Correct 4 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 7 ms 888 KB Output is correct
8 Correct 7 ms 888 KB Output is correct
9 Correct 11 ms 1400 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct

Subtask #8
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 252 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 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 376 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 376 KB Output is correct
17 Correct 2 ms 380 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 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 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 296 KB Output is correct
31 Correct 2 ms 380 KB Output is correct
32 Correct 2 ms 380 KB Output is correct
33 Correct 2 ms 348 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 376 KB Output is correct
38 Correct 5 ms 632 KB Output is correct
39 Correct 2 ms 376 KB Output is correct
40 Correct 2 ms 376 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 632 KB Output is correct
44 Correct 5 ms 632 KB Output is correct
45 Correct 5 ms 636 KB Output is correct
46 Correct 5 ms 632 KB Output is correct
47 Correct 5 ms 632 KB Output is correct
48 Correct 3 ms 376 KB Output is correct
49 Correct 3 ms 504 KB Output is correct
50 Correct 3 ms 376 KB Output is correct
51 Correct 3 ms 376 KB Output is correct
52 Correct 3 ms 504 KB Output is correct
53 Correct 3 ms 376 KB Output is correct
54 Correct 3 ms 504 KB Output is correct
55 Correct 3 ms 376 KB Output is correct
56 Correct 3 ms 376 KB Output is correct
57 Correct 3 ms 376 KB Output is correct
58 Correct 3 ms 504 KB Output is correct
59 Correct 3 ms 504 KB Output is correct
60 Correct 3 ms 504 KB Output is correct
61 Correct 3 ms 504 KB Output is correct
62 Correct 3 ms 484 KB Output is correct
63 Correct 3 ms 376 KB Output is correct
64 Correct 3 ms 504 KB Output is correct
65 Correct 3 ms 376 KB Output is correct
66 Correct 3 ms 504 KB Output is correct
67 Correct 3 ms 376 KB Output is correct
68 Correct 2 ms 376 KB Output is correct
69 Correct 2 ms 376 KB Output is correct
70 Correct 2 ms 376 KB Output is correct
71 Correct 2 ms 376 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 504 KB Output is correct
78 Correct 4 ms 504 KB Output is correct
79 Correct 4 ms 504 KB Output is correct
80 Correct 4 ms 504 KB Output is correct
81 Correct 4 ms 504 KB Output is correct
82 Correct 3 ms 376 KB Output is correct
83 Correct 3 ms 376 KB Output is correct
84 Correct 3 ms 504 KB Output is correct
85 Correct 3 ms 504 KB Output is correct
86 Correct 3 ms 376 KB Output is correct
87 Correct 3 ms 380 KB Output is correct
88 Correct 3 ms 504 KB Output is correct
89 Correct 7 ms 888 KB Output is correct
90 Correct 7 ms 888 KB Output is correct
91 Correct 7 ms 888 KB Output is correct
92 Correct 7 ms 888 KB Output is correct
93 Correct 8 ms 888 KB Output is correct
94 Correct 8 ms 888 KB Output is correct
95 Correct 7 ms 892 KB Output is correct
96 Correct 12 ms 1400 KB Output is correct
97 Correct 12 ms 1400 KB Output is correct
98 Correct 12 ms 1400 KB Output is correct
99 Correct 12 ms 1400 KB Output is correct
100 Correct 12 ms 1400 KB Output is correct
101 Correct 2 ms 376 KB Output is correct
102 Correct 2 ms 376 KB Output is correct
103 Correct 12 ms 1292 KB Output is correct
104 Correct 2 ms 256 KB Output is correct
105 Correct 3 ms 552 KB Output is correct
106 Correct 4 ms 504 KB Output is correct
107 Correct 3 ms 504 KB Output is correct
108 Correct 3 ms 504 KB Output is correct
109 Correct 7 ms 888 KB Output is correct
110 Correct 7 ms 888 KB Output is correct
111 Correct 11 ms 1400 KB Output is correct
112 Correct 2 ms 376 KB Output is correct
113 Correct 2 ms 376 KB Output is correct
114 Correct 11 ms 1400 KB Output is correct
115 Correct 3 ms 504 KB Output is correct
116 Correct 3 ms 504 KB Output is correct
117 Correct 7 ms 888 KB Output is correct
118 Correct 7 ms 888 KB Output is correct
119 Correct 12 ms 1272 KB Output is correct
120 Correct 12 ms 1400 KB Output is correct
121 Correct 12 ms 1400 KB Output is correct
122 Correct 12 ms 1404 KB Output is correct
123 Correct 12 ms 1400 KB Output is correct
124 Correct 12 ms 1400 KB Output is correct
125 Correct 12 ms 1400 KB Output is correct
126 Correct 12 ms 1404 KB Output is correct
127 Correct 12 ms 1400 KB Output is correct
128 Correct 11 ms 1400 KB Output is correct