# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
928090 | OAleksa | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 1073 ms | 66156 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 f first
#define s second
#define int long long
const int N = 30069;
const int inf = 1e18;
int n, m, a[N], b[N], dis[N];;
vector<int> c[N];
vector<pair<int, int>> g[N];
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int tt = 1;
//cin >> tt;
while (tt--) {
cin >> n >> m;
for (int i = 1;i <= m;i++) {
cin >> a[i] >> b[i], ++a[i];
c[a[i]].push_back(i);
}
for (int i = 1;i <= m;i++) {
for (int j = 1;j <= m;j++) {
if (abs(a[i] - a[j]) % b[i] == 0) {
int d = abs(a[i] - a[j]) / b[i];
g[i].push_back({j, d});
}
}
}
for (int i = 1;i <= m;i++)
dis[i] = inf;
priority_queue<pair<int, int>> q;
q.push({0, 1});
dis[1] = 0;
while (!q.empty()) {
auto v = q.top().s;
q.pop();
for (auto u : g[v]) {
if (dis[u.f] <= dis[v] + u.s)
continue;
dis[u.f] = dis[v] + u.s;
q.push({-dis[u.f], u.f});
}
}
if (dis[2] == inf)
cout << -1 << '\n';
else
cout << dis[2] << '\n';
}
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... |