# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
328510 | minoum | Jakarta Skyscrapers (APIO15_skyscraper) | C++17 | 1098 ms | 1772 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>
#pragma GCC optimize ("unroll-loops")
using namespace std;
typedef long long int ll;
const int MAXN = 3e4 + 1, inf = INT_MAX / 2;
int n, m, b[2], d[MAXN], sz = 0;
bool wasmn[MAXN];
vector <int> ps[MAXN];
int main()
{
// ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
// cin >> n >> m;
scanf("%d", &n); scanf("%d", &m);
int bb, pp;
for(int i = 0; i < m; i++){
// cin >> bb >> pp;
scanf("%d", &bb); scanf("%d", &pp);
ps[bb].push_back({pp});
if(i == 0) b[0] = bb;
if(i == 1) b[1] = bb;
}
// dij();
for(int i = 0; i <= n; i++) d[i] = inf;
d[b[0]] = 0;
for(int h = 0; h < n; h++){
int mn = inf, u = -1;
for(int i = 0; i < n; i++)
if(!wasmn[i] && d[i] < mn) mn = d[i], u = i;
wasmn[u] = true;
if(u == b[1] || d[u] >= inf) break;
for(int j = 0; j < (int)ps[u].size(); j++){
for(int i = u % ps[u][j]; i < n; i += ps[u][j])
if(d[i] > d[u] + (abs(u - i) / ps[u][j])) d[i] = d[u] + (abs(u - i) / ps[u][j]);
}
}
// cout << ((d[b[1]] >= inf)?-1:d[b[1]]);
if(d[b[1]] >= inf) printf("%d", -1);
else printf("%d", d[b[1]]);
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... |