oj.uz

Submission #425085

# Submission time Handle Problem Language Result Execution time Memory
425085 2021-06-12T13:09:08 Z donentseto Vision Program (IOI19_vision) C++14
100 / 100
 49 ms 2404 KB 
#include <bits/stdc++.h>
#include "vision.h"
using namespace std;

void construct_network (int h, int w, int k){

	vector <int> idx, idx1, last;
	int curr, curr1 = h * w;

	if (h > k){
		for (int i = 0; i < h; i ++){
			for (int j = 0; j < w; j ++) idx.push_back (i * w + j);
			add_or (idx);
			idx.clear ();
		}
		for (int i = 0; i < h; i ++) idx.push_back (h * w + i);
		idx1.push_back (add_xor (idx));
		idx.clear ();
		for (int i = 0; i < h - k; i ++){
			for (int j = 0; j <= k; j ++) idx.push_back (h * w + i + j);
			add_or (idx);
			curr = add_not (add_xor (idx));
			idx1.push_back (add_and ({curr - 2, curr}));
			idx.clear ();
		}
		curr1 = add_or (idx1);
		last.push_back (curr1);
		idx1.clear ();
		curr1 ++;
	}
	if (w > k){
		for (int i = 0; i < w; i ++){
			for (int j = 0; j < h; j ++) idx.push_back (j * w + i);
			add_or (idx);
			idx.clear ();
		}
		for (int i = 0; i < w; i ++) idx.push_back (curr1 + i);
		idx1.push_back (add_xor (idx));
		idx.clear ();
		for (int i = 0; i < w - k; i ++){
			for (int j = 0; j <= k; j ++) idx.push_back (curr1 + i + j);
			add_or (idx);
			curr = add_not (add_xor (idx));
			idx1.push_back (add_and ({curr - 2, curr}));
			idx.clear ();
		}
		curr1 = add_or (idx1);
		last.push_back (curr1);
		idx1.clear ();
		curr1 ++;
	}
	for (int i = 1 - w; i < h; i ++){
		for (int j = 0; j < h; j ++) if (j - i >= 0 && j - i < w) idx.push_back (j * w + j - i);
		add_or (idx);
		idx.clear ();
	}
	int n = h + w - 1;
	for (int i = 0; i < n - k; i ++){
		idx1.push_back (add_and ({curr1 + i, curr1 + i + k}));
	}
	curr1 = add_or (idx1) + 1;
	idx1.clear ();

	for (int i = 0; i < n; i ++){
		for (int j = 0; j < h; j ++) if (i - j >= 0 && i - j < w) idx.push_back (j * w + i - j);
		add_or (idx);
		idx.clear ();
	}
	for (int i = 0; i < n - k; i ++){
		idx1.push_back (add_and ({curr1 + i, curr1 + i + k}));
	}
	last.push_back (add_or ({curr1 - 1, add_or (idx1)}));
	add_and (last);

}
/*
static const int MAX_INSTRUCTIONS = 10000;
static const int MAX_INPUTS = 1000000;

static const int _AND = 0;
static const int _OR = 1;
static const int _XOR = 2;
static const int _NOT = 3;

static inline bool increasing(int a, int b, int c) {
	return a <= b && b <= c;
}

[[noreturn]] static inline void error(string message) {
	printf("%s\n", message.c_str());
	exit(0);
}

class InstructionNetwork {

	struct Instruction {
		int type;
		vector<int> input_indexes;

		inline Instruction(int _type, const vector<int>& _input_indexes):
			type(_type), input_indexes(_input_indexes) {
			}

		inline int apply(int a, int b) const {
			switch (type) {
				case _AND:
					return a & b;
				case _OR:
					return a | b;
				case _XOR:
					return a ^ b;
				default:
					return 0;
			}
		}

		inline int compute(const vector<int>& memory_cells) const {
			int r = memory_cells[input_indexes[0]];
			if (type == _NOT)
				return 1 - r;
			for (int j = 1; j < (int)input_indexes.size(); j++)
				r = apply(r, memory_cells[input_indexes[j]]);
			return r;
		}
	};

	int input_size;
	int total_inputs;
	vector<Instruction> instructions;

	public:

	inline void init(int _input_size) {
		this->input_size = _input_size;
		this->total_inputs = 0;
		this->instructions.clear();
	}

	inline int add_instruction(int type, const vector<int>& input_indexes) {
		if (input_indexes.size() == 0)
			error("Instruction with no inputs");

		if (instructions.size() + 1 > MAX_INSTRUCTIONS)
			error("Too many instructions");

		if (total_inputs + input_indexes.size() > MAX_INPUTS)
			error("Too many inputs");

		instructions.emplace_back(type, input_indexes);
		total_inputs += input_indexes.size();
		int new_index = input_size + (int)instructions.size() - 1;

		for (int input_index : input_indexes)
			if (!increasing(0, input_index, new_index-1))
				error("Invalid index");

		return new_index;
	}

	inline int compute(vector<int> &memory_cells) const {
		for (auto &instruction : instructions)
			memory_cells.push_back(instruction.compute(memory_cells));
		return memory_cells.back();
	}
};


static InstructionNetwork instructionNetwork;

int main() {
	int H, W, K;
	assert(3 == scanf("%d%d%d", &H, &W, &K));

	FILE *log_file = fopen("log.txt","w");

	instructionNetwork.init(H * W);
	construct_network(H, W, K);

	for (int rowA = 0; rowA < H; rowA ++){
	for (int rowB = 0; rowB < H; rowB ++){
	for (int colA = 0; colA < W; colA ++){
	for (int colB = 0; colB < W; colB ++){
		if (rowA == rowB && colA == colB) continue;
		int rowA, colA, rowB, colB;
		assert(1 == scanf("%d", &rowA));
		if (rowA == -1)
			break;
		assert(3 == scanf("%d%d%d", &colA, &rowB, &colB));

		if ((!increasing(0, rowA, H-1)) ||
				(!increasing(0, colA, W-1)) ||
				(!increasing(0, rowB, H-1)) ||
				(!increasing(0, colB, W-1)) ||
				(rowA == rowB && colA == colB)) {
			printf("-1\n");
			fprintf(log_file, "-1\n");
			fflush(stdout);
			fflush(log_file);
			continue;
		}

		vector<int> memory_cells;
		for (int row = 0; row < H; row++)
			for (int col = 0; col < W; col++) {
				bool active = (row == rowA && col == colA) || (row == rowB && col == colB);
				memory_cells.push_back(active ? 1 : 0);
			}
		int computation_result = instructionNetwork.compute(memory_cells);

		printf("%d\n", computation_result);
		int dist = abs (rowA - rowB) + abs (colA - colB);
		cout << dist << '\n';
		if ((bool) (dist == K) != (bool) (computation_result)){
			cout << "wrong!\n" << H << ' ' << W << ' ' << K << '\n';
			cout << rowA << ' ' << colA << ' ' << rowB << ' ' << colB << '\n';
			return 0;
		}
		fflush(stdout);

		for(int i = 0; i < (int)memory_cells.size(); i++)
			fprintf(log_file, (i ? " %d" : "%d"), memory_cells[i]);
		fprintf(log_file, "\n");
		fflush(log_file);
	}}}}
	cout << "ok\n";
	fclose(stdin);
}

int add_and(vector<int> Ns) {
	return instructionNetwork.add_instruction(_AND, Ns);
}

int add_or(vector<int> Ns) {
	return instructionNetwork.add_instruction(_OR, Ns);
}

int add_xor(vector<int> Ns) {
	return instructionNetwork.add_instruction(_XOR, Ns);
}

int add_not(int N) {
	vector<int> Ns = {N};
	return instructionNetwork.add_instruction(_NOT, Ns);
}*/

Subtask #1
10.0 / 10.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 4 ms 520 KB Output is correct
3 Correct 3 ms 460 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 3 ms 460 KB Output is correct
7 Correct 3 ms 460 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 3 ms 460 KB Output is correct
12 Correct 3 ms 460 KB Output is correct
13 Correct 3 ms 460 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 3 ms 460 KB Output is correct
17 Correct 4 ms 460 KB Output is correct
18 Correct 4 ms 460 KB Output is correct
19 Correct 3 ms 460 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct

Subtask #6
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 3 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 4 ms 588 KB Output is correct
9 Correct 4 ms 588 KB Output is correct
10 Correct 4 ms 460 KB Output is correct
11 Correct 3 ms 460 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 3 ms 508 KB Output is correct
15 Correct 3 ms 460 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 3 ms 460 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 22 ms 1124 KB Output is correct
21 Correct 10 ms 1172 KB Output is correct
22 Correct 8 ms 844 KB Output is correct
23 Correct 5 ms 588 KB Output is correct
24 Correct 11 ms 1228 KB Output is correct
25 Correct 9 ms 972 KB Output is correct
26 Correct 5 ms 612 KB Output is correct
27 Correct 20 ms 2016 KB Output is correct
28 Correct 49 ms 2344 KB Output is correct
29 Correct 41 ms 1924 KB Output is correct
30 Correct 20 ms 1092 KB Output is correct
31 Correct 22 ms 1096 KB Output is correct
32 Correct 1 ms 220 KB Output is correct
33 Correct 1 ms 204 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 2032 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 4 ms 588 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 11 ms 1228 KB Output is correct
8 Correct 11 ms 1220 KB Output is correct
9 Correct 22 ms 2060 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct

Subtask #8
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 248 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 2 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 6 ms 816 KB Output is correct
39 Correct 3 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 3 ms 460 KB Output is correct
42 Correct 2 ms 332 KB Output is correct
43 Correct 6 ms 716 KB Output is correct
44 Correct 9 ms 716 KB Output is correct
45 Correct 4 ms 460 KB Output is correct
46 Correct 3 ms 460 KB Output is correct
47 Correct 3 ms 460 KB Output is correct
48 Correct 2 ms 332 KB Output is correct
49 Correct 4 ms 520 KB Output is correct
50 Correct 3 ms 460 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 2 ms 332 KB Output is correct
53 Correct 3 ms 460 KB Output is correct
54 Correct 3 ms 460 KB Output is correct
55 Correct 1 ms 332 KB Output is correct
56 Correct 2 ms 332 KB Output is correct
57 Correct 3 ms 460 KB Output is correct
58 Correct 3 ms 460 KB Output is correct
59 Correct 3 ms 460 KB Output is correct
60 Correct 3 ms 460 KB Output is correct
61 Correct 1 ms 332 KB Output is correct
62 Correct 1 ms 332 KB Output is correct
63 Correct 3 ms 460 KB Output is correct
64 Correct 4 ms 460 KB Output is correct
65 Correct 4 ms 460 KB Output is correct
66 Correct 3 ms 460 KB Output is correct
67 Correct 1 ms 332 KB Output is correct
68 Correct 1 ms 204 KB Output is correct
69 Correct 0 ms 204 KB Output is correct
70 Correct 0 ms 204 KB Output is correct
71 Correct 0 ms 204 KB Output is correct
72 Correct 2 ms 460 KB Output is correct
73 Correct 2 ms 460 KB Output is correct
74 Correct 3 ms 332 KB Output is correct
75 Correct 2 ms 332 KB Output is correct
76 Correct 1 ms 332 KB Output is correct
77 Correct 4 ms 588 KB Output is correct
78 Correct 4 ms 588 KB Output is correct
79 Correct 4 ms 460 KB Output is correct
80 Correct 3 ms 460 KB Output is correct
81 Correct 2 ms 332 KB Output is correct
82 Correct 1 ms 332 KB Output is correct
83 Correct 3 ms 508 KB Output is correct
84 Correct 3 ms 460 KB Output is correct
85 Correct 1 ms 332 KB Output is correct
86 Correct 2 ms 332 KB Output is correct
87 Correct 3 ms 460 KB Output is correct
88 Correct 1 ms 332 KB Output is correct
89 Correct 22 ms 1124 KB Output is correct
90 Correct 10 ms 1172 KB Output is correct
91 Correct 8 ms 844 KB Output is correct
92 Correct 5 ms 588 KB Output is correct
93 Correct 11 ms 1228 KB Output is correct
94 Correct 9 ms 972 KB Output is correct
95 Correct 5 ms 612 KB Output is correct
96 Correct 20 ms 2016 KB Output is correct
97 Correct 49 ms 2344 KB Output is correct
98 Correct 41 ms 1924 KB Output is correct
99 Correct 20 ms 1092 KB Output is correct
100 Correct 22 ms 1096 KB Output is correct
101 Correct 1 ms 220 KB Output is correct
102 Correct 1 ms 204 KB Output is correct
103 Correct 20 ms 2032 KB Output is correct
104 Correct 0 ms 204 KB Output is correct
105 Correct 2 ms 460 KB Output is correct
106 Correct 4 ms 588 KB Output is correct
107 Correct 2 ms 332 KB Output is correct
108 Correct 2 ms 332 KB Output is correct
109 Correct 11 ms 1228 KB Output is correct
110 Correct 11 ms 1220 KB Output is correct
111 Correct 22 ms 2060 KB Output is correct
112 Correct 1 ms 204 KB Output is correct
113 Correct 0 ms 204 KB Output is correct
114 Correct 31 ms 2404 KB Output is correct
115 Correct 1 ms 332 KB Output is correct
116 Correct 2 ms 332 KB Output is correct
117 Correct 7 ms 588 KB Output is correct
118 Correct 13 ms 1356 KB Output is correct
119 Correct 21 ms 1868 KB Output is correct
120 Correct 10 ms 1148 KB Output is correct
121 Correct 18 ms 1560 KB Output is correct
122 Correct 15 ms 1484 KB Output is correct
123 Correct 25 ms 2036 KB Output is correct
124 Correct 24 ms 2364 KB Output is correct
125 Correct 19 ms 1948 KB Output is correct
126 Correct 10 ms 1100 KB Output is correct
127 Correct 10 ms 1100 KB Output is correct
128 Correct 11 ms 1032 KB Output is correct