| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 396685 | leinad2 | Jakarta Skyscrapers (APIO15_skyscraper) | C++17 | 953 ms | 78536 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;
int n, m, i, j, k, A[30010], a, b, w, s, e;
vector<pair<int, int> >adj[30010];
priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > >pq;
main()
{
ios_base::sync_with_stdio(!cin.tie(NULL));
for(cin>>n>>m;i++<m;)
{
cin>>a>>b;if(i==1)s=a;if(i==2)e=a;
for(j=a+b;j<=n;j+=b)adj[a].push_back({j, (j-a)/b});
for(j=a-b;j>0;j-=b)adj[a].push_back({j, (a-j)/b});
}
for(i=0;i<n;i++)A[i]=1e9;
pq.push({0, s});
while(pq.size())
{
pair<int, int>p=pq.top();pq.pop();
a=p.second;b=p.first;
if(A[a]<1e9)continue;
A[a]=b;
for(i=0;i<adj[a].size();i++)
{
pq.push({A[a]+adj[a][i].second, adj[a][i].first});
}
}
if(A[e]==1e9)A[e]=-1;cout<<A[e];
}
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... | ||||
