oj.uz

답안 #771758

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
771758 2023-07-03T08:55:22 Z LittleCube From Hacks to Snitches (BOI21_watchmen) C++17
15 / 100
 6000 ms 242884 KB 
#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
#define ll long long
#define state tuple<ll, int, int, int>
#define F first
#define S second
using namespace std;

int N, M, K, L, l[2500005], r[2500005], nxt[2500005];
vector<int> v[2000];
vector<ll> dis[2500005];
vector<bitset<1501>> vis[2500005];
vector<int> E[2500005];

bool good(int u, ll t)
{
	return r[u] == 0 || v[r[u]][t % l[r[u]]] != u;
}

bool goodmove(int u, int v, ll t)
{
	if (u == nxt[v])
		return good(u, t) && good(v, t);
	else
		return good(v, t);
}

signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	cin >> N >> M;
	for (int i = 1; i <= M; i++)
	{
		int u, v;
		cin >> u >> v;
		E[u].emplace_back(v);
		E[v].emplace_back(u);
	}
	l[0] = 1;
	cin >> K;
	for (int i = 1; i <= K; i++)
	{
		cin >> l[i];
		L = max(L, l[i]);
		v[i].resize(l[i]);
		for (int j = 0; j < l[i]; j++)
		{
			cin >> v[i][j];
			r[v[i][j]] = i;
			vis[v[i][j]].resize(l[i]);
		}
		for (int j = 0; j < l[i]; j++)
			nxt[v[i][j]] = v[i][(j + 1) % l[i]];
	}
	for (int i = 1; i <= N; i++)
		dis[i].resize(l[r[i]], (ll)1e18);
	dis[1][0] = 0;
	priority_queue<state, vector<state>, greater<state>> pq;
	pq.push(state{0, 1, 0, 0});
	while (!pq.empty())
	{
		auto [d, u, k, b] = pq.top();
		pq.pop();
		if (!b && d > dis[u][k])
			continue;
		if (!b)
		{
			for (auto v : E[u])
				if (r[v] == 0 && d + 1 < dis[v][0])
				{
					dis[v][0] = d + 1;
					pq.push(state{d + 1, v, 0, 0});
				}
				else if (r[v])
				{
					if (!goodmove(u, v, d + 1) && l[r[u]] % l[r[v]] == 0)
						continue;
					pq.push(state{d, u, k, v});
				}

			int rem = (d + 1) % l[r[u]];
			if (good(u, d + 1) && dis[u][rem] > d + 1)
			{
				dis[u][rem] = d + 1;
				pq.push(state{d + 1, u, rem, 0});
			}
		}
		else
		{
			// u -> b
			int rem = (d + 1) % l[r[b]];
			if (vis[b][rem][l[r[u]]])
				continue;
			if (goodmove(u, b, d + 1))
			{
				vis[b][rem][l[r[u]]] = 1;
				if (dis[b][rem] > d + 1)
				{
					dis[b][rem] = d + 1;
					pq.push(state{d + 1, b, rem, 0});
				}
			}
			pq.push(state{d + l[r[u]], u, k, b});
		}
	}
	// for (int i = 1; i <= N; i++)
	// {
	// 	cout << i << ":";
	// 	for (auto j : dis[i])
	// 		cout << ' ' << j;
	// 	cout << '\n';
	// }
	if (dis[N][0] >= 1e18)
		cout << "impossible\n";
	else
		cout << dis[N][0] << '\n';
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 356 ms 180900 KB Output is correct
2 Correct 134 ms 186880 KB Output is correct
3 Correct 138 ms 186168 KB Output is correct
4 Correct 384 ms 186404 KB Output is correct
5 Correct 91 ms 179872 KB Output is correct
6 Correct 138 ms 186204 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 359 ms 180916 KB Output is correct
2 Correct 135 ms 186796 KB Output is correct
3 Correct 143 ms 186204 KB Output is correct
4 Correct 437 ms 186392 KB Output is correct
5 Correct 93 ms 179996 KB Output is correct
6 Correct 140 ms 186252 KB Output is correct
7 Correct 125 ms 184348 KB Output is correct
8 Correct 123 ms 183884 KB Output is correct
9 Correct 124 ms 183304 KB Output is correct
10 Correct 189 ms 184664 KB Output is correct
11 Correct 138 ms 183428 KB Output is correct
12 Correct 129 ms 184468 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 359 ms 180916 KB Output is correct
2 Correct 135 ms 186796 KB Output is correct
3 Correct 143 ms 186204 KB Output is correct
4 Correct 437 ms 186392 KB Output is correct
5 Correct 93 ms 179996 KB Output is correct
6 Correct 140 ms 186252 KB Output is correct
7 Correct 125 ms 184348 KB Output is correct
8 Correct 123 ms 183884 KB Output is correct
9 Correct 124 ms 183304 KB Output is correct
10 Correct 189 ms 184664 KB Output is correct
11 Correct 138 ms 183428 KB Output is correct
12 Correct 129 ms 184468 KB Output is correct
13 Correct 358 ms 180960 KB Output is correct
14 Correct 134 ms 186808 KB Output is correct
15 Correct 139 ms 186256 KB Output is correct
16 Correct 397 ms 186380 KB Output is correct
17 Correct 96 ms 179956 KB Output is correct
18 Correct 168 ms 186252 KB Output is correct
19 Correct 136 ms 184388 KB Output is correct
20 Correct 124 ms 183900 KB Output is correct
21 Correct 126 ms 183324 KB Output is correct
22 Correct 192 ms 184652 KB Output is correct
23 Correct 141 ms 183580 KB Output is correct
24 Correct 128 ms 184440 KB Output is correct
25 Correct 1124 ms 235408 KB Output is correct
26 Correct 1004 ms 242884 KB Output is correct
27 Correct 939 ms 233984 KB Output is correct
28 Correct 807 ms 231656 KB Output is correct
29 Execution timed out 6050 ms 228760 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 359 ms 180916 KB Output is correct
2 Correct 135 ms 186796 KB Output is correct
3 Correct 143 ms 186204 KB Output is correct
4 Correct 437 ms 186392 KB Output is correct
5 Correct 93 ms 179996 KB Output is correct
6 Correct 140 ms 186252 KB Output is correct
7 Correct 125 ms 184348 KB Output is correct
8 Correct 123 ms 183884 KB Output is correct
9 Correct 124 ms 183304 KB Output is correct
10 Correct 189 ms 184664 KB Output is correct
11 Correct 138 ms 183428 KB Output is correct
12 Correct 129 ms 184468 KB Output is correct
13 Correct 358 ms 180960 KB Output is correct
14 Correct 134 ms 186808 KB Output is correct
15 Correct 139 ms 186256 KB Output is correct
16 Correct 397 ms 186380 KB Output is correct
17 Correct 96 ms 179956 KB Output is correct
18 Correct 168 ms 186252 KB Output is correct
19 Correct 136 ms 184388 KB Output is correct
20 Correct 124 ms 183900 KB Output is correct
21 Correct 126 ms 183324 KB Output is correct
22 Correct 192 ms 184652 KB Output is correct
23 Correct 141 ms 183580 KB Output is correct
24 Correct 128 ms 184440 KB Output is correct
25 Correct 1124 ms 235408 KB Output is correct
26 Correct 1004 ms 242884 KB Output is correct
27 Correct 939 ms 233984 KB Output is correct
28 Correct 807 ms 231656 KB Output is correct
29 Execution timed out 6050 ms 228760 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 356 ms 180900 KB Output is correct
2 Correct 134 ms 186880 KB Output is correct
3 Correct 138 ms 186168 KB Output is correct
4 Correct 384 ms 186404 KB Output is correct
5 Correct 91 ms 179872 KB Output is correct
6 Correct 138 ms 186204 KB Output is correct
7 Correct 359 ms 180916 KB Output is correct
8 Correct 135 ms 186796 KB Output is correct
9 Correct 143 ms 186204 KB Output is correct
10 Correct 437 ms 186392 KB Output is correct
11 Correct 93 ms 179996 KB Output is correct
12 Correct 140 ms 186252 KB Output is correct
13 Correct 125 ms 184348 KB Output is correct
14 Correct 123 ms 183884 KB Output is correct
15 Correct 124 ms 183304 KB Output is correct
16 Correct 189 ms 184664 KB Output is correct
17 Correct 138 ms 183428 KB Output is correct
18 Correct 129 ms 184468 KB Output is correct
19 Correct 86 ms 176528 KB Output is correct
20 Correct 119 ms 176504 KB Output is correct
21 Correct 89 ms 176412 KB Output is correct
22 Correct 361 ms 180960 KB Output is correct
23 Correct 139 ms 186832 KB Output is correct
24 Correct 143 ms 186256 KB Output is correct
25 Correct 385 ms 186372 KB Output is correct
26 Correct 95 ms 179876 KB Output is correct
27 Correct 139 ms 186232 KB Output is correct
28 Correct 135 ms 184344 KB Output is correct
29 Correct 129 ms 183936 KB Output is correct
30 Correct 129 ms 183316 KB Output is correct
31 Correct 206 ms 184584 KB Output is correct
32 Correct 137 ms 183476 KB Output is correct
33 Correct 134 ms 184444 KB Output is correct
34 Correct 1100 ms 228008 KB Output is correct
35 Correct 1284 ms 224252 KB Output is correct
36 Correct 1238 ms 224368 KB Output is correct
37 Correct 1033 ms 228700 KB Output is correct
38 Correct 1104 ms 226768 KB Output is correct
39 Execution timed out 6054 ms 225104 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 356 ms 180900 KB Output is correct
2 Correct 134 ms 186880 KB Output is correct
3 Correct 138 ms 186168 KB Output is correct
4 Correct 384 ms 186404 KB Output is correct
5 Correct 91 ms 179872 KB Output is correct
6 Correct 138 ms 186204 KB Output is correct
7 Correct 359 ms 180916 KB Output is correct
8 Correct 135 ms 186796 KB Output is correct
9 Correct 143 ms 186204 KB Output is correct
10 Correct 437 ms 186392 KB Output is correct
11 Correct 93 ms 179996 KB Output is correct
12 Correct 140 ms 186252 KB Output is correct
13 Correct 125 ms 184348 KB Output is correct
14 Correct 123 ms 183884 KB Output is correct
15 Correct 124 ms 183304 KB Output is correct
16 Correct 189 ms 184664 KB Output is correct
17 Correct 138 ms 183428 KB Output is correct
18 Correct 129 ms 184468 KB Output is correct
19 Correct 358 ms 180960 KB Output is correct
20 Correct 134 ms 186808 KB Output is correct
21 Correct 139 ms 186256 KB Output is correct
22 Correct 397 ms 186380 KB Output is correct
23 Correct 96 ms 179956 KB Output is correct
24 Correct 168 ms 186252 KB Output is correct
25 Correct 136 ms 184388 KB Output is correct
26 Correct 124 ms 183900 KB Output is correct
27 Correct 126 ms 183324 KB Output is correct
28 Correct 192 ms 184652 KB Output is correct
29 Correct 141 ms 183580 KB Output is correct
30 Correct 128 ms 184440 KB Output is correct
31 Correct 1124 ms 235408 KB Output is correct
32 Correct 1004 ms 242884 KB Output is correct
33 Correct 939 ms 233984 KB Output is correct
34 Correct 807 ms 231656 KB Output is correct
35 Execution timed out 6050 ms 228760 KB Time limit exceeded
36 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 356 ms 180900 KB Output is correct
2 Correct 134 ms 186880 KB Output is correct
3 Correct 138 ms 186168 KB Output is correct
4 Correct 384 ms 186404 KB Output is correct
5 Correct 91 ms 179872 KB Output is correct
6 Correct 138 ms 186204 KB Output is correct
7 Correct 359 ms 180916 KB Output is correct
8 Correct 135 ms 186796 KB Output is correct
9 Correct 143 ms 186204 KB Output is correct
10 Correct 437 ms 186392 KB Output is correct
11 Correct 93 ms 179996 KB Output is correct
12 Correct 140 ms 186252 KB Output is correct
13 Correct 125 ms 184348 KB Output is correct
14 Correct 123 ms 183884 KB Output is correct
15 Correct 124 ms 183304 KB Output is correct
16 Correct 189 ms 184664 KB Output is correct
17 Correct 138 ms 183428 KB Output is correct
18 Correct 129 ms 184468 KB Output is correct
19 Correct 358 ms 180960 KB Output is correct
20 Correct 134 ms 186808 KB Output is correct
21 Correct 139 ms 186256 KB Output is correct
22 Correct 397 ms 186380 KB Output is correct
23 Correct 96 ms 179956 KB Output is correct
24 Correct 168 ms 186252 KB Output is correct
25 Correct 136 ms 184388 KB Output is correct
26 Correct 124 ms 183900 KB Output is correct
27 Correct 126 ms 183324 KB Output is correct
28 Correct 192 ms 184652 KB Output is correct
29 Correct 141 ms 183580 KB Output is correct
30 Correct 128 ms 184440 KB Output is correct
31 Correct 1124 ms 235408 KB Output is correct
32 Correct 1004 ms 242884 KB Output is correct
33 Correct 939 ms 233984 KB Output is correct
34 Correct 807 ms 231656 KB Output is correct
35 Execution timed out 6050 ms 228760 KB Time limit exceeded
36 Halted 0 ms 0 KB -