| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 134083 | fredbr | Tracks in the Snow (BOI13_tracks) | C++17 | 1454 ms | 1048580 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 const maxn = 4010;
int cnt = 0;
int n, m;
char vis[maxn][maxn];
char v[maxn][maxn];
using ii = pair<int, int>;
vector<ii> nxt;
static int const dx[] = {0, 1, 0, -1};
static int const dy[] = {1, 0, -1, 0};
void dfs(int x, int y) {
if (vis[x][y]) return;
if (v[x][y] == '.') return;
vis[x][y] = 1;
cnt--;
for (int i = 0; i < 4; i++) {
int xx = x + dx[i];
int yy = y + dy[i];
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||