# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
155395 | dantoh000 | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 22 ms | 21496 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 pair<int,int> ii;
unordered_map<int,vector<ii> > adjlist;
int dist[5200000];
vector<int> big[30005];
int n,m;
int k;
int s;
int e;
int main(){
scanf("%d%d",&n,&m);
k = sqrt(n);
for (int i = 0; i < m; i++){
int b,p;
scanf("%d%d",&b,&p);
if (i == 0) s = b;
if (i == 1) e= b;
if (p >= k){
big[b].push_back(p);
}
else{
adjlist[b*k].push_back(ii(b*k+p,0));
adjlist[b*k+p].push_back(ii(b*k,0));
}
}
priority_queue<ii,vector<ii>,greater<ii> > pq;
memset(dist,-1,sizeof(dist));
dist[s*k] = 0;
pq.push(ii(0,s*k));
while (pq.size()){
ii cur = pq.top(); pq.pop();
int d = cur.first, u = cur.second;
if (e*k == d) break;
//printf("%d %d\n",d,u);
if (dist[u] > d) continue;
if (u % k == 0){
for (auto x : big[u/k]){
for (int i = 1; i <= k; i++){
int v = u-(i*x)*k;
if (v >= 0 && (dist[v] == -1 || dist[v] > dist[u]+i)){
dist[v] = dist[u]+i;
pq.push(ii(dist[v],v));
}
v = u+(i*x)*k;
if (v < n*k && (dist[v] == -1 || dist[v] > dist[u]+i)){
dist[v] = dist[u]+i;
pq.push(ii(dist[v],v));
}
}
}
}
for (auto v : adjlist[u]){
//printf("maybe %d %d\n",v.first,v.second);
if (dist[v.first] == -1 || dist[v.first] > dist[u]+v.second){
dist[v.first] = dist[u]+v.second;
pq.push(ii(dist[v.first],v.first));
}
}
}
printf("%d",dist[e*k]);
return 0;
}
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... |