# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1164617 | fryingduc | Tracks in the Snow (BOI13_tracks) | C++20 | 557 ms | 151008 KiB |
#include "bits/stdc++.h"
using namespace std;
#ifdef duc_debug
#include "bits/debug.h"
#else
#define debug(...)
#endif
const int movex[] = {1, -1, 0, 0};
const int movey[] = {0, 0, 1, -1};
const int maxn = 4005;
int n, m;
char a[maxn][maxn];
int d[maxn][maxn];
void solve() {
cin >> n >> m;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
cin >> a[i][j];
}
}
deque<tuple<int, int, int>> dq;
dq.emplace_back(1, 1, 1);
memset(d, 0x3f, sizeof(d));
d[1][1] = 1;
while (!dq.empty()) {
auto [dist, x, y] = dq.front();
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |