# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
422161 | ioi | Tracks in the Snow (BOI13_tracks) | C++14 | 1643 ms | 122984 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 ;
int h , w ;
char arr[4010][4010];
int dis[4010][4010];
int ans = 0 ;
pair<int , int > cor [] = {{1 , 0} , {-1 , 0} , {0 , 1} , {0 , -1}} ;
void bfs(){
deque<pair<int , int > > d ;
dis[0][0] = 1 ;
d.push_back({0 , 0});
while(d.size()){
auto fr = d.front();
d.pop_front();
ans = max(ans , dis[fr.first][fr.second]);
for(int ii = 0 ; ii < 4 ; ii ++){
int nx = cor[ii].first + fr.first ;
int ny = cor[ii].second + fr.second ;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |