# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1172344 | nolqf | Tracks in the Snow (BOI13_tracks) | C++20 | 427 ms | 117400 KiB |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
using namespace std;
using ll = long long;
const int MAXN = 4e3;
const int INF = 2e9;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
string T[1 + MAXN];
int dist[1 + MAXN][1 + MAXN];
int n, m;
bool out( int i, int j ) {
return 1 > i || 1 > j || n < i || m < j;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
for ( int i = 1; i <= n; ++i ) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |