Submission #317527

#	Time	Username	Problem	Language	Result	Execution time	Memory
317527		zaneyu	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	10 / 100	1 ms	512 KiB

skyscraper

/*input
5 3
0 2
1 1
4 1
*/
//#include "dreaming.h"
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
 
#pragma GCC optimize("unroll-loops,no-stack-protector")
//order_of_key #of elements less than x
// find_by_order kth element
#define ll long long 
#define ld long double
#define pii pair<int,int>
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define MP make_pair
const ll INF64=4e12;
const int INF=0x3f3f3f3f;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
ll mult(ll a,ll b){
    return ((a%MOD)*(b%MOD))%MOD;
}
ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1){
            res=(res*a)%MOD;
        }
        a=(a*a)%MOD;
        b>>=1;
    }
    return res;
}
const ll maxn=1e5+5;
const ll maxlg=__lg(maxn)+2;
int b[maxn],p[maxn],dist[maxn];
int main(){
    ios::sync_with_stdio(false),cin.tie(0);
    int n,m;
    cin>>n>>m;
    REP(i,n){
        cin>>b[i]>>p[i];
    }
    priority_queue<pii,vector<pii>,greater<pii>> pq;
    REP(i,n) dist[i]=INF;
    pq.push({0,0});
    dist[0]=0;
    while(!pq.empty()){
        int z=pq.top().s;
        pq.pop();
        REP(i,m){
            if(abs(b[i]-b[z])%p[z]==0){
                int d=abs(b[i]-b[z])/p[z];
                if(dist[i]>dist[z]+d){
                    dist[i]=dist[z]+d;
                    pq.push({dist[i],i});
                }
            }
        }
    }
    if(dist[1]==INF) cout<<"-1\n";
    else cout<<dist[1]<<'\n';
}   

• Subtask 1: 10 / 10
• Subtask 2: 0 / 12
• Subtask 3: 0 / 14
• Subtask 4: 0 / 21
• Subtask 5: 0 / 43