oj.uz

답안 #771768

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
771768 2023-07-03T09:07:47 Z LittleCube From Hacks to Snitches (BOI21_watchmen) C++17
15 / 100
 6000 ms 232084 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], mp[2000];
ll cnt = 0;
vector<int> v[2000];
vector<ll> dis[2500005];
vector<bitset<128>> 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];
		if (mp[l[i]] == 0)
			mp[l[i]] = ++L;
		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]];
	}
	assert(L < 128);
	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][mp[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][mp[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 178240 KB Output is correct
2 Correct 130 ms 184172 KB Output is correct
3 Correct 133 ms 183592 KB Output is correct
4 Correct 390 ms 183736 KB Output is correct
5 Correct 89 ms 177280 KB Output is correct
6 Correct 134 ms 183504 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 354 ms 178224 KB Output is correct
2 Correct 134 ms 184204 KB Output is correct
3 Correct 142 ms 183516 KB Output is correct
4 Correct 384 ms 183728 KB Output is correct
5 Correct 91 ms 177388 KB Output is correct
6 Correct 141 ms 183516 KB Output is correct
7 Correct 122 ms 183116 KB Output is correct
8 Correct 122 ms 183072 KB Output is correct
9 Correct 121 ms 182952 KB Output is correct
10 Correct 186 ms 183416 KB Output is correct
11 Correct 134 ms 183088 KB Output is correct
12 Correct 135 ms 183076 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 354 ms 178224 KB Output is correct
2 Correct 134 ms 184204 KB Output is correct
3 Correct 142 ms 183516 KB Output is correct
4 Correct 384 ms 183728 KB Output is correct
5 Correct 91 ms 177388 KB Output is correct
6 Correct 141 ms 183516 KB Output is correct
7 Correct 122 ms 183116 KB Output is correct
8 Correct 122 ms 183072 KB Output is correct
9 Correct 121 ms 182952 KB Output is correct
10 Correct 186 ms 183416 KB Output is correct
11 Correct 134 ms 183088 KB Output is correct
12 Correct 135 ms 183076 KB Output is correct
13 Correct 359 ms 178364 KB Output is correct
14 Correct 131 ms 184088 KB Output is correct
15 Correct 148 ms 183536 KB Output is correct
16 Correct 390 ms 183796 KB Output is correct
17 Correct 91 ms 177360 KB Output is correct
18 Correct 137 ms 183540 KB Output is correct
19 Correct 125 ms 183116 KB Output is correct
20 Correct 147 ms 183116 KB Output is correct
21 Correct 122 ms 182868 KB Output is correct
22 Correct 192 ms 183408 KB Output is correct
23 Correct 131 ms 183072 KB Output is correct
24 Correct 133 ms 183212 KB Output is correct
25 Correct 1234 ms 228604 KB Output is correct
26 Correct 1036 ms 232084 KB Output is correct
27 Correct 1055 ms 227124 KB Output is correct
28 Correct 849 ms 230252 KB Output is correct
29 Execution timed out 6063 ms 223316 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 354 ms 178224 KB Output is correct
2 Correct 134 ms 184204 KB Output is correct
3 Correct 142 ms 183516 KB Output is correct
4 Correct 384 ms 183728 KB Output is correct
5 Correct 91 ms 177388 KB Output is correct
6 Correct 141 ms 183516 KB Output is correct
7 Correct 122 ms 183116 KB Output is correct
8 Correct 122 ms 183072 KB Output is correct
9 Correct 121 ms 182952 KB Output is correct
10 Correct 186 ms 183416 KB Output is correct
11 Correct 134 ms 183088 KB Output is correct
12 Correct 135 ms 183076 KB Output is correct
13 Correct 359 ms 178364 KB Output is correct
14 Correct 131 ms 184088 KB Output is correct
15 Correct 148 ms 183536 KB Output is correct
16 Correct 390 ms 183796 KB Output is correct
17 Correct 91 ms 177360 KB Output is correct
18 Correct 137 ms 183540 KB Output is correct
19 Correct 125 ms 183116 KB Output is correct
20 Correct 147 ms 183116 KB Output is correct
21 Correct 122 ms 182868 KB Output is correct
22 Correct 192 ms 183408 KB Output is correct
23 Correct 131 ms 183072 KB Output is correct
24 Correct 133 ms 183212 KB Output is correct
25 Correct 1234 ms 228604 KB Output is correct
26 Correct 1036 ms 232084 KB Output is correct
27 Correct 1055 ms 227124 KB Output is correct
28 Correct 849 ms 230252 KB Output is correct
29 Execution timed out 6063 ms 223316 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 364 ms 178240 KB Output is correct
2 Correct 130 ms 184172 KB Output is correct
3 Correct 133 ms 183592 KB Output is correct
4 Correct 390 ms 183736 KB Output is correct
5 Correct 89 ms 177280 KB Output is correct
6 Correct 134 ms 183504 KB Output is correct
7 Correct 354 ms 178224 KB Output is correct
8 Correct 134 ms 184204 KB Output is correct
9 Correct 142 ms 183516 KB Output is correct
10 Correct 384 ms 183728 KB Output is correct
11 Correct 91 ms 177388 KB Output is correct
12 Correct 141 ms 183516 KB Output is correct
13 Correct 122 ms 183116 KB Output is correct
14 Correct 122 ms 183072 KB Output is correct
15 Correct 121 ms 182952 KB Output is correct
16 Correct 186 ms 183416 KB Output is correct
17 Correct 134 ms 183088 KB Output is correct
18 Correct 135 ms 183076 KB Output is correct
19 Correct 86 ms 176448 KB Output is correct
20 Correct 86 ms 176380 KB Output is correct
21 Correct 84 ms 176448 KB Output is correct
22 Correct 360 ms 178244 KB Output is correct
23 Correct 137 ms 184124 KB Output is correct
24 Correct 143 ms 183500 KB Output is correct
25 Correct 388 ms 183732 KB Output is correct
26 Correct 90 ms 177292 KB Output is correct
27 Correct 136 ms 183536 KB Output is correct
28 Correct 121 ms 183124 KB Output is correct
29 Correct 126 ms 183052 KB Output is correct
30 Correct 123 ms 182996 KB Output is correct
31 Correct 181 ms 183348 KB Output is correct
32 Correct 127 ms 183084 KB Output is correct
33 Correct 130 ms 183148 KB Output is correct
34 Correct 1123 ms 227640 KB Output is correct
35 Correct 1262 ms 223920 KB Output is correct
36 Correct 1295 ms 223912 KB Output is correct
37 Correct 978 ms 228428 KB Output is correct
38 Correct 1161 ms 225964 KB Output is correct
39 Execution timed out 6032 ms 222996 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 364 ms 178240 KB Output is correct
2 Correct 130 ms 184172 KB Output is correct
3 Correct 133 ms 183592 KB Output is correct
4 Correct 390 ms 183736 KB Output is correct
5 Correct 89 ms 177280 KB Output is correct
6 Correct 134 ms 183504 KB Output is correct
7 Correct 354 ms 178224 KB Output is correct
8 Correct 134 ms 184204 KB Output is correct
9 Correct 142 ms 183516 KB Output is correct
10 Correct 384 ms 183728 KB Output is correct
11 Correct 91 ms 177388 KB Output is correct
12 Correct 141 ms 183516 KB Output is correct
13 Correct 122 ms 183116 KB Output is correct
14 Correct 122 ms 183072 KB Output is correct
15 Correct 121 ms 182952 KB Output is correct
16 Correct 186 ms 183416 KB Output is correct
17 Correct 134 ms 183088 KB Output is correct
18 Correct 135 ms 183076 KB Output is correct
19 Correct 359 ms 178364 KB Output is correct
20 Correct 131 ms 184088 KB Output is correct
21 Correct 148 ms 183536 KB Output is correct
22 Correct 390 ms 183796 KB Output is correct
23 Correct 91 ms 177360 KB Output is correct
24 Correct 137 ms 183540 KB Output is correct
25 Correct 125 ms 183116 KB Output is correct
26 Correct 147 ms 183116 KB Output is correct
27 Correct 122 ms 182868 KB Output is correct
28 Correct 192 ms 183408 KB Output is correct
29 Correct 131 ms 183072 KB Output is correct
30 Correct 133 ms 183212 KB Output is correct
31 Correct 1234 ms 228604 KB Output is correct
32 Correct 1036 ms 232084 KB Output is correct
33 Correct 1055 ms 227124 KB Output is correct
34 Correct 849 ms 230252 KB Output is correct
35 Execution timed out 6063 ms 223316 KB Time limit exceeded
36 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 364 ms 178240 KB Output is correct
2 Correct 130 ms 184172 KB Output is correct
3 Correct 133 ms 183592 KB Output is correct
4 Correct 390 ms 183736 KB Output is correct
5 Correct 89 ms 177280 KB Output is correct
6 Correct 134 ms 183504 KB Output is correct
7 Correct 354 ms 178224 KB Output is correct
8 Correct 134 ms 184204 KB Output is correct
9 Correct 142 ms 183516 KB Output is correct
10 Correct 384 ms 183728 KB Output is correct
11 Correct 91 ms 177388 KB Output is correct
12 Correct 141 ms 183516 KB Output is correct
13 Correct 122 ms 183116 KB Output is correct
14 Correct 122 ms 183072 KB Output is correct
15 Correct 121 ms 182952 KB Output is correct
16 Correct 186 ms 183416 KB Output is correct
17 Correct 134 ms 183088 KB Output is correct
18 Correct 135 ms 183076 KB Output is correct
19 Correct 359 ms 178364 KB Output is correct
20 Correct 131 ms 184088 KB Output is correct
21 Correct 148 ms 183536 KB Output is correct
22 Correct 390 ms 183796 KB Output is correct
23 Correct 91 ms 177360 KB Output is correct
24 Correct 137 ms 183540 KB Output is correct
25 Correct 125 ms 183116 KB Output is correct
26 Correct 147 ms 183116 KB Output is correct
27 Correct 122 ms 182868 KB Output is correct
28 Correct 192 ms 183408 KB Output is correct
29 Correct 131 ms 183072 KB Output is correct
30 Correct 133 ms 183212 KB Output is correct
31 Correct 1234 ms 228604 KB Output is correct
32 Correct 1036 ms 232084 KB Output is correct
33 Correct 1055 ms 227124 KB Output is correct
34 Correct 849 ms 230252 KB Output is correct
35 Execution timed out 6063 ms 223316 KB Time limit exceeded
36 Halted 0 ms 0 KB -