# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
389854 | Alex_tz307 | Tracks in the Snow (BOI13_tracks) | C++17 | 623 ms | 118996 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;
void fastIO() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
}
const int NMAX = 4e3 + 3;
const int di[] = {-1, 0, 1, 0}, dj[] = {0, 1, 0, -1};
int N, M, dp[NMAX][NMAX];
char a[NMAX][NMAX];
bool inside(int lin, int col) {
return lin > 0 && col > 0 && lin <= N && col <= M;
}
void solve() {
cin >> N >> M;
for (int i = 1; i <= N; ++i)
cin >> (a[i] + 1);
dp[1][1] = 1;
deque<pair<int,int>> dq{make_pair(1, 1)};
int ans = 1;
while (!dq.empty()) {
int i, j;
tie(i, j) = dq.front();
dq.pop_front();
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |