# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
136618 | Lawliet | Tracks in the Snow (BOI13_tracks) | C++14 | 1668 ms | 144940 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 MAX 4010
using namespace std;
int dx[] = {0 , 0 , 1 , -1};
int dy[] = {1 , -1 , 0 , 0};
int n, m;
int maxDist;
int dist[MAX][MAX];
bool marc[MAX][MAX];
char v[MAX][MAX];
deque<int> dq;
void add(int i, int j, int d, bool t = false)
{
dist[i][j] = d;
marc[i][j] = true;
maxDist = max(maxDist , d);
if(t)
{
dq.push_front(j);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |