# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
335258 | hivakarami | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 899 ms | 3808 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;
typedef long long int ll;
typedef long double doublel;
#define f first
#define s second
const int N = 3e4 + 100;
const ll mod = 1e9 + 9;
const int inf = 1e8;
int dis[N];
vector<int> adj[N];
priority_queue<pair<int, int>> q;
int main()
{
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int n, m, z, y;
scanf("%d %d", &n, &m);
for(int i = 0; i < m; i++)
{
int p, b;
scanf("%d %d", &b, &p);
adj[b].push_back(p);
if(i == 0)
z = b;
else if(i == 1)
y = b;
}
for(int i = 0; i < n; i++)
dis[i] = inf;
dis[z] = 0;
q.push({0, z});
while(!q.empty())
{
int x = q.top().s;
q.pop();
for(auto p : adj[x])
{
int c = 1;
for(int i = x+p; i < n; i += p)
{
if(dis[i] > dis[x] + c)
{
dis[i] = dis[x] + c;
if(y != i) q.push({-dis[i], i});
}
c++;
}
c = 1;
for(int i = x-p; i >= 0; i -= p)
{
if(dis[i] > dis[x] + c)
{
dis[i] = dis[x] + c;
if(y != i) q.push({-dis[i], i});
}
c++;
}
}
}
if(dis[y] >= inf)
dis[y] = -1;
printf("%d \n", dis[y]);
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... |