# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1176741 | julia_08 | Tracks in the Snow (BOI13_tracks) | C++20 | 711 ms | 174248 KiB |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 4e3 + 10;
char a[MAXN][MAXN];
int dist[MAXN][MAXN], marc[MAXN][MAXN];
int dx[] = {0, 0, 1, -1}, dy[] = {1, -1, 0, 0};
int n, m;
bool check(int i, int j){
return i > 0 && j > 0 && i <= n && j <= m && (a[i][j] != '.');
}
int main(){
cin.tie(0)->sync_with_stdio(0);
cin >> n >> m;
for(int i=1; i<=n; i++){
for(int j=1; j<=m; j++){
cin >> a[i][j];
}
}
int ans = 0;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |