oj.uz

답안 #989845

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
989845 2024-05-28T20:55:09 Z Cyber_Wolf Board Game (JOI24_boardgame) C++17
49 / 100
 924 ms 134496 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, K = (5e4+5)/(305);

vector<int> adj[N];
int loc[N], stop[N], stops = 0;
long long dist[N][N/M], dist2[N][N/M], sto[N/M], doub[N], sing[N], ans2[N], dist3[N][2], gh[N], inc[N];
bitset<K> 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(k > 300)
	{
		memset(dist, 0x3f, sizeof(dist));
		memset(dist2, 0x3f, sizeof(dist2));
		stops = min(stops, N/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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3676 KB Output is correct
2 Correct 13 ms 4956 KB Output is correct
3 Correct 22 ms 6016 KB Output is correct
4 Correct 15 ms 5724 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 130900 KB Output is correct
2 Correct 48 ms 132892 KB Output is correct
3 Correct 24 ms 7260 KB Output is correct
4 Correct 24 ms 7256 KB Output is correct
5 Correct 58 ms 134228 KB Output is correct
6 Correct 30 ms 7004 KB Output is correct
7 Correct 29 ms 6484 KB Output is correct
8 Correct 22 ms 7004 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 130904 KB Output is correct
2 Correct 50 ms 132956 KB Output is correct
3 Correct 65 ms 133972 KB Output is correct
4 Correct 73 ms 134224 KB Output is correct
5 Correct 64 ms 134496 KB Output is correct
6 Correct 31 ms 7252 KB Output is correct
7 Correct 29 ms 7004 KB Output is correct
8 Correct 65 ms 134380 KB Output is correct
9 Correct 42 ms 131924 KB Output is correct
10 Correct 13 ms 5412 KB Output is correct

Subtask #4
0.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4184 KB Output is correct
2 Correct 4 ms 3932 KB Output is correct
3 Correct 27 ms 130892 KB Output is correct
4 Correct 12 ms 4188 KB Output is correct
5 Correct 4 ms 4104 KB Output is correct
6 Correct 3 ms 3932 KB Output is correct
7 Correct 31 ms 130908 KB Output is correct
8 Correct 44 ms 131152 KB Output is correct
9 Correct 2 ms 3932 KB Output is correct
10 Correct 2 ms 3932 KB Output is correct
11 Correct 2 ms 3932 KB Output is correct
12 Correct 3 ms 3932 KB Output is correct
13 Correct 4 ms 3932 KB Output is correct
14 Correct 2 ms 3932 KB Output is correct
15 Correct 15 ms 3928 KB Output is correct
16 Correct 30 ms 3996 KB Output is correct
17 Correct 64 ms 3932 KB Output is correct
18 Correct 2 ms 3932 KB Output is correct
19 Correct 4 ms 3932 KB Output is correct
20 Correct 22 ms 4152 KB Output is correct
21 Incorrect 43 ms 131284 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 7004 KB Output is correct
2 Correct 24 ms 7260 KB Output is correct
3 Correct 19 ms 7140 KB Output is correct
4 Correct 36 ms 7372 KB Output is correct
5 Correct 45 ms 7240 KB Output is correct
6 Correct 17 ms 6492 KB Output is correct
7 Correct 18 ms 5760 KB Output is correct
8 Correct 13 ms 5468 KB Output is correct
9 Correct 13 ms 5468 KB Output is correct
10 Correct 24 ms 6480 KB Output is correct
11 Correct 31 ms 6492 KB Output is correct
12 Correct 36 ms 7264 KB Output is correct

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 7004 KB Output is correct
2 Correct 24 ms 7260 KB Output is correct
3 Correct 19 ms 7140 KB Output is correct
4 Correct 36 ms 7372 KB Output is correct
5 Correct 45 ms 7240 KB Output is correct
6 Correct 17 ms 6492 KB Output is correct
7 Correct 18 ms 5760 KB Output is correct
8 Correct 13 ms 5468 KB Output is correct
9 Correct 13 ms 5468 KB Output is correct
10 Correct 24 ms 6480 KB Output is correct
11 Correct 31 ms 6492 KB Output is correct
12 Correct 36 ms 7264 KB Output is correct
13 Correct 29 ms 7252 KB Output is correct
14 Correct 117 ms 7248 KB Output is correct
15 Correct 538 ms 7248 KB Output is correct
16 Correct 284 ms 7276 KB Output is correct
17 Correct 222 ms 6932 KB Output is correct
18 Correct 741 ms 7020 KB Output is correct
19 Correct 924 ms 6852 KB Output is correct
20 Correct 212 ms 7448 KB Output is correct
21 Correct 16 ms 5468 KB Output is correct
22 Correct 136 ms 5724 KB Output is correct
23 Correct 269 ms 5720 KB Output is correct
24 Correct 33 ms 6740 KB Output is correct
25 Correct 231 ms 6996 KB Output is correct
26 Correct 443 ms 6992 KB Output is correct
27 Correct 29 ms 5720 KB Output is correct
28 Correct 193 ms 5724 KB Output is correct
29 Correct 363 ms 5792 KB Output is correct
30 Correct 36 ms 7248 KB Output is correct
31 Correct 315 ms 7264 KB Output is correct
32 Correct 623 ms 7116 KB Output is correct

Subtask #7
0.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4184 KB Output is correct
2 Correct 4 ms 3932 KB Output is correct
3 Correct 27 ms 130892 KB Output is correct
4 Correct 12 ms 4188 KB Output is correct
5 Correct 4 ms 4104 KB Output is correct
6 Correct 3 ms 3932 KB Output is correct
7 Correct 31 ms 130908 KB Output is correct
8 Correct 44 ms 131152 KB Output is correct
9 Correct 2 ms 3932 KB Output is correct
10 Correct 2 ms 3932 KB Output is correct
11 Correct 2 ms 3932 KB Output is correct
12 Correct 3 ms 3932 KB Output is correct
13 Correct 4 ms 3932 KB Output is correct
14 Correct 2 ms 3932 KB Output is correct
15 Correct 15 ms 3928 KB Output is correct
16 Correct 30 ms 3996 KB Output is correct
17 Correct 64 ms 3932 KB Output is correct
18 Correct 2 ms 3932 KB Output is correct
19 Correct 4 ms 3932 KB Output is correct
20 Correct 22 ms 4152 KB Output is correct
21 Incorrect 43 ms 131284 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #8
0.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3676 KB Output is correct
2 Correct 13 ms 4956 KB Output is correct
3 Correct 22 ms 6016 KB Output is correct
4 Correct 15 ms 5724 KB Output is correct
5 Correct 27 ms 130900 KB Output is correct
6 Correct 48 ms 132892 KB Output is correct
7 Correct 24 ms 7260 KB Output is correct
8 Correct 24 ms 7256 KB Output is correct
9 Correct 58 ms 134228 KB Output is correct
10 Correct 30 ms 7004 KB Output is correct
11 Correct 29 ms 6484 KB Output is correct
12 Correct 22 ms 7004 KB Output is correct
13 Correct 29 ms 130904 KB Output is correct
14 Correct 50 ms 132956 KB Output is correct
15 Correct 65 ms 133972 KB Output is correct
16 Correct 73 ms 134224 KB Output is correct
17 Correct 64 ms 134496 KB Output is correct
18 Correct 31 ms 7252 KB Output is correct
19 Correct 29 ms 7004 KB Output is correct
20 Correct 65 ms 134380 KB Output is correct
21 Correct 42 ms 131924 KB Output is correct
22 Correct 13 ms 5412 KB Output is correct
23 Correct 2 ms 4184 KB Output is correct
24 Correct 4 ms 3932 KB Output is correct
25 Correct 27 ms 130892 KB Output is correct
26 Correct 12 ms 4188 KB Output is correct
27 Correct 4 ms 4104 KB Output is correct
28 Correct 3 ms 3932 KB Output is correct
29 Correct 31 ms 130908 KB Output is correct
30 Correct 44 ms 131152 KB Output is correct
31 Correct 2 ms 3932 KB Output is correct
32 Correct 2 ms 3932 KB Output is correct
33 Correct 2 ms 3932 KB Output is correct
34 Correct 3 ms 3932 KB Output is correct
35 Correct 4 ms 3932 KB Output is correct
36 Correct 2 ms 3932 KB Output is correct
37 Correct 15 ms 3928 KB Output is correct
38 Correct 30 ms 3996 KB Output is correct
39 Correct 64 ms 3932 KB Output is correct
40 Correct 2 ms 3932 KB Output is correct
41 Correct 4 ms 3932 KB Output is correct
42 Correct 22 ms 4152 KB Output is correct
43 Incorrect 43 ms 131284 KB Output isn't correct
44 Halted 0 ms 0 KB -