# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
226570 | MKopchev | Portals (BOI14_portals) | C++14 | 326 ms | 23224 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>
using namespace std;
const int nmax=1e3+42;
int n,m;
char inp[nmax][nmax];
char get_in()
{
char c=getchar();
while(c!='.'&&c!='#'&&c!='S'&&c!='C')c=getchar();
return c;
}
bool in(int i,int j)
{
return 1<=i&&i<=n&&1<=j&&j<=m;
}
int nxt_left[nmax][nmax],nxt_right[nmax][nmax],nxt_up[nmax][nmax],nxt_down[nmax][nmax];
int dist[nmax][nmax];
priority_queue< pair<int, pair<int,int> > > pq;
int x_move[4]={1,-1,0,0};
int y_move[4]={0,0,1,-1};
int calc_dist(pair<int,int> a,pair<int,int> b)
{
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... |