oj.uz

Submission #771803

# Submission time Handle Problem Language Result Execution time Memory
771803 2023-07-03T09:36:37 Z LittleCube From Hacks to Snitches (BOI21_watchmen) C++17
15 / 100
 4059 ms 498964 KB 
#include <bits/stdc++.h>
#define ll long long
#define state tuple<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];
vector<state> pq[1000005];

bool good(int u, ll t)
{
	return l[u] == 1 || t % l[u] != r[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);
	}
	for (int i = 1; i <= N; i++)
		l[i] = 1;
	cin >> K;
	for (int i = 1; i <= K; i++)
	{
		int k;
		cin >> k;
		if (mp[k] == 0)
			mp[k] = ++L;
		v[i].resize(k);
		for (int j = 0; j < k; j++)
		{
			cin >> v[i][j];
			l[v[i][j]] = k;
			r[v[i][j]] = j;
			vis[v[i][j]].resize(k);
		}
		for (int j = 0; j < k; j++)
			nxt[v[i][j]] = v[i][(j + 1) % k];
	}
	assert(L < 128);
	for (int i = 1; i <= N; i++)
		dis[i].resize(l[i], (ll)1e18);
	dis[1][0] = 0;

	pq[0].emplace_back(state{1, 0, 0});

	auto cycle = [&](int d, int u, int b)
	{
		cnt++;
		// u -> b
		assert(cnt <= 2 * 25 * 350 * 200);
		int rem = (d + 1) % l[b];
		if (vis[b][rem][mp[l[u]]])
			return;
		if (goodmove(u, b, d + 1))
			if (dis[b][rem] > d + 1)
			{
				dis[b][rem] = d + 1;
				pq[d + 1].emplace_back(state{b, rem, 0});
			}

		vis[b][rem][mp[l[u]]] = 1;

		if (d + l[u] <= 4 * N)
			pq[d + l[u]].emplace_back(state{u, 0, b});
	};

	auto normal = [&](int d, int u, int k)
	{
		for (auto v : E[u])
			if (l[v] == 1 && d + 1 < dis[v][0])
			{
				dis[v][0] = d + 1;
				pq[d + 1].emplace_back(state{v, 0, 0});
			}
			else if (l[v] > 1)
			{
				if (!goodmove(u, v, d + 1) && l[u] % l[v] == 0)
					continue;
				cycle(d, u, v);
			}

		int rem = (d + 1) % l[u];
		if (good(u, d + 1) && dis[u][rem] > d + 1)
		{
			dis[u][rem] = d + 1;
			pq[d + 1].emplace_back(state{u, rem, 0});
		}
	};

	for (int d = 0; d <= 4 * N; d++)
		for (auto [u, k, b] : pq[d])
		{
			if (!b && d > dis[u][k])
				continue;
			if (!b)
				normal(d, u, k);
			else
				cycle(d, u, 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
	{
		assert(dis[N][0] <= N * 5);
		cout << dis[N][0] << '\n';
	}
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 137 ms 201736 KB Output is correct
2 Correct 141 ms 211080 KB Output is correct
3 Correct 198 ms 209968 KB Output is correct
4 Correct 172 ms 209672 KB Output is correct
5 Correct 88 ms 200632 KB Output is correct
6 Correct 144 ms 209640 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 136 ms 201804 KB Output is correct
2 Correct 164 ms 211040 KB Output is correct
3 Correct 140 ms 209924 KB Output is correct
4 Correct 162 ms 209740 KB Output is correct
5 Correct 83 ms 200680 KB Output is correct
6 Correct 129 ms 209720 KB Output is correct
7 Correct 166 ms 209312 KB Output is correct
8 Correct 148 ms 209476 KB Output is correct
9 Correct 151 ms 209448 KB Output is correct
10 Correct 149 ms 208784 KB Output is correct
11 Correct 140 ms 208016 KB Output is correct
12 Correct 159 ms 209220 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 136 ms 201804 KB Output is correct
2 Correct 164 ms 211040 KB Output is correct
3 Correct 140 ms 209924 KB Output is correct
4 Correct 162 ms 209740 KB Output is correct
5 Correct 83 ms 200680 KB Output is correct
6 Correct 129 ms 209720 KB Output is correct
7 Correct 166 ms 209312 KB Output is correct
8 Correct 148 ms 209476 KB Output is correct
9 Correct 151 ms 209448 KB Output is correct
10 Correct 149 ms 208784 KB Output is correct
11 Correct 140 ms 208016 KB Output is correct
12 Correct 159 ms 209220 KB Output is correct
13 Correct 143 ms 201728 KB Output is correct
14 Correct 161 ms 211052 KB Output is correct
15 Correct 144 ms 209912 KB Output is correct
16 Correct 182 ms 209732 KB Output is correct
17 Correct 93 ms 200748 KB Output is correct
18 Correct 133 ms 209624 KB Output is correct
19 Correct 129 ms 209312 KB Output is correct
20 Correct 130 ms 209524 KB Output is correct
21 Correct 163 ms 209444 KB Output is correct
22 Correct 142 ms 208748 KB Output is correct
23 Correct 131 ms 207952 KB Output is correct
24 Correct 141 ms 209132 KB Output is correct
25 Correct 1268 ms 257668 KB Output is correct
26 Correct 1217 ms 263972 KB Output is correct
27 Correct 1109 ms 259456 KB Output is correct
28 Correct 887 ms 262076 KB Output is correct
29 Runtime error 2472 ms 498964 KB Execution killed with signal 6
30 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 136 ms 201804 KB Output is correct
2 Correct 164 ms 211040 KB Output is correct
3 Correct 140 ms 209924 KB Output is correct
4 Correct 162 ms 209740 KB Output is correct
5 Correct 83 ms 200680 KB Output is correct
6 Correct 129 ms 209720 KB Output is correct
7 Correct 166 ms 209312 KB Output is correct
8 Correct 148 ms 209476 KB Output is correct
9 Correct 151 ms 209448 KB Output is correct
10 Correct 149 ms 208784 KB Output is correct
11 Correct 140 ms 208016 KB Output is correct
12 Correct 159 ms 209220 KB Output is correct
13 Correct 143 ms 201728 KB Output is correct
14 Correct 161 ms 211052 KB Output is correct
15 Correct 144 ms 209912 KB Output is correct
16 Correct 182 ms 209732 KB Output is correct
17 Correct 93 ms 200748 KB Output is correct
18 Correct 133 ms 209624 KB Output is correct
19 Correct 129 ms 209312 KB Output is correct
20 Correct 130 ms 209524 KB Output is correct
21 Correct 163 ms 209444 KB Output is correct
22 Correct 142 ms 208748 KB Output is correct
23 Correct 131 ms 207952 KB Output is correct
24 Correct 141 ms 209132 KB Output is correct
25 Correct 1268 ms 257668 KB Output is correct
26 Correct 1217 ms 263972 KB Output is correct
27 Correct 1109 ms 259456 KB Output is correct
28 Correct 887 ms 262076 KB Output is correct
29 Runtime error 2472 ms 498964 KB Execution killed with signal 6
30 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 137 ms 201736 KB Output is correct
2 Correct 141 ms 211080 KB Output is correct
3 Correct 198 ms 209968 KB Output is correct
4 Correct 172 ms 209672 KB Output is correct
5 Correct 88 ms 200632 KB Output is correct
6 Correct 144 ms 209640 KB Output is correct
7 Correct 136 ms 201804 KB Output is correct
8 Correct 164 ms 211040 KB Output is correct
9 Correct 140 ms 209924 KB Output is correct
10 Correct 162 ms 209740 KB Output is correct
11 Correct 83 ms 200680 KB Output is correct
12 Correct 129 ms 209720 KB Output is correct
13 Correct 166 ms 209312 KB Output is correct
14 Correct 148 ms 209476 KB Output is correct
15 Correct 151 ms 209448 KB Output is correct
16 Correct 149 ms 208784 KB Output is correct
17 Correct 140 ms 208016 KB Output is correct
18 Correct 159 ms 209220 KB Output is correct
19 Correct 92 ms 199988 KB Output is correct
20 Correct 88 ms 199940 KB Output is correct
21 Correct 95 ms 199984 KB Output is correct
22 Correct 150 ms 201700 KB Output is correct
23 Correct 190 ms 211116 KB Output is correct
24 Correct 159 ms 209880 KB Output is correct
25 Correct 170 ms 209716 KB Output is correct
26 Correct 99 ms 200656 KB Output is correct
27 Correct 132 ms 209708 KB Output is correct
28 Correct 142 ms 209436 KB Output is correct
29 Correct 167 ms 209516 KB Output is correct
30 Correct 128 ms 209328 KB Output is correct
31 Correct 167 ms 208744 KB Output is correct
32 Correct 124 ms 207972 KB Output is correct
33 Correct 167 ms 209284 KB Output is correct
34 Correct 1169 ms 254104 KB Output is correct
35 Correct 1205 ms 248824 KB Output is correct
36 Correct 1244 ms 251188 KB Output is correct
37 Correct 984 ms 256772 KB Output is correct
38 Correct 1069 ms 255568 KB Output is correct
39 Runtime error 4059 ms 498688 KB Execution killed with signal 6
40 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 137 ms 201736 KB Output is correct
2 Correct 141 ms 211080 KB Output is correct
3 Correct 198 ms 209968 KB Output is correct
4 Correct 172 ms 209672 KB Output is correct
5 Correct 88 ms 200632 KB Output is correct
6 Correct 144 ms 209640 KB Output is correct
7 Correct 136 ms 201804 KB Output is correct
8 Correct 164 ms 211040 KB Output is correct
9 Correct 140 ms 209924 KB Output is correct
10 Correct 162 ms 209740 KB Output is correct
11 Correct 83 ms 200680 KB Output is correct
12 Correct 129 ms 209720 KB Output is correct
13 Correct 166 ms 209312 KB Output is correct
14 Correct 148 ms 209476 KB Output is correct
15 Correct 151 ms 209448 KB Output is correct
16 Correct 149 ms 208784 KB Output is correct
17 Correct 140 ms 208016 KB Output is correct
18 Correct 159 ms 209220 KB Output is correct
19 Correct 143 ms 201728 KB Output is correct
20 Correct 161 ms 211052 KB Output is correct
21 Correct 144 ms 209912 KB Output is correct
22 Correct 182 ms 209732 KB Output is correct
23 Correct 93 ms 200748 KB Output is correct
24 Correct 133 ms 209624 KB Output is correct
25 Correct 129 ms 209312 KB Output is correct
26 Correct 130 ms 209524 KB Output is correct
27 Correct 163 ms 209444 KB Output is correct
28 Correct 142 ms 208748 KB Output is correct
29 Correct 131 ms 207952 KB Output is correct
30 Correct 141 ms 209132 KB Output is correct
31 Correct 1268 ms 257668 KB Output is correct
32 Correct 1217 ms 263972 KB Output is correct
33 Correct 1109 ms 259456 KB Output is correct
34 Correct 887 ms 262076 KB Output is correct
35 Runtime error 2472 ms 498964 KB Execution killed with signal 6
36 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 137 ms 201736 KB Output is correct
2 Correct 141 ms 211080 KB Output is correct
3 Correct 198 ms 209968 KB Output is correct
4 Correct 172 ms 209672 KB Output is correct
5 Correct 88 ms 200632 KB Output is correct
6 Correct 144 ms 209640 KB Output is correct
7 Correct 136 ms 201804 KB Output is correct
8 Correct 164 ms 211040 KB Output is correct
9 Correct 140 ms 209924 KB Output is correct
10 Correct 162 ms 209740 KB Output is correct
11 Correct 83 ms 200680 KB Output is correct
12 Correct 129 ms 209720 KB Output is correct
13 Correct 166 ms 209312 KB Output is correct
14 Correct 148 ms 209476 KB Output is correct
15 Correct 151 ms 209448 KB Output is correct
16 Correct 149 ms 208784 KB Output is correct
17 Correct 140 ms 208016 KB Output is correct
18 Correct 159 ms 209220 KB Output is correct
19 Correct 143 ms 201728 KB Output is correct
20 Correct 161 ms 211052 KB Output is correct
21 Correct 144 ms 209912 KB Output is correct
22 Correct 182 ms 209732 KB Output is correct
23 Correct 93 ms 200748 KB Output is correct
24 Correct 133 ms 209624 KB Output is correct
25 Correct 129 ms 209312 KB Output is correct
26 Correct 130 ms 209524 KB Output is correct
27 Correct 163 ms 209444 KB Output is correct
28 Correct 142 ms 208748 KB Output is correct
29 Correct 131 ms 207952 KB Output is correct
30 Correct 141 ms 209132 KB Output is correct
31 Correct 1268 ms 257668 KB Output is correct
32 Correct 1217 ms 263972 KB Output is correct
33 Correct 1109 ms 259456 KB Output is correct
34 Correct 887 ms 262076 KB Output is correct
35 Runtime error 2472 ms 498964 KB Execution killed with signal 6
36 Halted 0 ms 0 KB -