| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 31723 | top34051 | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 339 ms | 262144 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 inf 1e9
struct node {
int x,val;
node(int _x = 0,int _val = 0) {
x = _x; val = _val;
}
bool operator < (node a) const {
return a.val<val;
}
};
int n,m,st,ft;
int mem[2005];
vector<pair<int,int> > from[2005];
priority_queue<node> heap;
main() {
int i,x,y,pos,val;
scanf("%d%d",&n,&m);
for(i=0;i<m;i++) {
scanf("%d%d",&pos,&val);
if(i==0) st = pos;
if(i==1) ft = pos;
for(x=0;x<n;x++) if(abs(pos-x)%val==0) from[pos].push_back({x,abs(pos-x)/val});
}
for(i=0;i<n;i++) mem[i] = inf;
mem[st] = 0;
heap.push(node(st,0));
while(!heap.empty()) {
x = heap.top().x; heap.pop();
for(i=0;i<from[x].size();i++) {
y = from[x][i].first; val = from[x][i].second;
if(mem[y] > mem[x] + val) {
mem[y] = mem[x] + val;
heap.push(node(y,mem[y]));
}
}
}
if(mem[ft]==inf) printf("-1");
else printf("%d",mem[ft]);
}
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... | ||||
