# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
72740 | 2018-08-26T21:54:18 Z | Pajaraja | Jakarta Skyscrapers (APIO15_skyscraper) | C++17 | 5 ms | 3376 KB |
#include <bits/stdc++.h> #define MAXN 30007 using namespace std; vector<int> g[MAXN],w[MAXN]; set<int> v[MAXN]; bool vi[MAXN]; int dist[MAXN],en; void dijkstra(int s) { priority_queue<pair<int,int> > pq; pq.push(make_pair(0,s)); while(!pq.empty()) { int u=pq.top().second,d=-pq.top().first; pq.pop(); if(vi[u]) continue; dist[u]=d; vi[u]=true; if(u==en) return; for(int i=0;i<g[u].size();i++) if(!vi[g[u][i]]) pq.push(make_pair(-d-w[u][i],g[u][i])); } } /*bool binarna(int l,int r,int k,int val) { if(r<l) return false; int s=(l+r)/2; if(v[k][s]==val) return true; if(val<v[k][s]) return binarna(l,s-1,k,val); return binarna(s+1,r,k,val); }*/ int main() { int n,m,st,t1,t2; scanf("%d%d",&n,&m); scanf("%d%d%d%d",&st,&t1,&en,&t2); v[st].insert(t1); v[en].insert(t2); for(int i=0;i<m-2;i++) { scanf("%d%d",&t1,&t2); v[t1].insert(t2); } for(int i=0;i<n;i++) { for(set<int>::iterator it=v[i].end();it!=v[i].begin();it--) { int t=*it,cur=i+t; while(cur<n) { g[i].push_back(cur); w[i].push_back((cur-i)/t); if(v[cur].find(t)!=v[cur].end()) break; cur+=t; } cur=i-t; while(cur>=0) { g[i].push_back(cur); w[i].push_back((i-cur)/t); if(v[cur].find(t)!=v[cur].end()) break; cur-=t; } } } dijkstra(st); if(!vi[en]) dist[en]=-1; printf("%d",dist[en]); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 4 ms | 3064 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 4 ms | 3176 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 4 ms | 3248 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 4 ms | 3376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 3376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |