# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
941118 | Ghulam_Junaid | 포탈들 (BOI14_portals) | C++17 | 279 ms | 51684 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;
const int N = 1e3 + 10;
const int inf = 1e9 + 10;
int n, m, sx, sy, ex, ey, dist[N][N];
char mat[N][N];
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, 1, 0, -1};
// U R D L
vector<pair<int, int>> walls;
pair<int, int> max_move[N][N][4];
int wall_dist[N][N];
bool valid(int x, int y){
return (x >= 0 and x < n and y >= 0 and y < m and mat[x][y] != '#');
}
void bfs(){
for (int i = 0; i < n; i ++)
for (int j = 0; j < m; j ++)
wall_dist[i][j] = min(min(i + 1, j + 1), min(n - i, m - j));
queue<pair<int, int>> q;
for (auto [x, y] : walls){
wall_dist[x][y] = 0;
q.push({x, y});
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |