| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 751272 | irmuun | Portals (BOI14_portals) | C++17 | 0 ms | 0 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
v#include<bits/stdc++.h>
using namespace std;
 
#define pb push_back
#define ll long long
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    int r,c;
    cin>>r>>c;
    string s[r+5];
    vector<pair<int,int>>adj[r+5][c+5];
    int sx,sy,cx,cy;
    for(int i=0;i<r;i++){
        cin>>s[i];
        vector<int>v;
        v.pb(-1);
        for(int j=0;j<c;j++){
            if(s[i][j]=='S'){
                sx=i;
                sy=j;
            }
            if(s[i][j]=='C'){
                cx=i;
                cy=j;
            }
            if(s[i][j]=='#'){
                v.pb(j);
            }
        }
        v.pb(r);
        for(int j=0;j<v.size()-1;j++){
            if(v[j]+1!=v[j+1]){
                adj[i][v[j]+1].pb({i,v[j+1]-1});
                adj[i][v[j+1]-1].pb({i,v[j]+1});
            }
        }
    }
    for(int j=0;j<c;j++){
        vector<int>v;
        v.pb(-1);
        for(int i=0;i<r;i++){
            if(s[i][j]=='#'){
                v.pb(i);
            }
        }
        v.pb(r);
        for(int i=0;i<v.size()-1;i++){
            if(v[i]+1!=v[i+1]){
                adj[v[i]+1][j].pb({v[i+1]-1,j});
                adj[v[i+1]-1][j].pb({v[i]+1,j});
            }
        }
    }
    vector<int>dx={1,-1,0,0};
    vector<int>dy={0,0,1,-1};
    for(int i=0;i<r;i++){
        for(int j=0;j<c;j++){
            if(s[i][j]=='#') continue;
            for(int k=0;k<4;k++){
                int x=i+dx[k],y=j+dy[k];
                if(x<0||x>=r||y<0||y>=c||s[x][y]=='#') continue;
                adj[i][j].pb({x,y});
            }
        }
    }
    int dist[r+5][c+5];
    memset(dist,-1,sizeof(dist));
    queue<pair<int,int>>q;
    q.push({sx,sy});
    dist[sx][sy]=0;
    while(!q.empty()){
        int x=q.front().ff,y=q.front().ss;
        q.pop();
        for(auto [i,j]:adj[x][y]){
            if(dist[i][j]==-1){
                dist[i][j]=dist[x][y]+1;
                q.push({i,j});
            }
        }
    }
    cout<<dist[cx][cy];
}
