# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
101457 | rocketninja7 | Tracks in the Snow (BOI13_tracks) | C++14 | 1643 ms | 88968 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 <cstdio>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
pair<int, int> dir[]={make_pair(0, -1), make_pair(1, 0), make_pair(0, 1), make_pair(-1, 0)};
int main(){
int H, W;
scanf("%d%d", &H, &W);
char grid[H][W+1];
for(int i=0;i<H;i++){
scanf("%s", &grid[i]);
}
int dist[H][W];
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
dist[i][j]=-1;
}
}
dist[0][0]=1;
queue<pair<int, int> > procA;
queue<pair<int, int> > procB;
procA.push(make_pair(0, 0));
while(!procA.empty()||!procB.empty()){
while(!procA.empty()){
int x=procA.front().first, y=procA.front().second;
procA.pop();
for(int i=0;i<4;i++){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |