| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 678597 | qwerasdfzxcl | Jakarta Skyscrapers (APIO15_skyscraper) | C++17 | 1087 ms | 2088 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>
typedef long long ll;
using namespace std;
constexpr int INF = 1e9+100;
int dist[30030], visited[30030];
vector<int> a[30030];
int main(){
int n, m, s, e;
scanf("%d %d", &n, &m);
for (int i=1;i<=m;i++){
int x, p;
scanf("%d %d", &x, &p);
++x;
a[x].push_back(p);
if (i==1) s = x;
if (i==2) e = x;
}
fill(dist+1, dist+n+1, INF);
fill(visited+1, visited+n+1, 0);
dist[s] = 0;
for (int i=1;i<=n;i++){
sort(a[i].begin(), a[i].end());
a[i].erase(unique(a[i].begin(), a[i].end()), a[i].end());
}
for (int z=1;z<=n;z++){
int mn = INF, idx = -1;
for (int i=1;i<=n;i++) if (!visited[i] && mn > dist[i]){
mn = dist[i];
idx = i;
}
if (idx==-1) break;
visited[idx] = 1;
for (auto &p:a[idx]){
for (int i=idx-p, j=1;i>0;i-=p, j++) dist[i] = min(dist[i], dist[idx] + j);
for (int i=idx+p, j=1;i<=n;i+=p, j++) dist[i] = min(dist[i], dist[idx] + j);
}
}
if (dist[e]==INF) printf("-1\n");
else printf("%d\n", dist[e]);
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... | ||||
