# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
401797 | jli12345 | Tracks in the Snow (BOI13_tracks) | C++14 | 1498 ms | 144792 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;
typedef pair<int, int> pii;
#define f first
#define s second
int N, M;
char arr[4100][4100];
int depth[4100][4100];
struct comp{
bool operator()(const pair<pii, int> &a, const pair<pii, int> &b){
return a.s > b.s;
}
};
int xd[4] = {1, -1, 0, 0};
int yd[4] = {0, 0, 1, -1};
int main(){
cin >> N >> M;
for (int i = 1; i <= N; i++){
for (int j = 1; j <= M; j++){
cin >> arr[i][j];
}
}
deque<pair<pii, int>> dq;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |