# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
330580 | minoum | Jakarta Skyscrapers (APIO15_skyscraper) | C++17 | 1087 ms | 3432 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 optimization ("unroll-loops")
using namespace std;
typedef long long int ll;
const int MAXN = 3e4+1, inf = INT_MAX / 2;
int n, m, b[MAXN], p[MAXN], d[MAXN], tmp;
vector <int> ps[MAXN];
priority_queue <pair<int,int>> q;
int main()
{
// ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
// cin >> n >> m;
scanf("%d", &n); scanf("%d", &m);
for(int i = 0; i < m; i++){
// cin >> bb >> pp;
scanf("%d", b+i); scanf("%d", p+i);
ps[b[i]].push_back({p[i]});
}
for(int i = 0; i < n; i++) d[i] = inf;
d[b[0]] = 0;
q.push({0, b[0]});
while(!q.empty()){
int u = q.top().second, dd = -q.top().second; q.pop();
if(d[u] < dd) continue;
// if(u == b[1] || d[u] >= inf) break;
for(int k: ps[u]){
/*for(int i = u % k; i < n; i += k){
tmp = abs(u - i);
if(d[i] > d[u] + (tmp / k)){
d[i] = d[u] + (tmp / k);
q.push({-d[i], i});
}
}*/
for(int i = u % k; i < u; i += k)
if(d[i] > d[u] + (u - i) / k){
d[i] = d[u] + (u - i) / k;
q.push({-d[i], i});
}
for(int i = u + k; i < n; i += k)
if(d[i] > d[u] + (i - u) / k){
d[i] = d[u] + (i - u) / k;
q.push({-d[i], i});
}
}
}
// 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... |