# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1072876 | PenguinsAreCute | Building Skyscrapers (CEOI19_skyscrapers) | C++17 | 250 ms | 19652 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;
using i2 = pair<int,int>;
using vi = vector<int>;
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define all(v) begin(v),end(v)
#define sz(v) int(v.size())
vector<int> perm;
bitset<150005> vis;
vector<int> adj[150005];
void bfs(int x, vector<int> &r, vector<int> &c) {
vis[x]=1;
priority_queue<vi,vector<vi>,greater<vi>> pq;
for(pq.push({r[x],c[x],x});pq.size();) {
int y = pq.top()[2]; pq.pop();
perm.push_back(y);
for(auto z: adj[y]) if(!vis[z]) {
vis[z]=1;
pq.push({r[z],c[z],z});
}
}
}
struct block {int x, y, i;};
vector<int> build_skyscrapers(int t, vector<int> r, vector<int> c) {
int n = r.size();
block lst[n];
for(int i=0;i<n;i++) lst[i]={r[i],c[i],i};
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... |