oj.uz

답안 #817646

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
817646 2023-08-09T14:25:22 Z MohamedAhmed04 From Hacks to Snitches (BOI21_watchmen) C++14
35 / 100
 1188 ms 106712 KB 
#include <bits/stdc++.h>

using namespace std ;

const int inf = 1e9 ;
const int MAX = 3e5 + 10 ;

int arr[MAX] ;
int n , m , k ;

vector< vector<int> >adj(MAX) ;

vector<int>v[MAX] ;
int watch[MAX] , cycle_sz[MAX] , id[MAX] ;

int dist[MAX][2] ;

bool check(int node , int child , int tim)
{
	assert(watch[child] != 0) ;
	int x = watch[node] ;
	int tim_node = 2e9 ;
	if(watch[node])
	{
		int cur = tim % cycle_sz[x] ;
		tim_node = tim + (id[node] - cur + cycle_sz[x]) % cycle_sz[x] ;
	}
	int tim_child = -2e9 ;
	x = watch[child] ;
	int cur = tim % cycle_sz[x] ;
	tim_child = tim + (id[child] - cur + cycle_sz[x]) % cycle_sz[x] ;
	return (tim_child < tim_node-1 || (tim_child == tim_node - 1 && watch[child] != watch[node])) ;
}

void solve(int src)
{
	for(int i = 1 ; i <= n ; ++i)
		dist[i][0] = dist[i][1] = inf ;
	priority_queue< array<int , 3> , vector< array<int , 3> > , greater< array<int , 3> > >q ;
	dist[src][0] = 0 ;
	q.push({0 , src , 0}) ;
	while(!q.empty())
	{
		array<int , 3>a = q.top() ;
		q.pop() ;
		int node = a[1] , cost = a[0] , t = a[2] ;
		if(dist[node][t] < cost)
			continue ;
		for(auto &child : adj[node])
		{
			int child2 = child ;
			int cost2 = cost + 1 ;
			if((!watch[child2]))
			{
				if(cost2 < dist[child2][0])
				{
					dist[child2][0] = cost2 ;
					q.push({cost2 , child2 , 0}) ;
				}
				continue ;
			}
			int x = watch[child2] ;
			if((!t) && check(node , child2 , cost)) //handle waiting for some time
			{
				int cur = cost % cycle_sz[x] ;
				cost2 = cost + (id[child2] - cur + cycle_sz[x]) % cycle_sz[x] + 1 ; 
				if(cost2 < dist[child2][1])
				{
					dist[child2][1] = cost2 ;
					q.push({cost2 , child2 , 1}) ;
				}
			}
			cost2 = cost + 1 ;
			//handle corridor 
			if(v[x][(cost2 - 1) % cycle_sz[x]] == child2 && v[x][cost2 % cycle_sz[x]] == node)
				continue ;
			if(v[x][cost2 % cycle_sz[x]] != child2) //go without waiting
			{
				if(cost2 < dist[child2][t])
				{
					dist[child2][t] = cost2 ;
					q.push({cost2 , child2 , t}) ;
				}
			}
			// else if(watch[node] && v[watch[node]][cost2 % cycle_sz[watch[node]]] != node) //wait extra minute
			// {
			// 	cost2 = cost + 2 ;
			// 	if(cost2 < dist[child2][1])
			// 	{
			// 		dist[child2][1] = cost2 ;
			// 		q.push({cost2 , child2 , 1}) ;
			// 	}
			// }
		}
	}
}

int main()
{
	ios_base::sync_with_stdio(0) ;
	cin.tie(0) ;
	cin>>n>>m ;
	for(int i = 0 ; i < m ; ++i)
	{
		int x , y ;
		cin>>x>>y ;
		adj[x].push_back(y) ;
		adj[y].push_back(x) ;
	}
	cin>>k ;
	for(int i = 1 ; i <= k ; ++i)
	{
		cin>>cycle_sz[i] ;
		v[i].resize(cycle_sz[i]) ;
		for(int j = 0 ; j < cycle_sz[i] ; ++j)
		{
			cin>>v[i][j] ;
			watch[v[i][j]] = i ;
			id[v[i][j]] = j ;
		}
	}
	solve(1) ;
	if(dist[n][0] == inf)
		cout<<"impossible\n" ;
	else
		cout<<dist[n][0]<<"\n" ;
	return 0 ;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 15956 KB Output is correct
2 Correct 49 ms 19944 KB Output is correct
3 Correct 38 ms 19792 KB Output is correct
4 Correct 41 ms 19920 KB Output is correct
5 Correct 7 ms 14420 KB Output is correct
6 Correct 40 ms 19768 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 15956 KB Output is correct
2 Correct 38 ms 20012 KB Output is correct
3 Correct 57 ms 19836 KB Output is correct
4 Correct 42 ms 19952 KB Output is correct
5 Correct 7 ms 14464 KB Output is correct
6 Correct 41 ms 19744 KB Output is correct
7 Correct 40 ms 19812 KB Output is correct
8 Correct 40 ms 19768 KB Output is correct
9 Correct 42 ms 19760 KB Output is correct
10 Correct 59 ms 20088 KB Output is correct
11 Correct 43 ms 19796 KB Output is correct
12 Correct 41 ms 19760 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 15956 KB Output is correct
2 Correct 38 ms 20012 KB Output is correct
3 Correct 57 ms 19836 KB Output is correct
4 Correct 42 ms 19952 KB Output is correct
5 Correct 7 ms 14464 KB Output is correct
6 Correct 41 ms 19744 KB Output is correct
7 Correct 40 ms 19812 KB Output is correct
8 Correct 40 ms 19768 KB Output is correct
9 Correct 42 ms 19760 KB Output is correct
10 Correct 59 ms 20088 KB Output is correct
11 Correct 43 ms 19796 KB Output is correct
12 Correct 41 ms 19760 KB Output is correct
13 Correct 19 ms 15956 KB Output is correct
14 Correct 38 ms 20004 KB Output is correct
15 Correct 45 ms 19816 KB Output is correct
16 Correct 40 ms 19868 KB Output is correct
17 Correct 7 ms 14440 KB Output is correct
18 Correct 41 ms 19716 KB Output is correct
19 Correct 47 ms 19872 KB Output is correct
20 Correct 37 ms 19828 KB Output is correct
21 Correct 40 ms 19760 KB Output is correct
22 Correct 41 ms 20052 KB Output is correct
23 Correct 41 ms 19812 KB Output is correct
24 Correct 39 ms 19716 KB Output is correct
25 Correct 987 ms 99688 KB Output is correct
26 Correct 1046 ms 106200 KB Output is correct
27 Correct 885 ms 99564 KB Output is correct
28 Correct 730 ms 104452 KB Output is correct
29 Correct 1057 ms 93652 KB Output is correct
30 Correct 991 ms 96808 KB Output is correct
31 Correct 1052 ms 106632 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 15956 KB Output is correct
2 Correct 38 ms 20012 KB Output is correct
3 Correct 57 ms 19836 KB Output is correct
4 Correct 42 ms 19952 KB Output is correct
5 Correct 7 ms 14464 KB Output is correct
6 Correct 41 ms 19744 KB Output is correct
7 Correct 40 ms 19812 KB Output is correct
8 Correct 40 ms 19768 KB Output is correct
9 Correct 42 ms 19760 KB Output is correct
10 Correct 59 ms 20088 KB Output is correct
11 Correct 43 ms 19796 KB Output is correct
12 Correct 41 ms 19760 KB Output is correct
13 Correct 19 ms 15956 KB Output is correct
14 Correct 38 ms 20004 KB Output is correct
15 Correct 45 ms 19816 KB Output is correct
16 Correct 40 ms 19868 KB Output is correct
17 Correct 7 ms 14440 KB Output is correct
18 Correct 41 ms 19716 KB Output is correct
19 Correct 47 ms 19872 KB Output is correct
20 Correct 37 ms 19828 KB Output is correct
21 Correct 40 ms 19760 KB Output is correct
22 Correct 41 ms 20052 KB Output is correct
23 Correct 41 ms 19812 KB Output is correct
24 Correct 39 ms 19716 KB Output is correct
25 Correct 987 ms 99688 KB Output is correct
26 Correct 1046 ms 106200 KB Output is correct
27 Correct 885 ms 99564 KB Output is correct
28 Correct 730 ms 104452 KB Output is correct
29 Correct 1057 ms 93652 KB Output is correct
30 Correct 991 ms 96808 KB Output is correct
31 Correct 1052 ms 106632 KB Output is correct
32 Correct 18 ms 15984 KB Output is correct
33 Correct 43 ms 19992 KB Output is correct
34 Correct 39 ms 19744 KB Output is correct
35 Correct 41 ms 19912 KB Output is correct
36 Correct 8 ms 14432 KB Output is correct
37 Correct 44 ms 19900 KB Output is correct
38 Correct 40 ms 19788 KB Output is correct
39 Correct 38 ms 19788 KB Output is correct
40 Correct 36 ms 19796 KB Output is correct
41 Correct 41 ms 19940 KB Output is correct
42 Correct 48 ms 19804 KB Output is correct
43 Correct 38 ms 19712 KB Output is correct
44 Correct 1113 ms 99688 KB Output is correct
45 Correct 911 ms 106184 KB Output is correct
46 Correct 827 ms 99552 KB Output is correct
47 Correct 788 ms 104340 KB Output is correct
48 Correct 1066 ms 93720 KB Output is correct
49 Correct 1070 ms 96828 KB Output is correct
50 Correct 1130 ms 106580 KB Output is correct
51 Correct 981 ms 100512 KB Output is correct
52 Correct 956 ms 106712 KB Output is correct
53 Correct 887 ms 98720 KB Output is correct
54 Correct 733 ms 92472 KB Output is correct
55 Correct 1065 ms 98724 KB Output is correct
56 Correct 1025 ms 92412 KB Output is correct

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 15956 KB Output is correct
2 Correct 49 ms 19944 KB Output is correct
3 Correct 38 ms 19792 KB Output is correct
4 Correct 41 ms 19920 KB Output is correct
5 Correct 7 ms 14420 KB Output is correct
6 Correct 40 ms 19768 KB Output is correct
7 Correct 18 ms 15956 KB Output is correct
8 Correct 38 ms 20012 KB Output is correct
9 Correct 57 ms 19836 KB Output is correct
10 Correct 42 ms 19952 KB Output is correct
11 Correct 7 ms 14464 KB Output is correct
12 Correct 41 ms 19744 KB Output is correct
13 Correct 40 ms 19812 KB Output is correct
14 Correct 40 ms 19768 KB Output is correct
15 Correct 42 ms 19760 KB Output is correct
16 Correct 59 ms 20088 KB Output is correct
17 Correct 43 ms 19796 KB Output is correct
18 Correct 41 ms 19760 KB Output is correct
19 Correct 8 ms 14436 KB Output is correct
20 Correct 8 ms 14420 KB Output is correct
21 Correct 7 ms 14436 KB Output is correct
22 Correct 19 ms 15984 KB Output is correct
23 Correct 38 ms 20016 KB Output is correct
24 Correct 38 ms 19804 KB Output is correct
25 Correct 46 ms 19900 KB Output is correct
26 Correct 7 ms 14420 KB Output is correct
27 Correct 40 ms 19808 KB Output is correct
28 Correct 37 ms 19816 KB Output is correct
29 Correct 38 ms 19828 KB Output is correct
30 Correct 36 ms 19792 KB Output is correct
31 Correct 39 ms 19952 KB Output is correct
32 Correct 38 ms 19796 KB Output is correct
33 Correct 48 ms 19736 KB Output is correct
34 Correct 1074 ms 100832 KB Output is correct
35 Correct 1107 ms 96908 KB Output is correct
36 Correct 1188 ms 96316 KB Output is correct
37 Incorrect 891 ms 102300 KB Output isn't correct
38 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 15956 KB Output is correct
2 Correct 49 ms 19944 KB Output is correct
3 Correct 38 ms 19792 KB Output is correct
4 Correct 41 ms 19920 KB Output is correct
5 Correct 7 ms 14420 KB Output is correct
6 Correct 40 ms 19768 KB Output is correct
7 Correct 18 ms 15956 KB Output is correct
8 Correct 38 ms 20012 KB Output is correct
9 Correct 57 ms 19836 KB Output is correct
10 Correct 42 ms 19952 KB Output is correct
11 Correct 7 ms 14464 KB Output is correct
12 Correct 41 ms 19744 KB Output is correct
13 Correct 40 ms 19812 KB Output is correct
14 Correct 40 ms 19768 KB Output is correct
15 Correct 42 ms 19760 KB Output is correct
16 Correct 59 ms 20088 KB Output is correct
17 Correct 43 ms 19796 KB Output is correct
18 Correct 41 ms 19760 KB Output is correct
19 Correct 19 ms 15956 KB Output is correct
20 Correct 38 ms 20004 KB Output is correct
21 Correct 45 ms 19816 KB Output is correct
22 Correct 40 ms 19868 KB Output is correct
23 Correct 7 ms 14440 KB Output is correct
24 Correct 41 ms 19716 KB Output is correct
25 Correct 47 ms 19872 KB Output is correct
26 Correct 37 ms 19828 KB Output is correct
27 Correct 40 ms 19760 KB Output is correct
28 Correct 41 ms 20052 KB Output is correct
29 Correct 41 ms 19812 KB Output is correct
30 Correct 39 ms 19716 KB Output is correct
31 Correct 987 ms 99688 KB Output is correct
32 Correct 1046 ms 106200 KB Output is correct
33 Correct 885 ms 99564 KB Output is correct
34 Correct 730 ms 104452 KB Output is correct
35 Correct 1057 ms 93652 KB Output is correct
36 Correct 991 ms 96808 KB Output is correct
37 Correct 1052 ms 106632 KB Output is correct
38 Correct 8 ms 14436 KB Output is correct
39 Correct 8 ms 14420 KB Output is correct
40 Correct 7 ms 14436 KB Output is correct
41 Correct 19 ms 15984 KB Output is correct
42 Correct 38 ms 20016 KB Output is correct
43 Correct 38 ms 19804 KB Output is correct
44 Correct 46 ms 19900 KB Output is correct
45 Correct 7 ms 14420 KB Output is correct
46 Correct 40 ms 19808 KB Output is correct
47 Correct 37 ms 19816 KB Output is correct
48 Correct 38 ms 19828 KB Output is correct
49 Correct 36 ms 19792 KB Output is correct
50 Correct 39 ms 19952 KB Output is correct
51 Correct 38 ms 19796 KB Output is correct
52 Correct 48 ms 19736 KB Output is correct
53 Correct 1074 ms 100832 KB Output is correct
54 Correct 1107 ms 96908 KB Output is correct
55 Correct 1188 ms 96316 KB Output is correct
56 Incorrect 891 ms 102300 KB Output isn't correct
57 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 15956 KB Output is correct
2 Correct 49 ms 19944 KB Output is correct
3 Correct 38 ms 19792 KB Output is correct
4 Correct 41 ms 19920 KB Output is correct
5 Correct 7 ms 14420 KB Output is correct
6 Correct 40 ms 19768 KB Output is correct
7 Correct 18 ms 15956 KB Output is correct
8 Correct 38 ms 20012 KB Output is correct
9 Correct 57 ms 19836 KB Output is correct
10 Correct 42 ms 19952 KB Output is correct
11 Correct 7 ms 14464 KB Output is correct
12 Correct 41 ms 19744 KB Output is correct
13 Correct 40 ms 19812 KB Output is correct
14 Correct 40 ms 19768 KB Output is correct
15 Correct 42 ms 19760 KB Output is correct
16 Correct 59 ms 20088 KB Output is correct
17 Correct 43 ms 19796 KB Output is correct
18 Correct 41 ms 19760 KB Output is correct
19 Correct 19 ms 15956 KB Output is correct
20 Correct 38 ms 20004 KB Output is correct
21 Correct 45 ms 19816 KB Output is correct
22 Correct 40 ms 19868 KB Output is correct
23 Correct 7 ms 14440 KB Output is correct
24 Correct 41 ms 19716 KB Output is correct
25 Correct 47 ms 19872 KB Output is correct
26 Correct 37 ms 19828 KB Output is correct
27 Correct 40 ms 19760 KB Output is correct
28 Correct 41 ms 20052 KB Output is correct
29 Correct 41 ms 19812 KB Output is correct
30 Correct 39 ms 19716 KB Output is correct
31 Correct 987 ms 99688 KB Output is correct
32 Correct 1046 ms 106200 KB Output is correct
33 Correct 885 ms 99564 KB Output is correct
34 Correct 730 ms 104452 KB Output is correct
35 Correct 1057 ms 93652 KB Output is correct
36 Correct 991 ms 96808 KB Output is correct
37 Correct 1052 ms 106632 KB Output is correct
38 Correct 18 ms 15984 KB Output is correct
39 Correct 43 ms 19992 KB Output is correct
40 Correct 39 ms 19744 KB Output is correct
41 Correct 41 ms 19912 KB Output is correct
42 Correct 8 ms 14432 KB Output is correct
43 Correct 44 ms 19900 KB Output is correct
44 Correct 40 ms 19788 KB Output is correct
45 Correct 38 ms 19788 KB Output is correct
46 Correct 36 ms 19796 KB Output is correct
47 Correct 41 ms 19940 KB Output is correct
48 Correct 48 ms 19804 KB Output is correct
49 Correct 38 ms 19712 KB Output is correct
50 Correct 1113 ms 99688 KB Output is correct
51 Correct 911 ms 106184 KB Output is correct
52 Correct 827 ms 99552 KB Output is correct
53 Correct 788 ms 104340 KB Output is correct
54 Correct 1066 ms 93720 KB Output is correct
55 Correct 1070 ms 96828 KB Output is correct
56 Correct 1130 ms 106580 KB Output is correct
57 Correct 981 ms 100512 KB Output is correct
58 Correct 956 ms 106712 KB Output is correct
59 Correct 887 ms 98720 KB Output is correct
60 Correct 733 ms 92472 KB Output is correct
61 Correct 1065 ms 98724 KB Output is correct
62 Correct 1025 ms 92412 KB Output is correct
63 Correct 8 ms 14436 KB Output is correct
64 Correct 8 ms 14420 KB Output is correct
65 Correct 7 ms 14436 KB Output is correct
66 Correct 19 ms 15984 KB Output is correct
67 Correct 38 ms 20016 KB Output is correct
68 Correct 38 ms 19804 KB Output is correct
69 Correct 46 ms 19900 KB Output is correct
70 Correct 7 ms 14420 KB Output is correct
71 Correct 40 ms 19808 KB Output is correct
72 Correct 37 ms 19816 KB Output is correct
73 Correct 38 ms 19828 KB Output is correct
74 Correct 36 ms 19792 KB Output is correct
75 Correct 39 ms 19952 KB Output is correct
76 Correct 38 ms 19796 KB Output is correct
77 Correct 48 ms 19736 KB Output is correct
78 Correct 1074 ms 100832 KB Output is correct
79 Correct 1107 ms 96908 KB Output is correct
80 Correct 1188 ms 96316 KB Output is correct
81 Incorrect 891 ms 102300 KB Output isn't correct
82 Halted 0 ms 0 KB -