# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
420010 | antimirage | Tracks in the Snow (BOI13_tracks) | C++14 | 1380 ms | 168612 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 fr first
#define sc second
#define mk make_pair
#define pb push_back
using namespace std;
const int N = 4005, A[] = {1, -1, 0, 0}, B[] = {0, 0, 1, -1};
int n, m, a[N][N], u[N][N], ans = 1, cur;
deque <pair <int, int> > q;
inline bool check(int x, int y) {
return x >= 1 && x <= n && y >= 1 && y <= m && a[x][y] != 2 && !u[x][y];
}
int main (){
cin >> n >> m;
for (int i = 1; i <= n; i++) {
scanf("\n");
for (int j = 1; j <= m; j++) {
char ch;
scanf("%c", &ch);
switch (ch) {
case 'F':
a[i][j] = 0;
break;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |