oj.uz

답안 #115973

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
115973 2019-06-10T06:02:41 Z ckodser 포탈들 (BOI14_portals) C++14
70 / 100
 1000 ms 102108 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){
    set<pii> st;
    st.insert(mp(0,a));
    fill(dp,dp+maxm,inf);
    while(st.size()){
	pii e=(*st.begin());
	st.erase(e);
	ll v=e.S;
	ll w=e.F;
	if(dp[v]==inf){
	    dp[v]=w;
	    for(auto t:ger[v]){
		st.insert(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:142:24: warning: 'end' may be used uninitialized in this function [-Wmaybe-uninitialized]
     cout<<fas(start,end);
                        ^
portals.cpp:142:24: warning: 'start' may be used uninitialized in this function [-Wmaybe-uninitialized]

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 32376 KB Output is correct
2 Correct 33 ms 32376 KB Output is correct
3 Correct 29 ms 32384 KB Output is correct
4 Correct 29 ms 32376 KB Output is correct
5 Correct 30 ms 32384 KB Output is correct
6 Correct 30 ms 32384 KB Output is correct
7 Correct 32 ms 32376 KB Output is correct
8 Correct 29 ms 32376 KB Output is correct
9 Correct 30 ms 32340 KB Output is correct
10 Correct 30 ms 32364 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 32376 KB Output is correct
2 Correct 30 ms 32364 KB Output is correct
3 Correct 29 ms 32384 KB Output is correct
4 Correct 32 ms 32384 KB Output is correct
5 Correct 29 ms 32376 KB Output is correct
6 Correct 29 ms 32376 KB Output is correct
7 Correct 29 ms 32376 KB Output is correct
8 Correct 29 ms 32376 KB Output is correct
9 Correct 33 ms 32888 KB Output is correct
10 Correct 39 ms 32760 KB Output is correct
11 Correct 33 ms 32640 KB Output is correct
12 Correct 31 ms 32640 KB Output is correct
13 Correct 31 ms 32768 KB Output is correct
14 Correct 30 ms 32384 KB Output is correct
15 Correct 32 ms 32760 KB Output is correct
16 Correct 30 ms 32376 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 32384 KB Output is correct
2 Correct 29 ms 32384 KB Output is correct
3 Correct 31 ms 32504 KB Output is correct
4 Correct 29 ms 32384 KB Output is correct
5 Correct 48 ms 35192 KB Output is correct
6 Correct 52 ms 35204 KB Output is correct
7 Correct 58 ms 35576 KB Output is correct
8 Correct 44 ms 35192 KB Output is correct

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 32364 KB Output is correct
2 Correct 31 ms 32512 KB Output is correct
3 Correct 31 ms 32376 KB Output is correct
4 Correct 29 ms 32256 KB Output is correct
5 Correct 30 ms 32384 KB Output is correct
6 Correct 31 ms 32380 KB Output is correct
7 Correct 31 ms 32376 KB Output is correct
8 Correct 30 ms 32384 KB Output is correct
9 Correct 33 ms 32896 KB Output is correct
10 Correct 32 ms 32768 KB Output is correct
11 Correct 33 ms 32640 KB Output is correct
12 Correct 31 ms 32616 KB Output is correct
13 Correct 32 ms 32632 KB Output is correct
14 Correct 51 ms 35072 KB Output is correct
15 Correct 55 ms 35320 KB Output is correct
16 Correct 59 ms 35704 KB Output is correct
17 Correct 63 ms 35704 KB Output is correct
18 Correct 72 ms 36372 KB Output is correct
19 Correct 116 ms 38136 KB Output is correct
20 Correct 97 ms 38008 KB Output is correct
21 Correct 52 ms 35064 KB Output is correct
22 Correct 110 ms 35192 KB Output is correct
23 Correct 57 ms 35456 KB Output is correct
24 Correct 115 ms 38520 KB Output is correct
25 Correct 29 ms 32384 KB Output is correct
26 Correct 32 ms 32760 KB Output is correct
27 Correct 29 ms 32376 KB Output is correct
28 Correct 43 ms 35200 KB Output is correct

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 32256 KB Output is correct
2 Correct 28 ms 32384 KB Output is correct
3 Correct 30 ms 32384 KB Output is correct
4 Correct 47 ms 32384 KB Output is correct
5 Correct 30 ms 32348 KB Output is correct
6 Correct 31 ms 32376 KB Output is correct
7 Correct 31 ms 32376 KB Output is correct
8 Correct 31 ms 32384 KB Output is correct
9 Correct 34 ms 33016 KB Output is correct
10 Correct 33 ms 32848 KB Output is correct
11 Correct 31 ms 32612 KB Output is correct
12 Correct 30 ms 32640 KB Output is correct
13 Correct 33 ms 32760 KB Output is correct
14 Correct 53 ms 35072 KB Output is correct
15 Correct 58 ms 35192 KB Output is correct
16 Correct 57 ms 35704 KB Output is correct
17 Correct 61 ms 35704 KB Output is correct
18 Correct 74 ms 36344 KB Output is correct
19 Correct 107 ms 38136 KB Output is correct
20 Correct 101 ms 38008 KB Output is correct
21 Correct 53 ms 35192 KB Output is correct
22 Correct 54 ms 35192 KB Output is correct
23 Correct 56 ms 35284 KB Output is correct
24 Execution timed out 1078 ms 102108 KB Time limit exceeded
25 Halted 0 ms 0 KB -