oj.uz

Submission #751273

# Submission time Handle Problem Language Result Execution time Memory
751273 2023-05-31T10:29:05 Z irmuun Portals (BOI14_portals) C++17
0 / 100
 1 ms 320 KB 
#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];
}

Compilation message

portals.cpp: In function 'int main()':
portals.cpp:36:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |         for(int j=0;j<v.size()-1;j++){
      |                     ~^~~~~~~~~~~
portals.cpp:52:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |         for(int i=0;i<v.size()-1;i++){
      |                     ~^~~~~~~~~~~
portals.cpp:75:17: warning: 'sy' may be used uninitialized in this function [-Wmaybe-uninitialized]
   75 |     dist[sx][sy]=0;
      |     ~~~~~~~~~~~~^~
portals.cpp:75:17: warning: 'sx' may be used uninitialized in this function [-Wmaybe-uninitialized]
portals.cpp:86:22: warning: 'cy' may be used uninitialized in this function [-Wmaybe-uninitialized]
   86 |     cout<<dist[cx][cy];
      |                      ^
portals.cpp:86:22: warning: 'cx' may be used uninitialized in this function [-Wmaybe-uninitialized]

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 320 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Incorrect 1 ms 320 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 320 KB Output is correct
5 Incorrect 1 ms 212 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Incorrect 1 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Incorrect 1 ms 212 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Incorrect 1 ms 212 KB Output isn't correct
6 Halted 0 ms 0 KB -