답안 #221262

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
221262	2020-04-09T18:11:22 Z	galca	Vision Program (IOI19_vision)	C++14	34 / 100	16 ms	1280 KB

vision

#include <vision.h>
#include <vector>
using namespace std;

void construct_network(int H, int W, int K) {
	vector<int> positions;
	vector<int> positions2;

	positions2.push_back(0);
	positions2.push_back(0);

	for (int i = 0; i < W; i++) {
		positions.push_back(i);
	}
	for (int j = 0; j < H; j++) {
		add_xor(positions);
		for (int i = 0; i < W; i++) {
			positions[i] += W;
		}
	}

	positions.erase(positions.begin(), positions.end());
	for (int i = 0; i < H; i++) {
		positions.push_back(i*W);
	}
	for (int j = 0; j < W; j++) {
		add_xor(positions);
		for (int i = 0; i < H; i++) {
			positions[i] += 1;
		}
	}

	vector<int> positions_final_or;

#if 1
	// H rows + W cols

	// all pairs distance 1
	// all pairs distance 2
	// 1 pair distance H-1

	int end_pos_x = H*W + H + W;

	vector<int> positions_rows;
	vector<int> positions_cols;

	for (int j = 1; j < H; j++) {
		positions_rows.push_back(end_pos_x);
		//for (int i = 0; i < H - j; i++) {
		positions2[0] = H*W;// +i;
		positions2[1] = H*W + j;// +i;

			 add_and(positions2);
			 ++end_pos_x;
		//}
	}

	for (int j = 1; j < W; j++) {
		positions_cols.push_back(end_pos_x);
		//for (int i = 0; i < W - j; i++) {
		positions2[0] = H*W + H;// +i;
		positions2[1] = H*W + H + j;// +i;

			add_and(positions2);
			++end_pos_x;
		//}
	}

	for (int j = 1; j < K; j++) {
		// j in H, (K-j) in W
		
		int options_y = H - j;
		int options_x = W - (K - j);
		vector<int> positions_and;
		positions_and.push_back(0);
		positions_and.push_back(0);

		if ((options_y > 0) && (options_x > 0)) {
			int position_y = positions_rows[j - 1];
			int position_x = positions_cols[K - j - 1];

			positions.erase(positions.begin(), positions.end());
			//for (int i = 0; i < options_y; i++) {
				positions.push_back(position_y++);
			//}
			positions_and.push_back(add_or(positions));
			
			positions.erase(positions.begin(), positions.end());
			//for (int i = 0; i < options_x; i++) {
				positions.push_back(position_x++);
			//}
			positions_and.push_back(add_or(positions));
	
			positions_final_or.push_back(add_and(positions_and));
		}
	}
#endif
	positions2.push_back(0);

	positions.erase(positions.begin(), positions.end());
	for (int i = 0; i < W; i++) {
		positions.push_back(H*W + H + i);
	}

	int pos1 = add_not(add_or(positions));

	positions.erase(positions.begin(), positions.end());
	for (int i = 0; i < H; i++) {
		positions.push_back(H*W + i);
	}

	int pos2 = add_not(add_or(positions));

	// 0-K and K-0
	for (int j = 0; j < H - K; j++) {
		positions2[0] = H*W + j;
		positions2[1] = H*W + j + K;
		positions2[2] = pos1;
		positions_final_or.push_back(add_and(positions2));
	}
	for (int j = 0; j < W - K; j++) {
		positions2[0] = H*W + H + j;
		positions2[1] = H*W + H + j + K;
		positions2[2] = pos2;
		positions_final_or.push_back(add_and(positions2));
	}

	add_or(positions_final_or);
}

Subtask #1
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	256 KB	Output is correct
2	Correct	4 ms	384 KB	Output is correct
3	Correct	4 ms	256 KB	Output is correct
4	Correct	4 ms	256 KB	Output is correct
5	Correct	5 ms	384 KB	Output is correct
6	Incorrect	4 ms	256 KB	on inputs (0, 1), (1, 0), expected 1, but computed 0
7	Halted	0 ms	0 KB	-

Subtask #2
0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	256 KB	Output is correct
2	Correct	4 ms	384 KB	Output is correct
3	Correct	4 ms	256 KB	Output is correct
4	Correct	4 ms	256 KB	Output is correct
5	Correct	5 ms	384 KB	Output is correct
6	Incorrect	4 ms	256 KB	on inputs (0, 1), (1, 0), expected 1, but computed 0
7	Halted	0 ms	0 KB	-

Subtask #3
0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	256 KB	Output is correct
2	Correct	4 ms	384 KB	Output is correct
3	Correct	4 ms	256 KB	Output is correct
4	Correct	4 ms	256 KB	Output is correct
5	Correct	5 ms	384 KB	Output is correct
6	Incorrect	4 ms	256 KB	on inputs (0, 1), (1, 0), expected 1, but computed 0
7	Halted	0 ms	0 KB	-

Subtask #4
0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	256 KB	Output is correct
2	Correct	4 ms	384 KB	Output is correct
3	Correct	4 ms	256 KB	Output is correct
4	Correct	4 ms	256 KB	Output is correct
5	Correct	5 ms	384 KB	Output is correct
6	Incorrect	4 ms	256 KB	on inputs (0, 1), (1, 0), expected 1, but computed 0
7	Halted	0 ms	0 KB	-

Subtask #5
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	5 ms	384 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct
8	Correct	5 ms	384 KB	Output is correct
9	Correct	5 ms	384 KB	Output is correct
10	Correct	5 ms	384 KB	Output is correct
11	Correct	5 ms	384 KB	Output is correct
12	Correct	6 ms	384 KB	Output is correct
13	Correct	6 ms	384 KB	Output is correct
14	Correct	5 ms	384 KB	Output is correct
15	Correct	5 ms	384 KB	Output is correct
16	Correct	5 ms	384 KB	Output is correct
17	Correct	5 ms	384 KB	Output is correct
18	Correct	5 ms	384 KB	Output is correct
19	Correct	5 ms	384 KB	Output is correct
20	Correct	5 ms	384 KB	Output is correct
21	Correct	5 ms	256 KB	Output is correct
22	Correct	4 ms	256 KB	Output is correct

Subtask #6
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	256 KB	Output is correct
2	Correct	4 ms	256 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	5 ms	384 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct
8	Correct	6 ms	512 KB	Output is correct
9	Correct	6 ms	512 KB	Output is correct
10	Correct	6 ms	512 KB	Output is correct
11	Correct	6 ms	384 KB	Output is correct
12	Correct	7 ms	384 KB	Output is correct
13	Correct	5 ms	384 KB	Output is correct
14	Correct	5 ms	384 KB	Output is correct
15	Correct	5 ms	384 KB	Output is correct
16	Correct	5 ms	384 KB	Output is correct
17	Correct	5 ms	256 KB	Output is correct
18	Correct	5 ms	384 KB	Output is correct
19	Correct	5 ms	384 KB	Output is correct
20	Correct	9 ms	768 KB	Output is correct
21	Correct	10 ms	768 KB	Output is correct
22	Correct	10 ms	768 KB	Output is correct
23	Correct	9 ms	768 KB	Output is correct
24	Correct	9 ms	768 KB	Output is correct
25	Correct	10 ms	768 KB	Output is correct
26	Correct	9 ms	768 KB	Output is correct
27	Correct	14 ms	1152 KB	Output is correct
28	Correct	14 ms	1152 KB	Output is correct
29	Correct	16 ms	1280 KB	Output is correct
30	Correct	14 ms	1280 KB	Output is correct
31	Correct	14 ms	1152 KB	Output is correct
32	Correct	4 ms	256 KB	Output is correct
33	Correct	4 ms	384 KB	Output is correct

Subtask #7
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	15 ms	1152 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	6 ms	512 KB	Output is correct
5	Correct	6 ms	384 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	10 ms	768 KB	Output is correct
8	Correct	9 ms	768 KB	Output is correct
9	Correct	14 ms	1280 KB	Output is correct
10	Correct	4 ms	256 KB	Output is correct
11	Correct	5 ms	384 KB	Output is correct

Subtask #8
0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	256 KB	Output is correct
2	Correct	4 ms	384 KB	Output is correct
3	Correct	4 ms	256 KB	Output is correct
4	Correct	4 ms	256 KB	Output is correct
5	Correct	5 ms	384 KB	Output is correct
6	Incorrect	4 ms	256 KB	on inputs (0, 1), (1, 0), expected 1, but computed 0
7	Halted	0 ms	0 KB	-

답안 #221262

Compilation message