# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
21831 | ngkan146 | Portals (BOI14_portals) | C++14 | 279 ms | 30640 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.
#include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
typedef pair<int,int> ii;
int dx[] = {1,0,-1,0};
int dy[] = {0,1,0,-1};
int n,m,xs,ys,xe,ye;
string s[1005];
int block[1005][1005][4];
int d[1005][1005], mini[1005][1005];
priority_queue <ii,vector<ii>,greater<ii> > pq;
int prep(){
iostream::sync_with_stdio(0);
cin >> n >> m;
for(int i=1;i<=n;i++)
cin >> s[i], s[i] = '#' + s[i] + '#';
for(int i=1;i<=m+3;i++)
s[0].push_back('#'), s[n+1].push_back('#');
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++)
if (s[i][j] == 'S') xs = i, ys = j;
else if (s[i][j] == 'C') xe = i, ye = j;
}
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++)
if (s[i][j-1] == '#') block[i][j][3] = j;
else block[i][j][3] = block[i][j-1][3];
for(int j=m;j>=1;j--){
if (s[i][j+1] == '#') block[i][j][1] = j;
Compilation message (stderr)
# | 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... |