# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
407108 | iulia13 | Tracks in the Snow (BOI13_tracks) | C++14 | 954 ms | 131044 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 <iostream>
#include <map>
#include <vector>
#include <deque>
using namespace std;
const int N = 4005;
char a[N][N];
int lvl[N][N];
int ans = 0;
int dL[4] = {0, 1, 0, -1};
int dC[4] = {1, 0, -1, 0};
struct NOD{
int x, y;
};
deque <NOD> dq;
int main()
{
int n, m, i, j;
cin >> n >> m;
for (i = 1; i <= n; i++)
cin >> a[i] + 1;
dq.push_back({1, 1});
lvl[1][1] = 1;
while (!dq.empty())
{
int x = dq.front().x;
int y = dq.front().y;
ans = max(ans, lvl[x][y]);
dq.pop_front();
for (i = 0; i < 4; i++)
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |