# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
446285 | benedict0724 | Building Skyscrapers (CEOI19_skyscrapers) | C++17 | 721 ms | 92476 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 long long ll;
map<pair<int, int>, int> m;
struct node
{
int x, y, i;
node() : node(0, 0, 0) {}
node(int _x, int _y, int _i) : x(_x), y(_y), i(_i) {}
bool operator < (const node &O) const
{
if(x == O.x) return y > O.y;
return x > O.x;
}
} Sky[150002];
int dx[8] = {1, 1, 1, 0, 0, -1, -1, -1};
int dy[8] = {1, 0, -1, 1, -1, 1, 0, -1};
vector<int> adj[150002];
int X[150002], Y[150002];
bool visited[150002];
queue<int> q;
priority_queue<node> pq;
void bfs(int x)
{
visited[x] = true;
pq.push(node(X[x], Y[x], x));
while(!pq.empty())
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |