# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
31140 | nibnalin | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 1000 ms | 3564 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 <iostream>
#include <cstdio>
#include <vector>
#include <set>
#include <cmath>
using namespace std;
const int inf = int(1e9)+5, maxn = int(3e4)+5;
int B[maxn], P[maxn], D[maxn];
int dist(int x, int y)
{
int ret = abs(B[x]-B[y]);
if(ret%P[x] == 0) return ret/P[x];
else return inf;
}
int main(void)
{
int n, m;
scanf("%d%d", &n, &m);
for(int i = 0;i < m;i++) scanf("%d%d", &B[i], &P[i]), D[i] = inf;
set<pair<int, int>> Q;
D[0] = 0;
Q.insert({0, 0});
while(!Q.empty())
{
pair<int, int> top = *Q.begin();
Q.erase(Q.begin());
//cout << top.second << "\n";
for(int i = 0;i < m;i++)
{
if(i == top.second) continue;
int c = dist(top.second, i);
if(top.first+c < D[i])
{
if(D[i] != inf) Q.erase({D[i], i});
D[i] = top.first+c;
Q.insert({D[i], i});
}
}
}
printf("%d\n", (D[1] >= inf)?-1:D[1]);
}
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... |