oj.uz

Submission #596614

# Submission time Handle Problem Language Result Execution time Memory
596614 2022-07-14T21:45:52 Z Temmie Vision Program (IOI19_vision) C++17
44 / 100
 977 ms 14624 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;
	//}
	std::map <std::vector <std::pair <int, int>>, int> mp;
	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);
			std::sort(cas[i][j].can.begin(), cas[i][j].can.end());
			if (cas[i][j].can.empty()) {
				continue;
			}
			auto it = mp.find(cas[i][j].can);
			int ind1;
			if (it != mp.end()) {
				ind1 = it->second;
			} else {
				ind1 = add_or(conv(m, cas[i][j].can));
				mp[cas[i][j].can] = ind1;
			}
			int ind2 = add_and({ ind1 , i * m + j });
			or_last.push_back(ind2);
		}
	}
	assert(or_last.size());
	add_or(or_last);
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 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 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 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 0 ms 212 KB Output is correct
16 Correct 1 ms 244 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 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 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 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 0 ms 212 KB Output is correct
16 Correct 1 ms 244 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 296 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 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 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 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 0 ms 212 KB Output is correct
16 Correct 1 ms 244 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 296 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 24 ms 1236 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 13 ms 316 KB Output is correct
32 Correct 2 ms 468 KB Output is correct
33 Correct 6 ms 596 KB Output is correct
34 Correct 23 ms 1292 KB Output is correct
35 Correct 44 ms 992 KB Output is correct
36 Correct 47 ms 376 KB Output is correct
37 Correct 47 ms 312 KB Output is correct

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 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 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 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 0 ms 212 KB Output is correct
16 Correct 1 ms 244 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 296 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 24 ms 1236 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 13 ms 316 KB Output is correct
32 Correct 2 ms 468 KB Output is correct
33 Correct 6 ms 596 KB Output is correct
34 Correct 23 ms 1292 KB Output is correct
35 Correct 44 ms 992 KB Output is correct
36 Correct 47 ms 376 KB Output is correct
37 Correct 47 ms 312 KB Output is correct
38 Incorrect 977 ms 14624 KB WA in grader: Too many instructions
39 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 3 ms 340 KB Output is correct
3 Correct 2 ms 308 KB Output is correct
4 Correct 2 ms 212 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 4 ms 304 KB Output is correct
7 Correct 4 ms 344 KB Output is correct
8 Correct 4 ms 224 KB Output is correct
9 Correct 1 ms 292 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 3 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 3 ms 212 KB Output is correct
14 Correct 3 ms 212 KB Output is correct
15 Correct 3 ms 340 KB Output is correct
16 Correct 4 ms 340 KB Output is correct
17 Correct 4 ms 340 KB Output is correct
18 Correct 4 ms 340 KB Output is correct
19 Correct 4 ms 340 KB Output is correct
20 Correct 4 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 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 47 ms 1344 KB Output is correct
4 Correct 225 ms 4528 KB Output is correct
5 Correct 391 ms 3008 KB Output is correct
6 Correct 474 ms 1148 KB Output is correct
7 Correct 491 ms 340 KB Output is correct
8 Incorrect 19 ms 1956 KB WA in grader: Too many instructions
9 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 72 ms 3064 KB WA in grader: Too many instructions
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 1 ms 212 KB Output is correct
3 Correct 1 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 1 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 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 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 0 ms 212 KB Output is correct
16 Correct 1 ms 244 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 296 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 24 ms 1236 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 13 ms 316 KB Output is correct
32 Correct 2 ms 468 KB Output is correct
33 Correct 6 ms 596 KB Output is correct
34 Correct 23 ms 1292 KB Output is correct
35 Correct 44 ms 992 KB Output is correct
36 Correct 47 ms 376 KB Output is correct
37 Correct 47 ms 312 KB Output is correct
38 Incorrect 977 ms 14624 KB WA in grader: Too many instructions
39 Halted 0 ms 0 KB -