# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
635622 | thienbao1602 | Tracks in the Snow (BOI13_tracks) | C++17 | 745 ms | 33604 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 ll long long
#define fi first
#define se second
using namespace std;
const int u[] = {0, 1, 0, -1};
const int v[] = {1 , 0, -1, 0};
const int N = 4055;
int W, H;
char snow[N][N];
bool safe(int u, int v)
{
return (u >= 0 && u < W && v >= 0 && v < H);
}
void solve()
{
cin >> W >> H;
for(int row=0; row<W; row++)
{
for(int col=0; col<H; col++)
{
cin >> snow[row][col];
}
}
queue<pair<int, int>> que[2];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |