oj.uz

Submission #823840

# Submission time Handle Problem Language Result Execution time Memory
823840 2023-08-13T08:29:13 Z vjudge1 Vision Program (IOI19_vision) C++17
12 / 100
 10 ms 1616 KB 
#include<bits/stdc++.h>
#include "vision.h"

using namespace std;

void construct_network(int H, int W, int K) {
	int cur = H * W;
	if(K == 1) {
		for(int i = 0; i < H; i++) {
			vector<int> Ns;
			for(int j = 0; j < W; j++)
				Ns.push_back(i * W + j);
			add_xor(Ns);
			cur++;
		}
		vector<int> Ns;
		for(int i = 0; i < H; i++) {
			for(int j = 0; j < W; j++) {
				Ns.push_back(i * W + j);
			}
		}
		add_xor(Ns);
		cur++;
		Ns.clear();

		for(int j = 0; j < W; j++) {
			vector<int> Ns;
			for(int i = 0; i < H; i++) {
				Ns.push_back(i * W + j);
			}
			add_xor(Ns);
			cur++;
		}
		int t = cur;
		for(int i = H * W; i < t - 1; i++) {
			add_and({i, i + 1});
			cur++;
		}
		for(int i = t; i < cur; i++) {
			Ns.push_back(i);
		}
		add_xor(Ns);
		return;
	}
	for(int x1 = 0; x1 < H; x1++) {
		for(int y1 = 0; y1 < W; y1++) {
			vector<int> Ns;
			for(int d = -K + 1; d <= K; d++) {
				int x2 = x1 + d, y2 = y1 + K - abs(d);
				if(x2 < 0 || x2 >= H || y2 < 0 || y2 >= W) continue;
				Ns.push_back(x2 * W + y2);
			}
			if(!Ns.empty()) {
				add_or(Ns);
				add_and({cur, x1 * W + y1});
				cur += 2;
			}
		}
	}
	vector<int> ns;
	for(int i = H * W + 1; i < cur; i += 2)
		ns.push_back(i);
	add_or(ns);
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 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 0 ms 212 KB Output is correct
7 Incorrect 0 ms 212 KB on inputs (0, 2), (1, 0), expected 0, but computed 1
8 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 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 0 ms 212 KB Output is correct
7 Incorrect 0 ms 212 KB on inputs (0, 2), (1, 0), expected 0, but computed 1
8 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 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 0 ms 212 KB Output is correct
7 Incorrect 0 ms 212 KB on inputs (0, 2), (1, 0), expected 0, but computed 1
8 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 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 0 ms 212 KB Output is correct
7 Incorrect 0 ms 212 KB on inputs (0, 2), (1, 0), expected 0, but computed 1
8 Halted 0 ms 0 KB -

Subtask #5
12.0 / 12.0

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

Subtask #6
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 8 ms 1232 KB Output is correct
5 Correct 6 ms 1008 KB Output is correct
6 Correct 3 ms 596 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 2 ms 492 KB Output is correct
9 Incorrect 3 ms 1616 KB WA in grader: Too many instructions
10 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 1424 KB on inputs (57, 107), (59, 108), expected 0, but computed 1
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 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 0 ms 212 KB Output is correct
7 Incorrect 0 ms 212 KB on inputs (0, 2), (1, 0), expected 0, but computed 1
8 Halted 0 ms 0 KB -