oj.uz

Submission #1025402

# Submission time Handle Problem Language Result Execution time Memory
1025402 2024-07-17T01:43:52 Z byakko Vision Program (IOI19_vision) C++17
14 / 100
 9 ms 1884 KB 
#include "vision.h"
using namespace std;

void construct_network(int H, int W, int K) {
	vector<int> row(H), rowp(H);
	vector<int> col(W), colp(W);
	for(int i = 0; i < H; i++) {
		vector<int> cur;
		for(int j = 0; j < W; j++) cur.push_back(i*W + j);
		row[i] = add_or(cur);
		rowp[i] = add_not(add_xor(cur));
	}
	for(int j = 0; j < W; j++) {
		vector<int> cur;
		for(int i = 0; i < H; i++) cur.push_back(i*W + j);
		col[j] = add_or(cur);
		colp[j] = add_not(add_xor(cur));
	}
	vector<int> dist_i(K, -1), dist_j(K, -1);
	for(int d = 0; d <= min(K, H - 1); d++) {
		vector<int> cur;
		for(int i = 0; i + d < H; i++) {
			if(d > 0)
				cur.push_back(add_and({row[i], row[i + d]}));
			else {
				cur.push_back(add_and({row[i], rowp[i]}));
			}
		}
		dist_i[d] = add_or(cur);
	}
	for(int d = 0; d <= min(K, W - 1); d++) {
		vector<int> cur;
		for(int j = 0; j + d < W; j++) {
			if(d > 0)
				cur.push_back(add_and({col[j], col[j + d]}));
			else {
				cur.push_back(add_and({col[j], colp[j]}));
			}
		}
		dist_j[d] = add_or(cur);
	}

	vector<int> all;
	for(int i = 0; i <= K; i++) {
		if(dist_i[i] == -1) break;
		int j = K - i;
		if(dist_j[j] == -1) continue;
		all.push_back(add_and({dist_i[i], dist_j[j]}));
	}
	add_or(all);
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 416 KB Output is correct
6 Incorrect 0 ms 348 KB on inputs (0, 0), (0, 1), expected 0, but computed 1
7 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 416 KB Output is correct
6 Incorrect 0 ms 348 KB on inputs (0, 0), (0, 1), expected 0, but computed 1
7 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 416 KB Output is correct
6 Incorrect 0 ms 348 KB on inputs (0, 0), (0, 1), expected 0, but computed 1
7 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 416 KB Output is correct
6 Incorrect 0 ms 348 KB on inputs (0, 0), (0, 1), expected 0, but computed 1
7 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 1 ms 1240 KB WA in grader: Too many instructions
3 Halted 0 ms 0 KB -

Subtask #6
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB on inputs (0, 0), (0, 1), expected 0, but computed 1
3 Halted 0 ms 0 KB -

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 1860 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 688 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 5 ms 1160 KB Output is correct
8 Correct 5 ms 1116 KB Output is correct
9 Correct 9 ms 1884 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct

Subtask #8
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 416 KB Output is correct
6 Incorrect 0 ms 348 KB on inputs (0, 0), (0, 1), expected 0, but computed 1
7 Halted 0 ms 0 KB -