# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
886002 | noobHeMan | Tracks in the Snow (BOI13_tracks) | C++17 | 408 ms | 130940 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;
#define int int
#define double double
const int INF = INT_MAX-10;
const int NINF = -INF;
const int MOD = 998244353;
int dx[4]{-1, 1, 0, 0}, dy[4]{0, 0, -1, 1};
const int maxH = 4005, maxW = 4005;
string grid[maxH];
int dist[maxH][maxW];
int H, W;
bool inside(int x, int y) {
return x >= 0 && y >= 0 && x < H && y < W && grid[x][y] != '.';
}
int ans = 0;
void solve() {
cin >> H >> W;
for(int i=0; i<H; i++) {
cin >> grid[i];
}
deque<pair<int, int>> dq;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |