oj.uz

Submission #830265

# Submission time Handle Problem Language Result Execution time Memory
830265 2023-08-19T01:54:20 Z pavement Vision Program (IOI19_vision) C++17
0 / 100
 6 ms 4560 KB 
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;

#define pb push_back

void construct_network(int H, int W, int K) {
	auto conv = [&](int r, int c) {
		return r * W + c;
	};
	vector<int> row(H, -1), col(W, -1);
	int ins = H * W;
	for (int i = 0; i < H; i++) {
		for (int j = i + 1; j < H; j++) {
			vector<int> cur1, cur2;
			for (int k = 0; k < W; k++) {
				cur1.pb(conv(i, k));
				cur2.pb(conv(j, k));
			}
			add_or(cur1);
			add_or(cur2);
			add_and({ins, ins + 1});
			ins += 3;
			row[j - i] = ins - 1;
		}
	}
	{
		vector<int> tmp;
		for (int i = 1; i < H; i++) {
			tmp.pb(row[i]);
		}
		add_or(tmp);
		add_not({ins});
		ins += 2;
		row[0] = ins - 1;
	}
	for (int i = 0; i < W; i++) {
		for (int j = i + 1; j < W; j++) {
			vector<int> cur1, cur2;
			for (int k = 0; k < H; k++) {
				cur1.pb(conv(k, i));
				cur2.pb(conv(k, j));
			}
			add_or(cur1);
			add_or(cur2);
			add_and({ins, ins + 1});
			ins += 3;
			col[j - i] = ins - 1;
		}
	}
	{
		vector<int> tmp;
		for (int i = 1; i < W; i++) {
			tmp.pb(col[i]);
		}
		add_or(tmp);
		add_not({ins});
		ins += 2;
		col[0] = ins - 1;
	}
	vector<int> fin;
	for (int i = 0; i <= K; i++) {
		int j = K - i;
		if (0 <= i && i < H && 0 <= j && j < W) {
			add_and({row[i], col[j]});
			fin.pb(ins);
			ins++;
		}
	}
	add_or(fin);
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB WA in grader: Instruction with no inputs
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB WA in grader: Instruction with no inputs
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB WA in grader: Instruction with no inputs
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB WA in grader: Instruction with no inputs
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB WA in grader: Instruction with no inputs
2 Halted 0 ms 0 KB -

Subtask #6
0 / 8.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 Incorrect 3 ms 1508 KB WA in grader: Too many instructions
4 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 4560 KB WA in grader: Too many inputs
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB WA in grader: Instruction with no inputs
2 Halted 0 ms 0 KB -