Submission #465733

#TimeUsernameProblemLanguageResultExecution timeMemory
465733MohamedFaresNebiliPortals (BOI14_portals)C++14
70 / 100
1079 ms5572 KiB
#include <bits/stdc++.h> using namespace std; void solve() { /// JUST KEEP GOING const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; int n, m; cin>>n>>m; char grid[n][m]; int d[n][m]; int sx, sy; int ex, ey; for(int l=0;l<n;l++) { for(int i=0;i<m;i++) { cin>>grid[l][i]; d[l][i]=1000000000; if(grid[l][i]=='S') { sx=l; sy=i; d[sx][sy]=0; } else if(grid[l][i]=='C') { ex=l; ey=i; } } } queue<pair<int, int>>q; q.push({sx, sy}); while(!q.empty()) { int a=q.front().first, b=q.front().second; q.pop(); bool wall=false; for(int l=0;l<4;l++) { int x=a+nx[l], y=b+ny[l]; if(x<0||x>=n||y<0||y>=m||grid[x][y]=='#') { wall=true; continue; } if(d[x][y]>d[a][b]+1) { d[x][y]=d[a][b]+1; q.push({x, y}); } } int p=1000000000; if(!wall) { for(int l=0;l<4;l++) { int x=a, y=b; int k=0; while(x>=0&&y>=0&&x<n&&y<m&&grid[x][y]!='#') { x+=nx[l]; y+=ny[l]; k++; } x-=nx[l]; y-=ny[l]; p=min(p, k); } } else p=1; for(int l=0;l<4;l++) { int x=a, y=b; while(x>=0&&y>=0&&x<n&&y<m&&grid[x][y]!='#') { x+=nx[l]; y+=ny[l]; } x-=nx[l], y-=ny[l]; if(d[x][y]>d[a][b]+p) { d[x][y]=d[a][b]+p; q.push({x, y}); } } } cout<<d[ex][ey]<<'\n'; } int32_t main() { int t; t=1; while(t--) { solve(); } return 0; }

Compilation message (stderr)

portals.cpp: In function 'void solve()':
portals.cpp:57:22: warning: 'ex' may be used uninitialized in this function [-Wmaybe-uninitialized]
   57 |     cout<<d[ex][ey]<<'\n';
      |                      ^~~~
portals.cpp:57:22: warning: 'ey' may be used uninitialized in this function [-Wmaybe-uninitialized]
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...