# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
695142 | Abito | Jakarta Skyscrapers (APIO15_skyscraper) | C++17 | 1094 ms | 71192 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;
#define pb push_back
#define F first
#define S second
#define int long long
const int N=3e4+5;
int a[N],b[N],n,m,dis[N];
vector<pair<int,int>> adj[N];
vector<int> d[N],p[N];
bool vis[N];
priority_queue<pair<int,int>> pq;
void getdiv(int x){
for (int i=1;i*i<=x;i++){
if (x%i) continue;
int y=i,z=x/i;
d[x].pb(y);
if (y!=z) d[x].pb(z);
}sort(d[x].begin(),d[x].end());
return;
}
void dijkstra(){
pq.push({0,a[0]});
while (!pq.empty()){
pair<int,int> x=pq.top();
x.F*=-1;pq.pop();
if (vis[x.S]) continue;
vis[x.S]=true;
for (auto u:adj[x.S]){
if (dis[u.F]<=x.F+u.S) continue;
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... |