# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
103851 | E869120 | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 1094 ms | 235364 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 <vector>
#include <map>
#include <queue>
using namespace std;
const int MAX_N = 300000;
vector<pair<int, int>>X[30009];
int N, M, B[30009], P[30009], dist[30009];
queue<int>Q[MAX_N];
int main() {
cin >> N >> M;
for (int i = 0; i < M; i++) cin >> B[i] >> P[i];
for (int i = 0; i < M; i++) {
for (int j = 0; j < M; j++) {
if (i == j) continue;
if (abs(B[j] - B[i]) % P[i] == 0) X[i].push_back(make_pair(j, abs(B[j] - B[i]) / P[i]));
}
}
for (int i = 0; i < M; i++) dist[i] = (1 << 30);
dist[0] = 0; Q[0].push(0);
for (int i = 0; i < MAX_N - 1; i++) {
if (Q[i].empty()) continue;
while (!Q[i].empty()) {
int pos = Q[i].front(); Q[i].pop();
for (int j = 0; j < X[pos].size(); j++) {
int to = X[pos][j].first, cost = X[pos][j].second;
if (dist[to] > dist[pos] + cost) {
dist[to] = dist[pos] + cost;
Q[dist[to]].push(to);
}
}
}
}
if (dist[1] == (1 << 30)) cout << "-1" << endl;
else cout << dist[1] << endl;
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... |