# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1135214 | sergiomoncadamc | Tracks in the Snow (BOI13_tracks) | C++20 | 1664 ms | 167548 KiB |
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
using ll = long long;
using ld = long double;
#define pb push_back
#define sz size()
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
const int maxn = 4002, inf = 2e7;
char maze[maxn][maxn];
int d[maxn][maxn];
vector<pii> movements(4);
struct comp{
bool operator() (piii a, piii b){
return a.first > b.first;
}
};
void initializeMovements(){
movements[0] = {0, -1};
movements[1] = {0, 1};
movements[2] = {-1, 0};
movements[3] = {1, 0};
}
void BFS(int n, int m){
priority_queue<piii, vector<piii>, comp> pq; pq.push({0, {n-1, m-1}});
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |