oj.uz

Submission #589719

# Submission time Handle Problem Language Result Execution time Memory
589719 2022-07-05T07:46:05 Z Zanite Vision Program (IOI19_vision) C++17
100 / 100
 65 ms 5856 KB 
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;

int H, W, K;
map<int, vector<int>> d1, d2;

int XL[2], XR[2], OL[2], OR[2];

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

void process(map<int, vector<int>> &M, int T) {
	int cur = -1;
	for (auto &[i, v] : M) {
		int nxt = add_xor(v);
		if (cur == -1) {XL[T] = nxt;}
		cur = nxt;
	}
	XR[T] = cur;

	cur = -1;
	for (auto &[i, v] : M) {
		int nxt = add_or(v);
		if (cur == -1) {OL[T] = nxt;}
		cur = nxt;
	}
	OR[T] = cur;
}

int solve(int D) {
	vector<int> G[2];

	for (int i = 0; i <= 1; i++) {
		for (int st = XL[i], ost = OL[i]; st <= XR[i]-D+1; st++, ost++) {
			vector<int> X(D), O(D);
			iota(X.begin(), X.end(), st);
			iota(O.begin(), O.end(), ost);

			int xres, ores;
			xres = add_xor(X);
			xres = add_not(xres);
			ores = add_or(O);
			G[i].push_back(add_and({xres, ores}));
		}
	}

	int r[2];
	for (int i = 0; i <= 1; i++) {r[i] = add_or(G[i]);}
	return add_and({r[0], r[1]});
}

void construct_network(int H, int W, int K) {
	::H = H, ::W = W, ::K = K;
	d1.clear(), d2.clear();

	if (K == H + W - 2) {
		int UL = add_and({cell(0, 0), cell(H-1, W-1)});
		int UR = add_and({cell(0, W-1), cell(H-1, 0)});
		add_or({UL, UR});

		return;
	}

	for (int i = 0; i < H; i++) {
		for (int j = 0; j < W; j++) {
			d1[i+j].push_back(cell(i, j));
			d2[i-j].push_back(cell(i, j));
		}
	}

	process(d1, 0);
	process(d2, 1);

	int x1 = solve(K+1);
	int x2 = solve(K);
	x2 = add_not(x2);

	add_and({x1, x2});
}

#ifdef Zanite

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);

	while (true) {
		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);
		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);
	}
	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);
}

#endif

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 300 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 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 396 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 300 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 1 ms 304 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 300 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 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 396 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 300 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 1 ms 304 KB Output is correct
19 Correct 1 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 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 300 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 300 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 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 396 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 300 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 1 ms 304 KB Output is correct
19 Correct 1 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 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 300 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 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 2 ms 340 KB Output is correct
35 Correct 2 ms 340 KB Output is correct
36 Correct 2 ms 340 KB Output is correct
37 Correct 0 ms 212 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 300 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 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 396 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 300 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 1 ms 304 KB Output is correct
19 Correct 1 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 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 300 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 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 2 ms 340 KB Output is correct
35 Correct 2 ms 340 KB Output is correct
36 Correct 2 ms 340 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 13 ms 1540 KB Output is correct
39 Correct 3 ms 428 KB Output is correct
40 Correct 2 ms 424 KB Output is correct
41 Correct 5 ms 724 KB Output is correct
42 Correct 4 ms 596 KB Output is correct
43 Correct 6 ms 1032 KB Output is correct
44 Correct 13 ms 1576 KB Output is correct
45 Correct 14 ms 1748 KB Output is correct
46 Correct 11 ms 1492 KB Output is correct
47 Correct 0 ms 212 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 596 KB Output is correct
2 Correct 9 ms 1128 KB Output is correct
3 Correct 8 ms 1108 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 3 ms 596 KB Output is correct
6 Correct 8 ms 1088 KB Output is correct
7 Correct 8 ms 980 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 7 ms 940 KB Output is correct
11 Correct 8 ms 1064 KB Output is correct
12 Correct 8 ms 1108 KB Output is correct
13 Correct 8 ms 852 KB Output is correct
14 Correct 1 ms 300 KB Output is correct
15 Correct 3 ms 596 KB Output is correct
16 Correct 12 ms 1036 KB Output is correct
17 Correct 9 ms 1108 KB Output is correct
18 Correct 8 ms 1068 KB Output is correct
19 Correct 6 ms 852 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 304 KB Output is correct
22 Correct 0 ms 300 KB Output is correct

Subtask #6
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 4 ms 608 KB Output is correct
4 Correct 5 ms 828 KB Output is correct
5 Correct 5 ms 852 KB Output is correct
6 Correct 5 ms 724 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 4 ms 808 KB Output is correct
9 Correct 8 ms 1208 KB Output is correct
10 Correct 9 ms 1308 KB Output is correct
11 Correct 8 ms 1108 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 2 ms 596 KB Output is correct
14 Correct 7 ms 980 KB Output is correct
15 Correct 7 ms 980 KB Output is correct
16 Correct 0 ms 300 KB Output is correct
17 Correct 2 ms 552 KB Output is correct
18 Correct 8 ms 1108 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 12 ms 1744 KB Output is correct
21 Correct 26 ms 3156 KB Output is correct
22 Correct 36 ms 3088 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 13 ms 1700 KB Output is correct
25 Correct 25 ms 3304 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 20 ms 2920 KB Output is correct
28 Correct 41 ms 5112 KB Output is correct
29 Correct 65 ms 5836 KB Output is correct
30 Correct 43 ms 4884 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 296 KB Output is correct
33 Correct 0 ms 212 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 2900 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 3 ms 596 KB Output is correct
4 Correct 8 ms 852 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 2 ms 596 KB Output is correct
7 Correct 11 ms 1748 KB Output is correct
8 Correct 11 ms 1696 KB Output is correct
9 Correct 20 ms 2948 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 300 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 300 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 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 396 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 300 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 1 ms 304 KB Output is correct
19 Correct 1 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 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 300 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 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 2 ms 340 KB Output is correct
35 Correct 2 ms 340 KB Output is correct
36 Correct 2 ms 340 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 13 ms 1540 KB Output is correct
39 Correct 3 ms 428 KB Output is correct
40 Correct 2 ms 424 KB Output is correct
41 Correct 5 ms 724 KB Output is correct
42 Correct 4 ms 596 KB Output is correct
43 Correct 6 ms 1032 KB Output is correct
44 Correct 13 ms 1576 KB Output is correct
45 Correct 14 ms 1748 KB Output is correct
46 Correct 11 ms 1492 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 2 ms 596 KB Output is correct
49 Correct 9 ms 1128 KB Output is correct
50 Correct 8 ms 1108 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 3 ms 596 KB Output is correct
53 Correct 8 ms 1088 KB Output is correct
54 Correct 8 ms 980 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 2 ms 596 KB Output is correct
57 Correct 7 ms 940 KB Output is correct
58 Correct 8 ms 1064 KB Output is correct
59 Correct 8 ms 1108 KB Output is correct
60 Correct 8 ms 852 KB Output is correct
61 Correct 1 ms 300 KB Output is correct
62 Correct 3 ms 596 KB Output is correct
63 Correct 12 ms 1036 KB Output is correct
64 Correct 9 ms 1108 KB Output is correct
65 Correct 8 ms 1068 KB Output is correct
66 Correct 6 ms 852 KB Output is correct
67 Correct 1 ms 212 KB Output is correct
68 Correct 1 ms 304 KB Output is correct
69 Correct 0 ms 300 KB Output is correct
70 Correct 1 ms 296 KB Output is correct
71 Correct 0 ms 212 KB Output is correct
72 Correct 4 ms 608 KB Output is correct
73 Correct 5 ms 828 KB Output is correct
74 Correct 5 ms 852 KB Output is correct
75 Correct 5 ms 724 KB Output is correct
76 Correct 0 ms 212 KB Output is correct
77 Correct 4 ms 808 KB Output is correct
78 Correct 8 ms 1208 KB Output is correct
79 Correct 9 ms 1308 KB Output is correct
80 Correct 8 ms 1108 KB Output is correct
81 Correct 0 ms 212 KB Output is correct
82 Correct 2 ms 596 KB Output is correct
83 Correct 7 ms 980 KB Output is correct
84 Correct 7 ms 980 KB Output is correct
85 Correct 0 ms 300 KB Output is correct
86 Correct 2 ms 552 KB Output is correct
87 Correct 8 ms 1108 KB Output is correct
88 Correct 0 ms 212 KB Output is correct
89 Correct 12 ms 1744 KB Output is correct
90 Correct 26 ms 3156 KB Output is correct
91 Correct 36 ms 3088 KB Output is correct
92 Correct 1 ms 212 KB Output is correct
93 Correct 13 ms 1700 KB Output is correct
94 Correct 25 ms 3304 KB Output is correct
95 Correct 0 ms 212 KB Output is correct
96 Correct 20 ms 2920 KB Output is correct
97 Correct 41 ms 5112 KB Output is correct
98 Correct 65 ms 5836 KB Output is correct
99 Correct 43 ms 4884 KB Output is correct
100 Correct 0 ms 212 KB Output is correct
101 Correct 0 ms 296 KB Output is correct
102 Correct 0 ms 212 KB Output is correct
103 Correct 22 ms 2900 KB Output is correct
104 Correct 1 ms 212 KB Output is correct
105 Correct 3 ms 596 KB Output is correct
106 Correct 8 ms 852 KB Output is correct
107 Correct 2 ms 596 KB Output is correct
108 Correct 2 ms 596 KB Output is correct
109 Correct 11 ms 1748 KB Output is correct
110 Correct 11 ms 1696 KB Output is correct
111 Correct 20 ms 2948 KB Output is correct
112 Correct 0 ms 212 KB Output is correct
113 Correct 0 ms 300 KB Output is correct
114 Correct 44 ms 5148 KB Output is correct
115 Correct 2 ms 340 KB Output is correct
116 Correct 3 ms 596 KB Output is correct
117 Correct 18 ms 2308 KB Output is correct
118 Correct 20 ms 2584 KB Output is correct
119 Correct 47 ms 5808 KB Output is correct
120 Correct 49 ms 5808 KB Output is correct
121 Correct 48 ms 5804 KB Output is correct
122 Correct 52 ms 5816 KB Output is correct
123 Correct 21 ms 2920 KB Output is correct
124 Correct 41 ms 5096 KB Output is correct
125 Correct 49 ms 5792 KB Output is correct
126 Correct 52 ms 5856 KB Output is correct
127 Correct 44 ms 4988 KB Output is correct
128 Correct 1 ms 212 KB Output is correct