# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
100121 | TadijaSebez | Jakarta Skyscrapers (APIO15_skyscraper) | C++11 | 894 ms | 6256 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;
#define mp make_pair
#define ll long long
const int N=30050;
const ll inf=1e18;
ll dist[N];
vector<int> jump[N];
int my[N],p[N];
int main()
{
int n,m,i;
scanf("%i %i",&n,&m);
for(i=1;i<=m;i++) scanf("%i %i",&my[i],&p[i]),my[i]++,jump[my[i]].push_back(p[i]);
for(i=1;i<=n;i++) dist[i]=inf;
priority_queue<pair<ll,int>> pq;
pq.push(mp(0,my[1]));
dist[my[1]]=0;
while(pq.size())
{
ll d=-pq.top().first;
int z=pq.top().second;
pq.pop();
if(d!=dist[z]) continue;
for(int j:jump[z])
{
int cnt=1;
for(int i=z+j;i<=n;i+=j)
{
if(dist[i]>dist[z]+cnt)
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... |