oj.uz

Submission #115977

# Submission time Handle Problem Language Result Execution time Memory
115977 2019-06-10T06:06:39 Z ckodser Portals (BOI14_portals) C++14
70 / 100
 1000 ms 129400 KB 
#include<bits/stdc++.h>

#define ll int
#define pb push_back
#define mp make_pair
#define ld long double
#define F first
#define S second
#define pii pair<ll,ll> 

using namespace :: std;

const ll mod=1e9+7;
const ll maxn=1010;
const ll inf=1e9+900;
const ll maxm=maxn*maxn;
const ll di[4]={+1,-1,0,0};
const ll dj[4]={0,0,+1,-1};


vector<pii> ger[maxm];
ll dp[maxm];

ll fas(ll a,ll b){
    queue<pii> st;
    st.push(mp(0,a));
    fill(dp,dp+maxm,inf);
    while(st.size()){
	pii e=st.front();
	st.pop();
	ll v=e.S;
	ll w=e.F;
	if(dp[v]>w){
	    dp[v]=w;
	    for(auto t:ger[v]){
		if(dp[t.F]>w+t.S){
		    st.push(mp(t.S+w,t.F));	 
		}
	    }	
	}
    }
    if(dp[b]==inf)dp[b]=-1;
    return dp[b];
}

string s[maxn];
ll minn[maxm];
ll ta[maxm][4];
ll n,m;

ll getid(ll a,ll b){
    return a*maxn+b;
}
bool val(ll a,ll b){
    return (!(a<0 || b<0 || a>=n || b>=m || s[a][b]=='#'));
}
void addYal(ll a,ll b,ll c){
    if(a==b)return;
    ger[a].pb(mp(b,c));
}	


int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    	
    cin>>n>>m;
    for(ll i=0;i<n;i++){
	cin>>s[i];
    }
    fill(minn,minn+maxm,inf);
    queue<ll> qu;
    for(ll i=0;i<n;i++){
	for(ll j=0;j<m;j++){
	    ll id=getid(i,j);
	    if(s[i][j]!='#'){
		for(ll y=0;y<4;y++){
		    if(val(i+di[y],j+dj[y])){
			addYal(getid(i,j),getid(i+di[y],j+dj[y]),1);
		    }else if(minn[id]==inf){
			minn[id]=1;
			qu.push(id);
		    }
		}
	    }
	}
    }	
    while(qu.size()){
	ll v=qu.front();
	qu.pop();
	for(auto e:ger[v]){
	    ll u=e.F;
	    if(minn[u]==inf){
		minn[u]=minn[v]+1;
		qu.push(u);
	    }	
	}
    }
    for(ll i=0;i<n;i++){
	for(ll j=0;j<m;j++){
	    ll id=getid(i,j);
	    if(val(i+di[1],j+dj[1])){
		ta[id][1]=ta[getid(i+di[1],j+dj[1])][1];
	    }else{
		ta[id][1]=id;
	    }

	    if(val(i+di[3],j+dj[3])){
		ta[id][3]=ta[getid(i+di[3],j+dj[3])][3];
	    }else{
		ta[id][3]=id;
	    }
	}
    }
    for(ll i=n-1;i>=0;i--){
	for(ll j=m-1;j>=0;j--){
	    ll id=getid(i,j);
	    if(val(i+di[2],j+dj[2])){
		ta[id][2]=ta[getid(i+di[2],j+dj[2])][2];
	    }else{
		ta[id][2]=id;
	    }

	    if(val(i+di[0],j+dj[0])){
		ta[id][0]=ta[getid(i+di[0],j+dj[0])][0];
	    }else{
		ta[id][0]=id;
	    }
	}
    }
    ll start;
    ll end;
    for(ll i=0;i<n;i++){
	for(ll j=0;j<m;j++){
	    if(s[i][j]!='#'){
		ll id=getid(i,j);
		if(s[i][j]=='S')start=id;
		if(s[i][j]=='C')end=id;
		for(ll y=0;y<4;y++){
		    addYal(id,ta[id][y],minn[id]);
		}
	    }
	}
    }	
    cout<<fas(start,end);
}

Compilation message

portals.cpp: In function 'int main()':
portals.cpp:144:24: warning: 'end' may be used uninitialized in this function [-Wmaybe-uninitialized]
     cout<<fas(start,end);
                        ^
portals.cpp:144:24: warning: 'start' may be used uninitialized in this function [-Wmaybe-uninitialized]

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 32256 KB Output is correct
2 Correct 31 ms 32384 KB Output is correct
3 Correct 31 ms 32384 KB Output is correct
4 Correct 30 ms 32256 KB Output is correct
5 Correct 37 ms 32348 KB Output is correct
6 Correct 29 ms 32376 KB Output is correct
7 Correct 30 ms 32376 KB Output is correct
8 Correct 29 ms 32456 KB Output is correct
9 Correct 29 ms 32376 KB Output is correct
10 Correct 29 ms 32348 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 32248 KB Output is correct
2 Correct 29 ms 32384 KB Output is correct
3 Correct 29 ms 32384 KB Output is correct
4 Correct 29 ms 32248 KB Output is correct
5 Correct 29 ms 32512 KB Output is correct
6 Correct 29 ms 32384 KB Output is correct
7 Correct 29 ms 32384 KB Output is correct
8 Correct 29 ms 32384 KB Output is correct
9 Correct 31 ms 32888 KB Output is correct
10 Correct 30 ms 32768 KB Output is correct
11 Correct 29 ms 32640 KB Output is correct
12 Correct 30 ms 32632 KB Output is correct
13 Correct 30 ms 32640 KB Output is correct
14 Correct 29 ms 32376 KB Output is correct
15 Correct 30 ms 32640 KB Output is correct
16 Correct 29 ms 32372 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 32248 KB Output is correct
2 Correct 28 ms 32332 KB Output is correct
3 Correct 29 ms 32384 KB Output is correct
4 Correct 29 ms 32376 KB Output is correct
5 Correct 43 ms 35064 KB Output is correct
6 Correct 43 ms 35192 KB Output is correct
7 Correct 44 ms 35576 KB Output is correct
8 Correct 42 ms 35164 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 32376 KB Output is correct
2 Correct 30 ms 32384 KB Output is correct
3 Correct 30 ms 32376 KB Output is correct
4 Correct 29 ms 32256 KB Output is correct
5 Correct 29 ms 32284 KB Output is correct
6 Correct 29 ms 32384 KB Output is correct
7 Correct 29 ms 32384 KB Output is correct
8 Correct 29 ms 32376 KB Output is correct
9 Correct 30 ms 32696 KB Output is correct
10 Correct 30 ms 32760 KB Output is correct
11 Correct 30 ms 32640 KB Output is correct
12 Correct 30 ms 32640 KB Output is correct
13 Correct 30 ms 32640 KB Output is correct
14 Correct 40 ms 35064 KB Output is correct
15 Correct 41 ms 35192 KB Output is correct
16 Correct 42 ms 35584 KB Output is correct
17 Correct 49 ms 35708 KB Output is correct
18 Correct 47 ms 36220 KB Output is correct
19 Correct 53 ms 36984 KB Output is correct
20 Correct 55 ms 36984 KB Output is correct
21 Correct 40 ms 35064 KB Output is correct
22 Correct 40 ms 35200 KB Output is correct
23 Correct 42 ms 35256 KB Output is correct
24 Correct 46 ms 36984 KB Output is correct
25 Correct 28 ms 32376 KB Output is correct
26 Correct 30 ms 32768 KB Output is correct
27 Correct 29 ms 32376 KB Output is correct
28 Correct 37 ms 35064 KB Output is correct

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 32252 KB Output is correct
2 Correct 30 ms 32384 KB Output is correct
3 Correct 31 ms 32376 KB Output is correct
4 Correct 31 ms 32376 KB Output is correct
5 Correct 30 ms 32376 KB Output is correct
6 Correct 31 ms 32408 KB Output is correct
7 Correct 32 ms 32384 KB Output is correct
8 Correct 30 ms 32384 KB Output is correct
9 Correct 31 ms 32760 KB Output is correct
10 Correct 31 ms 32760 KB Output is correct
11 Correct 30 ms 32632 KB Output is correct
12 Correct 30 ms 32632 KB Output is correct
13 Correct 30 ms 32632 KB Output is correct
14 Correct 41 ms 35060 KB Output is correct
15 Correct 41 ms 35232 KB Output is correct
16 Correct 43 ms 35584 KB Output is correct
17 Correct 50 ms 35832 KB Output is correct
18 Correct 47 ms 36128 KB Output is correct
19 Correct 54 ms 36956 KB Output is correct
20 Correct 58 ms 36984 KB Output is correct
21 Correct 38 ms 35192 KB Output is correct
22 Correct 45 ms 35192 KB Output is correct
23 Correct 61 ms 35320 KB Output is correct
24 Correct 655 ms 101496 KB Output is correct
25 Execution timed out 1083 ms 129400 KB Time limit exceeded
26 Halted 0 ms 0 KB -