| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 366810 | ngpin04 | Tracks in the Snow (BOI13_tracks) | C++14 | 561 ms | 47480 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 fi first
#define se second
#define mp make_pair
using namespace std;
const int N = 4e3 + 5;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
char a[N][N];
int n,m,ans;
bool vis[N][N];
void bfs(int i, int j)
{
queue <pair <int, int>> q;
q.push(mp(i, j));
vis[i][j] = true;
while (q.size())
{
pair <int, int> cur = q.front();
q.pop();
int x = cur.fi;
int y = cur.se;
for (int dir = 0; dir < 4; dir++)
{
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||