oj.uz

Submission #938415

# Submission time Handle Problem Language Result Execution time Memory
938415 2024-03-05T06:12:59 Z Gromp15 From Hacks to Snitches (BOI21_watchmen) C++17
15 / 100
 6000 ms 67268 KB 
#include <bits/stdc++.h>
#define ll long long
#define ar array
#define db double
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define rint(l, r) uniform_int_distribution<int>(l, r)(rng)
template<typename T> bool ckmin(T &a, const T &b) { return a > b ? a = b, 1 : 0; }
template<typename T> bool ckmax(T &a, const T &b) { return a < b ? a = b, 1 : 0; }
void test_case() {
	int n, m;
	cin >> n >> m;
	vector<vector<int>> adj(n+1);
	for (int i = 0; i < m; i++) {
		int x, y;
		cin >> x >> y;
		adj[x].push_back(y);
		adj[y].push_back(x);
	}
	vector<int> size(n+1, 1), who(n+1, -1), id(n+1, -1);
	int Q; cin >> Q;
	for (int i = 0; i < Q; i++) {
		int cur; cin >> cur;
		for (int j = 0; j < cur; j++) {
			int x; cin >> x;
			size[x] = cur;
			who[x] = j;
			id[x] = i;
		}
	}
	// if size[v]
	// then, dist[v] % size[v] != who[v]
	vector<vector<int>> dist(n+1);
	for (int i = 1; i <= n; i++) {
		dist[i].resize(size[i], 1e9);
	}
	priority_queue<ar<int, 3>, vector<ar<int, 3>>, greater<ar<int, 3>>> q;
	dist[1][0] = 0;
	q.push({0, 1, 0});
	auto can_wait = [&](int l, int r, int v) -> bool {
		if (size[v] == 1) return 1;
		int L = l % size[v], R = r % size[v];
		// L --> R
		if (L <= R) {
			return who[v] < L || who[v] > R;
		}
		else {
			return R < who[v] && who[v] < L;
		}
	};
	// number of nodes = N + sum(L)
	vector<bool> vis(n+1);
	while (q.size()) {
		auto [cost, v, time] = q.top(); q.pop();
		if (cost != dist[v][time]) continue;
		for (int u : adj[v]) {
			for (int i = 1; i <= size[u]; i++) {
				if ((cost + i) % size[u] != who[u] && (id[u] != id[v] || ((who[u] + 1) % size[u] != who[v]) || ((cost + i - 1) % size[u] != who[u])) && can_wait(cost, cost + i - 1, v) && ckmin(dist[u][(cost + i) % size[u]], cost + i)) {
					q.push({cost + i, u, (cost + i) % size[u]});
				}
			}
		}
	}
	int ans = *min_element(all(dist[n]));
	if (ans == 1e9) {
		cout << "impossible\n";
		return;
	}
	cout << ans << '\n';



}
int main() {
    cin.tie(0)->sync_with_stdio(0);
    int t = 1;
//    cin >> t;
    while (t--) test_case();
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4221 ms 1628 KB Output is correct
2 Correct 147 ms 12820 KB Output is correct
3 Correct 172 ms 11724 KB Output is correct
4 Correct 4210 ms 11908 KB Output is correct
5 Correct 73 ms 660 KB Output is correct
6 Correct 124 ms 11772 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4234 ms 1628 KB Output is correct
2 Correct 136 ms 12632 KB Output is correct
3 Correct 142 ms 11772 KB Output is correct
4 Correct 4203 ms 12056 KB Output is correct
5 Correct 74 ms 604 KB Output is correct
6 Correct 121 ms 11768 KB Output is correct
7 Correct 61 ms 11532 KB Output is correct
8 Correct 50 ms 11860 KB Output is correct
9 Correct 39 ms 11356 KB Output is correct
10 Correct 507 ms 11800 KB Output is correct
11 Correct 82 ms 11860 KB Output is correct
12 Correct 66 ms 11600 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4234 ms 1628 KB Output is correct
2 Correct 136 ms 12632 KB Output is correct
3 Correct 142 ms 11772 KB Output is correct
4 Correct 4203 ms 12056 KB Output is correct
5 Correct 74 ms 604 KB Output is correct
6 Correct 121 ms 11768 KB Output is correct
7 Correct 61 ms 11532 KB Output is correct
8 Correct 50 ms 11860 KB Output is correct
9 Correct 39 ms 11356 KB Output is correct
10 Correct 507 ms 11800 KB Output is correct
11 Correct 82 ms 11860 KB Output is correct
12 Correct 66 ms 11600 KB Output is correct
13 Correct 4216 ms 1628 KB Output is correct
14 Correct 138 ms 12636 KB Output is correct
15 Correct 147 ms 11792 KB Output is correct
16 Correct 4218 ms 12056 KB Output is correct
17 Correct 74 ms 600 KB Output is correct
18 Correct 132 ms 11716 KB Output is correct
19 Correct 80 ms 11616 KB Output is correct
20 Correct 53 ms 11856 KB Output is correct
21 Correct 39 ms 11356 KB Output is correct
22 Correct 516 ms 11788 KB Output is correct
23 Correct 60 ms 11532 KB Output is correct
24 Correct 64 ms 11348 KB Output is correct
25 Correct 1507 ms 63900 KB Output is correct
26 Correct 1530 ms 67268 KB Output is correct
27 Correct 1156 ms 63560 KB Output is correct
28 Correct 845 ms 66900 KB Output is correct
29 Execution timed out 6037 ms 60396 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4234 ms 1628 KB Output is correct
2 Correct 136 ms 12632 KB Output is correct
3 Correct 142 ms 11772 KB Output is correct
4 Correct 4203 ms 12056 KB Output is correct
5 Correct 74 ms 604 KB Output is correct
6 Correct 121 ms 11768 KB Output is correct
7 Correct 61 ms 11532 KB Output is correct
8 Correct 50 ms 11860 KB Output is correct
9 Correct 39 ms 11356 KB Output is correct
10 Correct 507 ms 11800 KB Output is correct
11 Correct 82 ms 11860 KB Output is correct
12 Correct 66 ms 11600 KB Output is correct
13 Correct 4216 ms 1628 KB Output is correct
14 Correct 138 ms 12636 KB Output is correct
15 Correct 147 ms 11792 KB Output is correct
16 Correct 4218 ms 12056 KB Output is correct
17 Correct 74 ms 600 KB Output is correct
18 Correct 132 ms 11716 KB Output is correct
19 Correct 80 ms 11616 KB Output is correct
20 Correct 53 ms 11856 KB Output is correct
21 Correct 39 ms 11356 KB Output is correct
22 Correct 516 ms 11788 KB Output is correct
23 Correct 60 ms 11532 KB Output is correct
24 Correct 64 ms 11348 KB Output is correct
25 Correct 1507 ms 63900 KB Output is correct
26 Correct 1530 ms 67268 KB Output is correct
27 Correct 1156 ms 63560 KB Output is correct
28 Correct 845 ms 66900 KB Output is correct
29 Execution timed out 6037 ms 60396 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4221 ms 1628 KB Output is correct
2 Correct 147 ms 12820 KB Output is correct
3 Correct 172 ms 11724 KB Output is correct
4 Correct 4210 ms 11908 KB Output is correct
5 Correct 73 ms 660 KB Output is correct
6 Correct 124 ms 11772 KB Output is correct
7 Correct 4234 ms 1628 KB Output is correct
8 Correct 136 ms 12632 KB Output is correct
9 Correct 142 ms 11772 KB Output is correct
10 Correct 4203 ms 12056 KB Output is correct
11 Correct 74 ms 604 KB Output is correct
12 Correct 121 ms 11768 KB Output is correct
13 Correct 61 ms 11532 KB Output is correct
14 Correct 50 ms 11860 KB Output is correct
15 Correct 39 ms 11356 KB Output is correct
16 Correct 507 ms 11800 KB Output is correct
17 Correct 82 ms 11860 KB Output is correct
18 Correct 66 ms 11600 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 4218 ms 1628 KB Output is correct
23 Correct 144 ms 13176 KB Output is correct
24 Correct 137 ms 11772 KB Output is correct
25 Correct 4213 ms 11936 KB Output is correct
26 Correct 74 ms 664 KB Output is correct
27 Correct 128 ms 11800 KB Output is correct
28 Correct 63 ms 11600 KB Output is correct
29 Correct 49 ms 11416 KB Output is correct
30 Correct 37 ms 11344 KB Output is correct
31 Correct 496 ms 12048 KB Output is correct
32 Correct 60 ms 11604 KB Output is correct
33 Correct 66 ms 11604 KB Output is correct
34 Correct 1207 ms 63904 KB Output is correct
35 Correct 1369 ms 60548 KB Output is correct
36 Correct 1348 ms 60108 KB Output is correct
37 Correct 942 ms 65468 KB Output is correct
38 Correct 1162 ms 63092 KB Output is correct
39 Execution timed out 6021 ms 61148 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4221 ms 1628 KB Output is correct
2 Correct 147 ms 12820 KB Output is correct
3 Correct 172 ms 11724 KB Output is correct
4 Correct 4210 ms 11908 KB Output is correct
5 Correct 73 ms 660 KB Output is correct
6 Correct 124 ms 11772 KB Output is correct
7 Correct 4234 ms 1628 KB Output is correct
8 Correct 136 ms 12632 KB Output is correct
9 Correct 142 ms 11772 KB Output is correct
10 Correct 4203 ms 12056 KB Output is correct
11 Correct 74 ms 604 KB Output is correct
12 Correct 121 ms 11768 KB Output is correct
13 Correct 61 ms 11532 KB Output is correct
14 Correct 50 ms 11860 KB Output is correct
15 Correct 39 ms 11356 KB Output is correct
16 Correct 507 ms 11800 KB Output is correct
17 Correct 82 ms 11860 KB Output is correct
18 Correct 66 ms 11600 KB Output is correct
19 Correct 4216 ms 1628 KB Output is correct
20 Correct 138 ms 12636 KB Output is correct
21 Correct 147 ms 11792 KB Output is correct
22 Correct 4218 ms 12056 KB Output is correct
23 Correct 74 ms 600 KB Output is correct
24 Correct 132 ms 11716 KB Output is correct
25 Correct 80 ms 11616 KB Output is correct
26 Correct 53 ms 11856 KB Output is correct
27 Correct 39 ms 11356 KB Output is correct
28 Correct 516 ms 11788 KB Output is correct
29 Correct 60 ms 11532 KB Output is correct
30 Correct 64 ms 11348 KB Output is correct
31 Correct 1507 ms 63900 KB Output is correct
32 Correct 1530 ms 67268 KB Output is correct
33 Correct 1156 ms 63560 KB Output is correct
34 Correct 845 ms 66900 KB Output is correct
35 Execution timed out 6037 ms 60396 KB Time limit exceeded
36 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4221 ms 1628 KB Output is correct
2 Correct 147 ms 12820 KB Output is correct
3 Correct 172 ms 11724 KB Output is correct
4 Correct 4210 ms 11908 KB Output is correct
5 Correct 73 ms 660 KB Output is correct
6 Correct 124 ms 11772 KB Output is correct
7 Correct 4234 ms 1628 KB Output is correct
8 Correct 136 ms 12632 KB Output is correct
9 Correct 142 ms 11772 KB Output is correct
10 Correct 4203 ms 12056 KB Output is correct
11 Correct 74 ms 604 KB Output is correct
12 Correct 121 ms 11768 KB Output is correct
13 Correct 61 ms 11532 KB Output is correct
14 Correct 50 ms 11860 KB Output is correct
15 Correct 39 ms 11356 KB Output is correct
16 Correct 507 ms 11800 KB Output is correct
17 Correct 82 ms 11860 KB Output is correct
18 Correct 66 ms 11600 KB Output is correct
19 Correct 4216 ms 1628 KB Output is correct
20 Correct 138 ms 12636 KB Output is correct
21 Correct 147 ms 11792 KB Output is correct
22 Correct 4218 ms 12056 KB Output is correct
23 Correct 74 ms 600 KB Output is correct
24 Correct 132 ms 11716 KB Output is correct
25 Correct 80 ms 11616 KB Output is correct
26 Correct 53 ms 11856 KB Output is correct
27 Correct 39 ms 11356 KB Output is correct
28 Correct 516 ms 11788 KB Output is correct
29 Correct 60 ms 11532 KB Output is correct
30 Correct 64 ms 11348 KB Output is correct
31 Correct 1507 ms 63900 KB Output is correct
32 Correct 1530 ms 67268 KB Output is correct
33 Correct 1156 ms 63560 KB Output is correct
34 Correct 845 ms 66900 KB Output is correct
35 Execution timed out 6037 ms 60396 KB Time limit exceeded
36 Halted 0 ms 0 KB -