oj.uz

답안 #771760

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
771760 2023-07-03T09:02:17 Z LittleCube From Hacks to Snitches (BOI21_watchmen) C++17
15 / 100
 6000 ms 242956 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];
ll cnt = 0;
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
		{
			cnt++;
			// u -> b
			int rem = (d + 1) % l[r[b]];
			if (vis[b][rem][l[r[u]]])
				continue;
			if (goodmove(u, b, d + 1))
			{
				if (dis[b][rem] > d + 1)
				{
					dis[b][rem] = d + 1;
					pq.push(state{d + 1, b, rem, 0});
				}
			}
			vis[b][rem][l[r[u]]] = 1;
			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';
	// }
	cerr << "update counter " << cnt << '\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 364 ms 180936 KB Output is correct
2 Correct 149 ms 186884 KB Output is correct
3 Correct 137 ms 186228 KB Output is correct
4 Correct 391 ms 186408 KB Output is correct
5 Correct 91 ms 179992 KB Output is correct
6 Correct 136 ms 186236 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 371 ms 180964 KB Output is correct
2 Correct 149 ms 186876 KB Output is correct
3 Correct 147 ms 186256 KB Output is correct
4 Correct 387 ms 186384 KB Output is correct
5 Correct 97 ms 179980 KB Output is correct
6 Correct 141 ms 186252 KB Output is correct
7 Correct 126 ms 184360 KB Output is correct
8 Correct 135 ms 183876 KB Output is correct
9 Correct 126 ms 183340 KB Output is correct
10 Correct 189 ms 184568 KB Output is correct
11 Correct 139 ms 183436 KB Output is correct
12 Correct 129 ms 184472 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 371 ms 180964 KB Output is correct
2 Correct 149 ms 186876 KB Output is correct
3 Correct 147 ms 186256 KB Output is correct
4 Correct 387 ms 186384 KB Output is correct
5 Correct 97 ms 179980 KB Output is correct
6 Correct 141 ms 186252 KB Output is correct
7 Correct 126 ms 184360 KB Output is correct
8 Correct 135 ms 183876 KB Output is correct
9 Correct 126 ms 183340 KB Output is correct
10 Correct 189 ms 184568 KB Output is correct
11 Correct 139 ms 183436 KB Output is correct
12 Correct 129 ms 184472 KB Output is correct
13 Correct 357 ms 181056 KB Output is correct
14 Correct 146 ms 186768 KB Output is correct
15 Correct 139 ms 186236 KB Output is correct
16 Correct 411 ms 186348 KB Output is correct
17 Correct 91 ms 179980 KB Output is correct
18 Correct 135 ms 186244 KB Output is correct
19 Correct 126 ms 184368 KB Output is correct
20 Correct 138 ms 183916 KB Output is correct
21 Correct 121 ms 183264 KB Output is correct
22 Correct 228 ms 184608 KB Output is correct
23 Correct 134 ms 183420 KB Output is correct
24 Correct 145 ms 184484 KB Output is correct
25 Correct 1219 ms 235568 KB Output is correct
26 Correct 1031 ms 242956 KB Output is correct
27 Correct 1008 ms 234004 KB Output is correct
28 Correct 876 ms 231756 KB Output is correct
29 Execution timed out 6084 ms 228700 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 371 ms 180964 KB Output is correct
2 Correct 149 ms 186876 KB Output is correct
3 Correct 147 ms 186256 KB Output is correct
4 Correct 387 ms 186384 KB Output is correct
5 Correct 97 ms 179980 KB Output is correct
6 Correct 141 ms 186252 KB Output is correct
7 Correct 126 ms 184360 KB Output is correct
8 Correct 135 ms 183876 KB Output is correct
9 Correct 126 ms 183340 KB Output is correct
10 Correct 189 ms 184568 KB Output is correct
11 Correct 139 ms 183436 KB Output is correct
12 Correct 129 ms 184472 KB Output is correct
13 Correct 357 ms 181056 KB Output is correct
14 Correct 146 ms 186768 KB Output is correct
15 Correct 139 ms 186236 KB Output is correct
16 Correct 411 ms 186348 KB Output is correct
17 Correct 91 ms 179980 KB Output is correct
18 Correct 135 ms 186244 KB Output is correct
19 Correct 126 ms 184368 KB Output is correct
20 Correct 138 ms 183916 KB Output is correct
21 Correct 121 ms 183264 KB Output is correct
22 Correct 228 ms 184608 KB Output is correct
23 Correct 134 ms 183420 KB Output is correct
24 Correct 145 ms 184484 KB Output is correct
25 Correct 1219 ms 235568 KB Output is correct
26 Correct 1031 ms 242956 KB Output is correct
27 Correct 1008 ms 234004 KB Output is correct
28 Correct 876 ms 231756 KB Output is correct
29 Execution timed out 6084 ms 228700 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 364 ms 180936 KB Output is correct
2 Correct 149 ms 186884 KB Output is correct
3 Correct 137 ms 186228 KB Output is correct
4 Correct 391 ms 186408 KB Output is correct
5 Correct 91 ms 179992 KB Output is correct
6 Correct 136 ms 186236 KB Output is correct
7 Correct 371 ms 180964 KB Output is correct
8 Correct 149 ms 186876 KB Output is correct
9 Correct 147 ms 186256 KB Output is correct
10 Correct 387 ms 186384 KB Output is correct
11 Correct 97 ms 179980 KB Output is correct
12 Correct 141 ms 186252 KB Output is correct
13 Correct 126 ms 184360 KB Output is correct
14 Correct 135 ms 183876 KB Output is correct
15 Correct 126 ms 183340 KB Output is correct
16 Correct 189 ms 184568 KB Output is correct
17 Correct 139 ms 183436 KB Output is correct
18 Correct 129 ms 184472 KB Output is correct
19 Correct 83 ms 176480 KB Output is correct
20 Correct 82 ms 176416 KB Output is correct
21 Correct 80 ms 176428 KB Output is correct
22 Correct 355 ms 180948 KB Output is correct
23 Correct 132 ms 186892 KB Output is correct
24 Correct 168 ms 186188 KB Output is correct
25 Correct 395 ms 186404 KB Output is correct
26 Correct 91 ms 179944 KB Output is correct
27 Correct 158 ms 186216 KB Output is correct
28 Correct 125 ms 184368 KB Output is correct
29 Correct 128 ms 183884 KB Output is correct
30 Correct 121 ms 183440 KB Output is correct
31 Correct 189 ms 184576 KB Output is correct
32 Correct 135 ms 183436 KB Output is correct
33 Correct 129 ms 184460 KB Output is correct
34 Correct 1200 ms 227884 KB Output is correct
35 Correct 1235 ms 224476 KB Output is correct
36 Correct 1218 ms 224180 KB Output is correct
37 Correct 1010 ms 228632 KB Output is correct
38 Correct 1097 ms 226868 KB Output is correct
39 Execution timed out 6046 ms 224972 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 364 ms 180936 KB Output is correct
2 Correct 149 ms 186884 KB Output is correct
3 Correct 137 ms 186228 KB Output is correct
4 Correct 391 ms 186408 KB Output is correct
5 Correct 91 ms 179992 KB Output is correct
6 Correct 136 ms 186236 KB Output is correct
7 Correct 371 ms 180964 KB Output is correct
8 Correct 149 ms 186876 KB Output is correct
9 Correct 147 ms 186256 KB Output is correct
10 Correct 387 ms 186384 KB Output is correct
11 Correct 97 ms 179980 KB Output is correct
12 Correct 141 ms 186252 KB Output is correct
13 Correct 126 ms 184360 KB Output is correct
14 Correct 135 ms 183876 KB Output is correct
15 Correct 126 ms 183340 KB Output is correct
16 Correct 189 ms 184568 KB Output is correct
17 Correct 139 ms 183436 KB Output is correct
18 Correct 129 ms 184472 KB Output is correct
19 Correct 357 ms 181056 KB Output is correct
20 Correct 146 ms 186768 KB Output is correct
21 Correct 139 ms 186236 KB Output is correct
22 Correct 411 ms 186348 KB Output is correct
23 Correct 91 ms 179980 KB Output is correct
24 Correct 135 ms 186244 KB Output is correct
25 Correct 126 ms 184368 KB Output is correct
26 Correct 138 ms 183916 KB Output is correct
27 Correct 121 ms 183264 KB Output is correct
28 Correct 228 ms 184608 KB Output is correct
29 Correct 134 ms 183420 KB Output is correct
30 Correct 145 ms 184484 KB Output is correct
31 Correct 1219 ms 235568 KB Output is correct
32 Correct 1031 ms 242956 KB Output is correct
33 Correct 1008 ms 234004 KB Output is correct
34 Correct 876 ms 231756 KB Output is correct
35 Execution timed out 6084 ms 228700 KB Time limit exceeded
36 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 364 ms 180936 KB Output is correct
2 Correct 149 ms 186884 KB Output is correct
3 Correct 137 ms 186228 KB Output is correct
4 Correct 391 ms 186408 KB Output is correct
5 Correct 91 ms 179992 KB Output is correct
6 Correct 136 ms 186236 KB Output is correct
7 Correct 371 ms 180964 KB Output is correct
8 Correct 149 ms 186876 KB Output is correct
9 Correct 147 ms 186256 KB Output is correct
10 Correct 387 ms 186384 KB Output is correct
11 Correct 97 ms 179980 KB Output is correct
12 Correct 141 ms 186252 KB Output is correct
13 Correct 126 ms 184360 KB Output is correct
14 Correct 135 ms 183876 KB Output is correct
15 Correct 126 ms 183340 KB Output is correct
16 Correct 189 ms 184568 KB Output is correct
17 Correct 139 ms 183436 KB Output is correct
18 Correct 129 ms 184472 KB Output is correct
19 Correct 357 ms 181056 KB Output is correct
20 Correct 146 ms 186768 KB Output is correct
21 Correct 139 ms 186236 KB Output is correct
22 Correct 411 ms 186348 KB Output is correct
23 Correct 91 ms 179980 KB Output is correct
24 Correct 135 ms 186244 KB Output is correct
25 Correct 126 ms 184368 KB Output is correct
26 Correct 138 ms 183916 KB Output is correct
27 Correct 121 ms 183264 KB Output is correct
28 Correct 228 ms 184608 KB Output is correct
29 Correct 134 ms 183420 KB Output is correct
30 Correct 145 ms 184484 KB Output is correct
31 Correct 1219 ms 235568 KB Output is correct
32 Correct 1031 ms 242956 KB Output is correct
33 Correct 1008 ms 234004 KB Output is correct
34 Correct 876 ms 231756 KB Output is correct
35 Execution timed out 6084 ms 228700 KB Time limit exceeded
36 Halted 0 ms 0 KB -