oj.uz

답안 #221239

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
221239 2020-04-09T17:47:00 Z galca Vision Program (IOI19_vision) C++14
0 / 100
 6 ms 1404 KB 
#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;
		}
	}

	// 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 + i + j;

			add_and(positions2);
		}
	}

	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 + i + j;

			add_and(positions2);
		}
	}

	vector<int> positions_final_or;

	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));
		}
	}
	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_and(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_and(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[3] = 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[3] = pos2;
		positions_final_or.push_back(add_and(positions2));
	}

	add_or(positions_final_or);
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 256 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 256 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 256 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 256 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 1148 KB WA in grader: Too many instructions
2 Halted 0 ms 0 KB -

Subtask #6
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 384 KB on inputs (0, 0), (1, 1), expected 0, but computed 1
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 1404 KB WA in grader: Too many instructions
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 256 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -