oj.uz

Submission #989843

# Submission time Handle Problem Language Result Execution time Memory
989843 2024-05-28T20:52:01 Z Cyber_Wolf Board Game (JOI24_boardgame) C++17
49 / 100
 1248 ms 244844 KB 
#include <bits/stdc++.h>

using namespace std;

#define lg long long
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);

const int N = 5e4+5, M = 305;

vector<int> adj[N];
int loc[N], stop[N], stops = 0;
long long dist[N][M], dist2[N][M], sto[M], doub[N], sing[N], ans2[N], dist3[N][2], gh[N], inc[N];
bitset<M> vis[N], visd;

int main()
{
	fastio;
	int n, m, k;
	cin >> n >> m >> k;
	for(int i = 0; i < m; i++)
	{
		int u, v;
		cin >> u >> v;
		adj[u].push_back(v);
		adj[v].push_back(u);
	}
	string s;
	cin >> s;
	vector<int> st;
	for(int i = 1; i <= n; i++)
	{
		stop[i] = (s[i-1] == '1');
		stops += stop[i];
		if(stop[i])	st.push_back(i);
	}
	for(int i = 0; i < k; i++)
	{
		cin >> loc[i];
	}
	if(!stops)
	{
		memset(ans2, 0x3f, sizeof(ans2));
		queue<int>q;
		visd = 0;
		visd[loc[0]] = 1;
		ans2[loc[0]] = 0;
		q.push(loc[0]);
		while(q.size())
		{
			int u = q.front();
			q.pop();
			if(stop[u] && u != loc[0])	continue;
			for(auto it : adj[u])
			{
				if(ans2[it] > ans2[u]+1)
				{
					ans2[it] = ans2[u]+1;
					q.push(it);
				}
			}
		}
		for(int i = 1; i <= n; i++)	cout << ans2[i] << '\n';
		return 0;
	}
	if(n/k < M-5)
	{
		memset(dist, 0x3f, sizeof(dist));
		memset(dist2, 0x3f, sizeof(dist2));
		stops = min(stops, M-5);
		queue<int> q[stops+3];
		q[0].push(loc[0]);
		dist[loc[0]][0] = 0;
		vis[loc[0]][0] = true;
		for(int i = 0; i <= stops+2; i++)
		{
			int its = 0;
			while(q[i].size())
			{
				int u = q[i].front();
				q[i].pop();
				vis[u][i] = false;
				int newOg = i;
				if(stop[u] && (its || i))
				{
					newOg++;
				}
				if(newOg > stops+2)	continue;
				for(auto it : adj[u])
				{
					if(dist[it][newOg] > dist[u][i]+1)
					{
						if(!vis[it][newOg])	q[newOg].push(it);
						vis[it][newOg] = true;
						dist[it][newOg] = dist[u][i]+1;	
					}
				}
				its++;
			}
		}
		for(int i = 1; i <= n; i++)	vis[i] = 0, dist2[i][0] = 0;
		for(auto it : st)	q[0].push(it), vis[it][0] = true;
		for(int i = 0; i <= stops+2; i++)
		{
			while(q[i].size())
			{
				int u = q[i].front();
				q[i].pop();
				vis[u][i] = false;
				int newOg = i;
				if(stop[u])
				{
					newOg++;
				}
				if(newOg > stops+2)	continue;
				for(auto it : adj[u])
				{
					if(dist2[it][newOg] > dist2[u][i]+1)
					{
						if(!vis[it][newOg])	q[newOg].push(it);
						vis[it][newOg] = true;
						dist2[it][newOg] = dist2[u][i]+1;	
					}
				}
			}
		}
		for(int i = 1; i < k; i++)
		{
			for(int j = 0; j <= stops+2; j++)
			{
				if(dist2[loc[i]][j] > 1e18)
				{
					sto[j] = -1;
					break;
				}
				sto[j] += dist2[loc[i]][j];
			}
		}
		for(int i = 1; i <= n; i++)
		{
			long long ans = dist[i][0];
			for(int j = 1; j <= stops+2; j++)
			{
				if(sto[j] == -1)	continue;
				ans = min(ans, dist[i][j]+sto[j]);
			}
			cout << ans << '\n';
		}
		return 0;
	}
	memset(sing, 0x3f, sizeof(sing));
	memset(doub, 0x3f, sizeof(doub));
	queue<int> q;
	for(auto it : st)
	{
		q.push(it);
		sing[it] = 0;
	}
	while(q.size())
	{
		int u = q.front();
		q.pop();
		for(auto it : adj[u])
		{
			if(sing[it] > sing[u]+1)
			{
				sing[it] = sing[u]+1;
				q.push(it);
			}
		}
	}
	for(int i = 1; i <= n; i++)
	{
		sing[i] = 2*(!sing[i])+sing[i];
	}
	for(int i = 1; i < k; i++)	gh[0] += sing[loc[i]];
	deque<int> dq;
	for(auto it : st)
	{
		for(auto it2 : adj[it])
		{
			if(stop[it2])
			{
				dq.push_back(it);
				doub[it] = 0;
				break;
			}
		}
	}
	while(dq.size())
	{
		int u = dq.front();
		dq.pop_front();
		for(auto it : adj[u])
		{
			if(doub[it] > doub[u]+(!stop[u]))
			{
				doub[it] = doub[u]+(!stop[u]);
				if(stop[u])	dq.push_front(it);
				else	dq.push_back(it);	
			}
		}
	}
	bool bad = false;
	for(int i = 1; i < k; i++)
	{
		if(doub[loc[i]] >= 1e18)
		{
			bad = true;
			break;
		}
		inc[i] = doub[loc[i]]-sing[loc[i]];
	}
	if(!bad)
	{
		sort(inc+1, inc+k);
		for(int i = 1; i < k; i++)
		{
			gh[i] = gh[i-1]+inc[i];
		}	
	}
	memset(ans2, 0x3f, sizeof(ans2));
	visd = 0;
	visd[loc[0]] = 1;
	ans2[loc[0]] = 0;
	q.push(loc[0]);
	while(q.size())
	{
		int u = q.front();
		q.pop();
		if(stop[u] && u != loc[0])	continue;
		for(auto it : adj[u])
		{
			if(ans2[it] > ans2[u]+1)
			{
				ans2[it] = ans2[u]+1;
				q.push(it);
			}
		}
	}
	for(int its = 0; its < k; its++)
	{
		if(bad && its)	break;
		memset(dist3, 0x3f, sizeof(dist3));
		dist3[loc[0]][0] = 0;
		vis[loc[0]][0] = true;
		priority_queue<array<lg, 3>> pq;
		pq.push({0, loc[0], 0});
		while(pq.size())
		{
			int u = pq.top()[1];
			int ty = pq.top()[2];
			vis[u][ty] = 0;
			int stopp = (u != loc[0] && stop[u]);
			int newty = (ty||stopp);
			pq.pop();
			for(auto it : adj[u])
			{
				if(dist3[it][newty] > dist3[u][ty]+(stopp ? 2*(k-1-its)+its+1 : 1))
				{
					dist3[it][newty] = dist3[u][ty]+(stopp ? 2*(k-1-its)+its+1 : 1);
					if(!vis[it][newty])
					{
						pq.push({-dist3[it][newty], it, newty});
					}
					vis[it][newty] = true;
				}
			}
		}
		for(int i = 1; i <= n; i++)
		{
			ans2[i] = min(ans2[i], dist3[i][1]+gh[its]-2*(k-1-its));
		}
	}
	for(int i = 1; i <= n; i++)	cout << ans2[i] << '\n';
	
	
	

    return 0;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5212 KB Output is correct
2 Correct 10 ms 6244 KB Output is correct
3 Correct 16 ms 7004 KB Output is correct
4 Correct 15 ms 7004 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 240980 KB Output is correct
2 Correct 98 ms 243024 KB Output is correct
3 Correct 22 ms 11352 KB Output is correct
4 Correct 25 ms 11356 KB Output is correct
5 Correct 106 ms 244560 KB Output is correct
6 Correct 29 ms 11352 KB Output is correct
7 Correct 22 ms 11096 KB Output is correct
8 Correct 22 ms 11092 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 240976 KB Output is correct
2 Correct 98 ms 243008 KB Output is correct
3 Correct 117 ms 244560 KB Output is correct
4 Correct 110 ms 244820 KB Output is correct
5 Correct 112 ms 244820 KB Output is correct
6 Correct 30 ms 11268 KB Output is correct
7 Correct 29 ms 11348 KB Output is correct
8 Correct 125 ms 244844 KB Output is correct
9 Correct 94 ms 241828 KB Output is correct
10 Correct 13 ms 10588 KB Output is correct

Subtask #4
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7260 KB Output is correct
2 Correct 4 ms 9584 KB Output is correct
3 Correct 79 ms 240908 KB Output is correct
4 Correct 126 ms 241232 KB Output is correct
5 Correct 102 ms 241096 KB Output is correct
6 Correct 77 ms 240720 KB Output is correct
7 Correct 79 ms 240728 KB Output is correct
8 Correct 109 ms 241184 KB Output is correct
9 Correct 3 ms 9308 KB Output is correct
10 Correct 2 ms 9308 KB Output is correct
11 Correct 3 ms 9308 KB Output is correct
12 Correct 3 ms 9308 KB Output is correct
13 Correct 116 ms 241104 KB Output is correct
14 Correct 3 ms 9560 KB Output is correct
15 Correct 86 ms 240812 KB Output is correct
16 Correct 92 ms 240972 KB Output is correct
17 Correct 133 ms 240976 KB Output is correct
18 Correct 2 ms 9564 KB Output is correct
19 Correct 76 ms 240952 KB Output is correct
20 Correct 76 ms 240980 KB Output is correct
21 Incorrect 97 ms 241228 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 11400 KB Output is correct
2 Correct 24 ms 11356 KB Output is correct
3 Correct 21 ms 11352 KB Output is correct
4 Correct 31 ms 11512 KB Output is correct
5 Correct 45 ms 11340 KB Output is correct
6 Correct 18 ms 10840 KB Output is correct
7 Correct 18 ms 10876 KB Output is correct
8 Correct 12 ms 10332 KB Output is correct
9 Correct 13 ms 10332 KB Output is correct
10 Correct 22 ms 10916 KB Output is correct
11 Correct 24 ms 10844 KB Output is correct
12 Correct 30 ms 11608 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 11400 KB Output is correct
2 Correct 24 ms 11356 KB Output is correct
3 Correct 21 ms 11352 KB Output is correct
4 Correct 31 ms 11512 KB Output is correct
5 Correct 45 ms 11340 KB Output is correct
6 Correct 18 ms 10840 KB Output is correct
7 Correct 18 ms 10876 KB Output is correct
8 Correct 12 ms 10332 KB Output is correct
9 Correct 13 ms 10332 KB Output is correct
10 Correct 22 ms 10916 KB Output is correct
11 Correct 24 ms 10844 KB Output is correct
12 Correct 30 ms 11608 KB Output is correct
13 Correct 30 ms 11352 KB Output is correct
14 Correct 116 ms 11356 KB Output is correct
15 Correct 511 ms 11264 KB Output is correct
16 Correct 268 ms 11452 KB Output is correct
17 Correct 210 ms 11284 KB Output is correct
18 Correct 694 ms 11480 KB Output is correct
19 Correct 907 ms 11424 KB Output is correct
20 Correct 208 ms 11600 KB Output is correct
21 Correct 15 ms 10332 KB Output is correct
22 Correct 135 ms 10480 KB Output is correct
23 Correct 1248 ms 243104 KB Output is correct
24 Correct 33 ms 11076 KB Output is correct
25 Correct 232 ms 11384 KB Output is correct
26 Correct 435 ms 11348 KB Output is correct
27 Correct 28 ms 10580 KB Output is correct
28 Correct 187 ms 10524 KB Output is correct
29 Correct 348 ms 10576 KB Output is correct
30 Correct 36 ms 11228 KB Output is correct
31 Correct 315 ms 11452 KB Output is correct
32 Correct 617 ms 11604 KB Output is correct

Subtask #7
0.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 7260 KB Output is correct
2 Correct 4 ms 9584 KB Output is correct
3 Correct 79 ms 240908 KB Output is correct
4 Correct 126 ms 241232 KB Output is correct
5 Correct 102 ms 241096 KB Output is correct
6 Correct 77 ms 240720 KB Output is correct
7 Correct 79 ms 240728 KB Output is correct
8 Correct 109 ms 241184 KB Output is correct
9 Correct 3 ms 9308 KB Output is correct
10 Correct 2 ms 9308 KB Output is correct
11 Correct 3 ms 9308 KB Output is correct
12 Correct 3 ms 9308 KB Output is correct
13 Correct 116 ms 241104 KB Output is correct
14 Correct 3 ms 9560 KB Output is correct
15 Correct 86 ms 240812 KB Output is correct
16 Correct 92 ms 240972 KB Output is correct
17 Correct 133 ms 240976 KB Output is correct
18 Correct 2 ms 9564 KB Output is correct
19 Correct 76 ms 240952 KB Output is correct
20 Correct 76 ms 240980 KB Output is correct
21 Incorrect 97 ms 241228 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #8
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5212 KB Output is correct
2 Correct 10 ms 6244 KB Output is correct
3 Correct 16 ms 7004 KB Output is correct
4 Correct 15 ms 7004 KB Output is correct
5 Correct 73 ms 240980 KB Output is correct
6 Correct 98 ms 243024 KB Output is correct
7 Correct 22 ms 11352 KB Output is correct
8 Correct 25 ms 11356 KB Output is correct
9 Correct 106 ms 244560 KB Output is correct
10 Correct 29 ms 11352 KB Output is correct
11 Correct 22 ms 11096 KB Output is correct
12 Correct 22 ms 11092 KB Output is correct
13 Correct 72 ms 240976 KB Output is correct
14 Correct 98 ms 243008 KB Output is correct
15 Correct 117 ms 244560 KB Output is correct
16 Correct 110 ms 244820 KB Output is correct
17 Correct 112 ms 244820 KB Output is correct
18 Correct 30 ms 11268 KB Output is correct
19 Correct 29 ms 11348 KB Output is correct
20 Correct 125 ms 244844 KB Output is correct
21 Correct 94 ms 241828 KB Output is correct
22 Correct 13 ms 10588 KB Output is correct
23 Correct 2 ms 7260 KB Output is correct
24 Correct 4 ms 9584 KB Output is correct
25 Correct 79 ms 240908 KB Output is correct
26 Correct 126 ms 241232 KB Output is correct
27 Correct 102 ms 241096 KB Output is correct
28 Correct 77 ms 240720 KB Output is correct
29 Correct 79 ms 240728 KB Output is correct
30 Correct 109 ms 241184 KB Output is correct
31 Correct 3 ms 9308 KB Output is correct
32 Correct 2 ms 9308 KB Output is correct
33 Correct 3 ms 9308 KB Output is correct
34 Correct 3 ms 9308 KB Output is correct
35 Correct 116 ms 241104 KB Output is correct
36 Correct 3 ms 9560 KB Output is correct
37 Correct 86 ms 240812 KB Output is correct
38 Correct 92 ms 240972 KB Output is correct
39 Correct 133 ms 240976 KB Output is correct
40 Correct 2 ms 9564 KB Output is correct
41 Correct 76 ms 240952 KB Output is correct
42 Correct 76 ms 240980 KB Output is correct
43 Incorrect 97 ms 241228 KB Output isn't correct
44 Halted 0 ms 0 KB -