# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1165528 | goulthen | Tracks in the Snow (BOI13_tracks) | C++20 | 805 ms | 430164 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define pb push_back
#define rep(i,a,b) for (int i = a; i <= b; ++i)
#define all(v) (v).begin(), (v).end()
const int MAXN = 4e3 + 10;
const int INF = 1e18;
const int MOD = 1e9 + 7;
int a[MAXN][MAXN], dist[MAXN][MAXN], seen[MAXN][MAXN];
int dx[] = {0,1,0,-1};
int dy[] = {1,0,-1,0};
void solve() {
int n,m;
cin >> n >> m;
rep(i,1,n) {
rep(j,1,m) {
char ch;cin >> ch;
a[i][j] = (ch == 'F' ? 1LL : ch == 'R' ? 2 : 0);
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |