# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
941081 | KaleemRazaSyed | Portals (BOI14_portals) | C++17 | 28 ms | 69980 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<iostream>
#include<vector>
#include<queue>
using namespace std;
const int N = 1e3 + 5;
char grid[N][N];
int left_[N][N], right_[N][N], up[N][N], down[N][N];
vector<int> G[N * N], port[N * N];
int dist[N * N];
int r, c, m;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
bool valid(int x, int y)
{
return (x > 0 && y > 0 && x <= r && y <= c && grid[x][y] != '#');
}
void bfs(int v, int u)
{
for(int i = 0; i < N * N; i++)
dist[i] = N * N + 10;
queue<int> q;
vector<int> portals;
q.push(v);
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... |