oj.uz

Submission #943249

# Submission time Handle Problem Language Result Execution time Memory
943249 2024-03-11T09:39:36 Z WongYiKai Portals (BOI14_portals) C++14
70 / 100
 221 ms 262144 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

ll r,c;

ll a(ll i, ll j) {
	return (i)*(c+2)+j;
}
pair<ll,ll> ra(ll x) {
	return {(x)/(c+2),(x)%(c+2)};
}


int main(){
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin >> r >> c;
	//if (r*c>100) return 0;
	ll grid[r+5][c+5];
	ll s,e;
	memset(grid,0,sizeof(grid));
	for (int i=1;i<=r;i++){
		string temp;
		cin >> temp;
		for (int j=1;j<=c;j++){
			if (temp[j-1]=='.') grid[i][j] = 1;
			else if (temp[j-1]=='#') grid[i][j] = 0;
			else if (temp[j-1]=='C') {
				grid[i][j] = 1;
				e = a(i,j);
			}
			else{
				grid[i][j] = 1;
				s = a(i,j);
			}
		}
	}
	ll visited[r*c+r+r+c+c+10];
	queue<pair<ll,ll>> bfs;
	memset(visited,0,sizeof(visited));
	for (int i=1;i<=r;i++){
		for (int j=1;j<=c;j++){
			if (grid[i][j]==0) continue;
			ll check=0;
			if (grid[i-1][j]==0) check=1;
			else if (grid[i+1][j]==0) check=1;
			else if (grid[i][j-1]==0) check=1;
			else if (grid[i][j+1]==0) check=1;
			if (check==0) continue;
			bfs.push({a(i,j),0});
			visited[a(i,j)]=1;
		}
	}
	ll dist[r*c+r+r+c+c+10];
	memset(dist,-1,sizeof(dist));
	while (!bfs.empty()){
		ll x = bfs.front().first;
		ll rnk = bfs.front().second;
		dist[x] = rnk;
		bfs.pop();
		ll item;
		pair<ll,ll> temp;
		item=x-1;
		if (visited[item]==0){
			temp = ra(item);
			if (grid[temp.first][temp.second]==1){
				visited[item] = 1;
				bfs.push({item,rnk+1});
			}
		}
		item=x+1;
		if (visited[item]==0){
			temp = ra(item);
			if (grid[temp.first][temp.second]==1){
				visited[item] = 1;
				bfs.push({item,rnk+1});
			}
		}
		item=x-c-2;
		if (visited[item]==0){
			temp = ra(item);
			if (grid[temp.first][temp.second]==1){
				visited[item] = 1;
				bfs.push({item,rnk+1});
			}
		}
		item=x+c+2;
		if (visited[item]==0){
			temp = ra(item);
			if (grid[temp.first][temp.second]==1){
				visited[item] = 1;
				bfs.push({item,rnk+1});
			}
		}
	}
	/*
	for (int i=1;i<=r;i++){
		for (int j=1;j<=c;j++){
			cout << dist[a(i,j)] << " ";
		}
		cout << "\n";
	}
	*/
	ll left[r*c+r+r+c+c+10],right[r*c+r+r+c+c+10],up[r*c+r+r+c+c+10],down[r*c+r+r+c+c+10];
	for (int j=1;j<=c;j++) up[a(0,j)] = a(0,j);
	for (int i=1;i<=r;i++){
		if (grid[i][1]==0) {
			left[a(i,1)]=a(i,1);
			up[a(i,1)]=a(i,1);
		}
		else {
			left[a(i,1)]=a(i,0);
			up[a(i,1)] = up[a(i-1,1)];
		}
		for (int j=2;j<=c;j++){
			if (grid[i][j]==0) {
				left[a(i,j)] = a(i,j);
				up[a(i,j)] = a(i,j);
			}
			else {
				left[a(i,j)] = left[a(i,j-1)];
				up[a(i,j)] = up[a(i-1,j)];
			}
		}
	}
	//right down
	for (int j=1;j<=c;j++) down[a(r+1,j)] = a(r+1,j);
	for (int i=r;i>=1;i--){
		if (grid[i][c]==0) {
			right[a(i,c)]=a(i,c);
			down[a(i,c)]=a(i,c);
		}
		else {
			right[a(i,c)]=a(i,c+1);
			down[a(i,c)] = down[a(i+1,c)];
		}
		for (int j=c-1;j>=1;j--){
			if (grid[i][j]==0) {
				right[a(i,j)] = a(i,j);
				down[a(i,j)] = a(i,j);
			}
			else {
				right[a(i,j)] = right[a(i,j+1)];
				down[a(i,j)] = down[a(i+1,j)];
			}
		}
	}
	/*
	cout << "left\n";
	for (int i=1;i<=r;i++){
		for (int j=1;j<=c;j++){
			cout << ra(left[a(i,j)]).first << "," << ra(left[a(i,j)]).second << " ";
		}
		cout << "\n";
	}
	cout << "right\n";
	for (int i=1;i<=r;i++){
		for (int j=1;j<=c;j++){
			cout << ra(right[a(i,j)]).first << "," << ra(right[a(i,j)]).second << " ";
		}
		cout << "\n";
	}
	cout << "down\n";
	for (int i=1;i<=r;i++){
		for (int j=1;j<=c;j++){
			cout << ra(down[a(i,j)]).first << "," << ra(down[a(i,j)]).second << " ";
		}
		cout << "\n";
	}
	cout << "up\n";
	for (int i=1;i<=r;i++){
		for (int j=1;j<=c;j++){
			cout << ra(up[a(i,j)]).first << "," << ra(up[a(i,j)]).second << " ";
		}
		cout << "\n";
	}
	*/
	
	vector<pair<ll,ll>> adj[r*c*5];
	for (int i=1;i<=r;i++){
		for (int j=1;j<=c;j++){
			if (grid[i][j]==0) continue;
			ll x = a(i,j);
			ll item;
			pair<ll,ll> temp;
			item=x-1;
			temp = ra(item);
			if (grid[temp.first][temp.second]==1){
				adj[x].push_back({item,1});
			}
			item=x+1;
			temp = ra(item);
			if (grid[temp.first][temp.second]==1){
				adj[x].push_back({item,1});
			}
			item=x-c-2;
			temp = ra(item);
			if (grid[temp.first][temp.second]==1){
				adj[x].push_back({item,1});
			}
			item=x+c+2;
			temp = ra(item);
			if (grid[temp.first][temp.second]==1){
				adj[x].push_back({item,1});
			}
			adj[x].push_back({left[x]+1,max(0LL,dist[x])+1});
			adj[x].push_back({down[x]-c-2,max(0LL,dist[x])+1});
			adj[x].push_back({up[x]+c+2,max(0LL,dist[x])+1});
			adj[x].push_back({right[x]-1,max(0LL,dist[x])+1});
		}
	}
	
	/*
	for (int i=1;i<=r;i++){
		for (int j=1;j<=c;j++){
			cout << i << "," << j << ": ";
			for (auto item:adj[a(i,j)]){
				cout << ra(item.first).first << "," << ra(item.first).second << "," << item.second << " ";
			}
			cout << "\n";
		}
	}
	*/
	
	ll dis[r*c*5];
	priority_queue<pair<ll,ll>,vector<pair<ll,ll>>,greater<pair<ll,ll>>> pq;
	memset(dis,-1,sizeof(dis));
	dis[s]=0;
	pq.push({0,s});
	while (!pq.empty())	{
		pair<ll,ll> cur = pq.top();
		pq.pop();
		ll x = cur.second, d = cur.first;
		if (d>dis[x]) continue;
		for (vector<pair<ll,ll>>::iterator it=adj[x].begin();it!=adj[x].end();++it){
			ll nx = it->first, nd = d+it->second;
			if (dis[nx]!=-1 && dis[nx]<=nd) continue;
			dis[nx] = nd;
			pq.push({nd,nx});
		}
	}
	
	/*
	for (int i=1;i<=r;i++){
		for (int j=1;j<=c;j++){
			cout << dis[a(i,j)] << " ";
		}
		cout << "\n";
	}
	*/
	cout << dis[e];	
	//cout << "a";
	
}

Compilation message

portals.cpp: In function 'int main()':
portals.cpp:251:15: warning: 'e' may be used uninitialized in this function [-Wmaybe-uninitialized]
  251 |  cout << dis[e];
      |               ^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 1116 KB Output is correct
10 Correct 1 ms 1116 KB Output is correct
11 Correct 2 ms 1116 KB Output is correct
12 Correct 2 ms 1116 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 2 ms 1116 KB Output is correct
16 Correct 1 ms 344 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 544 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 14 ms 12124 KB Output is correct
6 Correct 18 ms 12124 KB Output is correct
7 Correct 19 ms 12432 KB Output is correct
8 Correct 11 ms 12636 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 456 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 2 ms 1112 KB Output is correct
10 Correct 1 ms 1112 KB Output is correct
11 Correct 1 ms 1112 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 1 ms 1368 KB Output is correct
14 Correct 17 ms 12128 KB Output is correct
15 Correct 19 ms 12120 KB Output is correct
16 Correct 14 ms 12888 KB Output is correct
17 Correct 13 ms 12380 KB Output is correct
18 Correct 15 ms 13404 KB Output is correct
19 Correct 22 ms 14680 KB Output is correct
20 Correct 26 ms 14436 KB Output is correct
21 Correct 12 ms 12120 KB Output is correct
22 Correct 13 ms 12124 KB Output is correct
23 Correct 18 ms 12384 KB Output is correct
24 Correct 18 ms 14428 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 1116 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 11 ms 12660 KB Output is correct

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 356 KB Output is correct
2 Correct 0 ms 356 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 356 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 456 KB Output is correct
7 Correct 0 ms 352 KB Output is correct
8 Correct 1 ms 352 KB Output is correct
9 Correct 2 ms 1120 KB Output is correct
10 Correct 2 ms 1112 KB Output is correct
11 Correct 1 ms 1368 KB Output is correct
12 Correct 1 ms 1120 KB Output is correct
13 Correct 1 ms 1116 KB Output is correct
14 Correct 12 ms 12012 KB Output is correct
15 Correct 13 ms 12220 KB Output is correct
16 Correct 15 ms 12652 KB Output is correct
17 Correct 13 ms 12388 KB Output is correct
18 Correct 17 ms 13392 KB Output is correct
19 Correct 19 ms 14604 KB Output is correct
20 Correct 17 ms 14436 KB Output is correct
21 Correct 12 ms 12124 KB Output is correct
22 Correct 19 ms 12076 KB Output is correct
23 Correct 15 ms 12632 KB Output is correct
24 Runtime error 221 ms 262144 KB Execution killed with signal 9
25 Halted 0 ms 0 KB -