oj.uz

Submission #553446

# Submission time Handle Problem Language Result Execution time Memory
553446 2022-04-25T21:20:39 Z new_acc Portals (BOI14_portals) C++14
70 / 100
 1000 ms 49572 KB 
#include<bits/stdc++.h>
#define fi first
#define se second
#define pitem item*
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
const int N=1e3+10;
const int SS=1<<19;
const int INFi=2e9;
const ll INFl=1e13;
const ll mod2=998244353;
const ll mod=1e9+7;
const ll mod3=1000696969;
const ll p=70032301;
const ull p2=913;
const int L=20;
int last[N][N][4],odl[N][N],m,n,naj[N][N];
char t[N][N];
priority_queue<pair<int,pair<int,int> >, vector<pair<int,pair<int,int> > >,greater<pair<int,pair<int,int> > > >deq;
bool vis[N][N];
bool inn(int a,int b){
	return (a>=1 and a<=n and b>=1 and b<=m and t[a][b]!='#');
}
void add(int a,int b){
	vis[a][b]=1;
	if(inn(a-1,b) and !vis[a-1][b]) deq.push({odl[a][b]+1,{a-1,b}});
	if(inn(a+1,b) and !vis[a+1][b]) deq.push({odl[a][b]+1,{a+1,b}});
	if(inn(a,b+1) and !vis[a][b+1]) deq.push({odl[a][b]+1,{a,b+1}});
	if(inn(a,b-1) and !vis[a][b-1]) deq.push({odl[a][b]+1,{a,b-1}});
	if(!vis[a][last[a][b][0]]) deq.push({odl[a][b]+naj[a][b]+1,{a,last[a][b][0]}});
	if(!vis[a][last[a][b][1]]) deq.push({odl[a][b]+naj[a][b]+1,{a,last[a][b][1]}});
	if(!vis[last[a][b][2]][b]) deq.push({odl[a][b]+naj[a][b]+1,{last[a][b][2],b}});
	if(!vis[last[a][b][3]][b]) deq.push({odl[a][b]+naj[a][b]+1,{last[a][b][3],b}});
}
void solve(){
	cin>>n>>m;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++) cin>>t[i][j];
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			if(t[i][j-1]=='#' or j==1) last[i][j][0]=j;
			else last[i][j][0]=last[i][j-1][0];
			if(t[i-1][j]=='#' or i==1) last[i][j][2]=i;
			else last[i][j][2]=last[i-1][j][2];
		}	
	}
	deque<pair<int,int> >tf;
	for(int i=n;i>=1;i--){
		for(int j=m;j>=1;j--){
			if(t[i+1][j]=='#' or i==n) last[i][j][3]=i;
			else last[i][j][3]=last[i+1][j][3];
			if(t[i][j+1]=='#' or j==m) last[i][j][1]=j;
			else last[i][j][1]=last[i][j+1][1];
			if(t[i][j]=='#') tf.push_back({i,j});
			else naj[i][j]=INFi;
		}
		tf.push_back({i,0}),tf.push_back({i,m+1});
	}
	for(int i=1;i<=m;i++) tf.push_back({0,i}),tf.push_back({n+1,i});
	while(tf.size()){
		pair<int,int> v=tf.front();
		tf.pop_front();
		if(inn(v.fi+1,v.se) and naj[v.fi+1][v.se]==INFi) naj[v.fi+1][v.se]=naj[v.fi][v.se]+1,tf.push_back({v.fi+1,v.se});
		if(inn(v.fi-1,v.se) and naj[v.fi-1][v.se]==INFi) naj[v.fi-1][v.se]=naj[v.fi][v.se]+1,tf.push_back({v.fi-1,v.se});
		if(inn(v.fi,v.se+1) and naj[v.fi][v.se+1]==INFi) naj[v.fi][v.se+1]=naj[v.fi][v.se]+1,tf.push_back({v.fi,v.se+1});
		if(inn(v.fi,v.se-1) and naj[v.fi][v.se-1]==INFi) naj[v.fi][v.se-1]=naj[v.fi][v.se]+1,tf.push_back({v.fi,v.se-1});
	}
	for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) naj[i][j]--;
	pair<int,int>s,tt;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
		 	if(t[i][j]=='S') s={i,j};
		 	if(t[i][j]=='C') tt={i,j};
		}
	}
	deq.push({0,s});
	while(deq.size()){
		pair<int,pair<int,int> >v=deq.top();
		deq.pop();
		if(vis[v.se.fi][v.se.se]) continue;
		odl[v.se.fi][v.se.se]=v.fi;
		add(v.se.fi,v.se.se);
	}
	cout<<odl[tt.fi][tt.se]<<"\n";
}
int main(){
	ios_base::sync_with_stdio(0),cin.tie(0);
	solve();
}

Subtask #1
11.0 / 11.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 468 KB Output is correct
6 Correct 0 ms 468 KB Output is correct
7 Correct 0 ms 468 KB Output is correct
8 Correct 1 ms 484 KB Output is correct
9 Correct 2 ms 980 KB Output is correct
10 Correct 2 ms 1108 KB Output is correct
11 Correct 1 ms 980 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 2 ms 980 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 980 KB Output is correct
16 Correct 0 ms 340 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 9 ms 3924 KB Output is correct
6 Correct 11 ms 4004 KB Output is correct
7 Correct 11 ms 3924 KB Output is correct
8 Correct 5 ms 3924 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 0 ms 468 KB Output is correct
8 Correct 0 ms 468 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 2 ms 1108 KB Output is correct
11 Correct 1 ms 980 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 1076 KB Output is correct
14 Correct 8 ms 3864 KB Output is correct
15 Correct 11 ms 3924 KB Output is correct
16 Correct 12 ms 3984 KB Output is correct
17 Correct 11 ms 3924 KB Output is correct
18 Correct 18 ms 3924 KB Output is correct
19 Correct 21 ms 3916 KB Output is correct
20 Correct 34 ms 5240 KB Output is correct
21 Correct 9 ms 3924 KB Output is correct
22 Correct 9 ms 3924 KB Output is correct
23 Correct 10 ms 3888 KB Output is correct
24 Correct 12 ms 3684 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 ms 980 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 5 ms 3924 KB Output is correct

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 0 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 2 ms 1076 KB Output is correct
10 Correct 3 ms 1108 KB Output is correct
11 Correct 1 ms 980 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 7 ms 3924 KB Output is correct
15 Correct 10 ms 3908 KB Output is correct
16 Correct 11 ms 3880 KB Output is correct
17 Correct 11 ms 3924 KB Output is correct
18 Correct 21 ms 3924 KB Output is correct
19 Correct 20 ms 3924 KB Output is correct
20 Correct 35 ms 5328 KB Output is correct
21 Correct 9 ms 3924 KB Output is correct
22 Correct 12 ms 3924 KB Output is correct
23 Correct 10 ms 3924 KB Output is correct
24 Correct 318 ms 30068 KB Output is correct
25 Correct 462 ms 26676 KB Output is correct
26 Correct 728 ms 31828 KB Output is correct
27 Execution timed out 1094 ms 49572 KB Time limit exceeded
28 Halted 0 ms 0 KB -