이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#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;
}
}
}
priority_queue<pair<int, pair<int, int>>>pq; pq.push({0, {sx, sy}});
while(!pq.empty()) {
int a=pq.top().second.first, b=pq.top().second.second, w=-pq.top().first; pq.pop();
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) {
if(grid[x][y]=='#'||d[x][y]<d[a][b]+1) continue;
d[x][y]=d[a][b]+1; pq.push({-d[x][y], {x, y}});
}
}
int p=1000000000; vector<pair<int, int>>to;
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++;
}
p=min(p, k); to.push_back({x, y});
}
for(auto u:to) {
int x=u.first, y=u.second;
if(d[x][y]>d[a][b]+p) {
d[x][y]=d[a][b]+p; pq.push({-d[x][y], {x, y}});
}
}
}
cout<<d[ex][ey]<<'\n';
}
int32_t main()
{
int t; t=1;
while(t--) {
solve();
}
return 0;
}
컴파일 시 표준 에러 (stderr) 메시지
portals.cpp: In function 'void solve()':
portals.cpp:24:64: warning: unused variable 'w' [-Wunused-variable]
24 | int a=pq.top().second.first, b=pq.top().second.second, w=-pq.top().first; pq.pop();
| ^
portals.cpp:47:22: warning: 'ex' may be used uninitialized in this function [-Wmaybe-uninitialized]
47 | cout<<d[ex][ey]<<'\n';
| ^~~~
portals.cpp:47:22: warning: 'ey' may be used uninitialized in this function [-Wmaybe-uninitialized]
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |