oj.uz

Submission #596613

# Submission time Handle Problem Language Result Execution time Memory
596613 2022-07-14T21:40:52 Z Temmie Vision Program (IOI19_vision) C++17
0 / 100
 476 ms 3272 KB 
#include "vision.h"
#include <bits/stdc++.h>

struct Case {
	int i, j;
	std::vector <std::pair <int, int>> can;
};

constexpr const int di[4] = { 1, -1, 0, 0 };
constexpr const int dj[4] = { 0, 0, 1, -1 };

constexpr bool ok(int i, int j, int n, int m) {
	return i >= 0 && j >= 0 && i < n && j < m;
}

std::vector <std::pair <int, int>> get(int n, int m, int k, int si, int sj) {
	std::vector <std::pair <int, int>> res;
	std::queue <std::pair <int, std::pair <int, int>>> q;
	std::vector <std::vector <bool>> vis(n, std::vector <bool> (m, false));
	q.push({ 0, { si, sj } });
	while (q.size()) {
		int w = q.front().first;
		int i = q.front().second.first;
		int j = q.front().second.second;
		q.pop();
		if (!ok(i, j, n, m) || vis[i][j]) {
			continue;
		}
		vis[i][j] = true;
		if (w == k) {
			res.emplace_back(i, j);
		}
		if (w < k) {
			for (int d = 0; d < 4; d++) {
				q.push({ w + 1, { i + di[d], j + dj[d] } });
			}
		}
	}
	return res;
}

std::vector <int> conv(int m, const std::vector <std::pair <int, int>>& a) {
	std::vector <int> res(a.size());
	for (int i = 0; i < (int) a.size(); i++) {
		res[i] = a[i].first * m + a[i].second;
	}
	return res;
}

void construct_network(int n, int m, int k) {
	std::vector <std::vector <Case>> cas(n, std::vector <Case> (m));
	std::vector <int> or_last;
	if (k == 1) {
		std::vector <int> a, b;
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				if ((i + j) & 1) a.push_back(i * m + j);
				else b.push_back(i * m + j);
			}
		}
		int ind1 = add_or(a);
		int ind2 = add_or(a);
		add_and({ ind1, ind2 });
		return;
	}
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cas[i][j].i = i;
			cas[i][j].j = j;
			cas[i][j].can = get(n, m, k, i, j);
			if (cas[i][j].can.empty()) {
				continue;
			}
			int ind1 = add_or(conv(m, cas[i][j].can));
			int ind2 = add_and({ ind1 , i * m + j });
			or_last.push_back(ind2);
		}
	}
	assert(or_last.size());
	add_or(or_last);
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 11.0

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

Subtask #3
0 / 11.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 12.0

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

Subtask #6
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 237 ms 3272 KB Output is correct
5 Correct 397 ms 2196 KB Output is correct
6 Correct 476 ms 1096 KB Output is correct
7 Correct 472 ms 384 KB Output is correct
8 Incorrect 1 ms 468 KB on inputs (0, 0), (43, 134), expected 0, but computed 1
9 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 2052 KB on inputs (126, 120), (176, 169), expected 0, but computed 1
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

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