Submission #1261143

#	Time	Username	Problem	Language	Result	Execution time	Memory
1261143		yf_yusuf	Jakarta Skyscrapers (APIO15_skyscraper)	C++20	57 / 100	163 ms	327680 KiB

skyscraper

//```//    YF YUSUF
#define YF ios_base::sync_with_stdio(0);cout.setf(ios::fixed);
#define YUSUF cout.precision(0);cout.tie(0);cin.tie(0);
// #include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <queue>
#include <stack>
#include <cassert>
#include <climits>
#include <string>
#include <cstdlib>
#include <random>
#include <ctime>
using namespace std;
#ifdef YF_CHECK
	bool Output=1;
#else
	#pragma GCC optimize ("unroll-loops")
	#pragma GCC optimize ("inline")
	#pragma GCC optimize ("Ofast")
	#pragma GCC optimize ("O3")
	bool Output=0;
#endif
using ll   = int;
using ld   = long double;
using sll  = set <ll>;
using vll  = vector <ll>;
using mll  = map <ll,ll>;
using pll  = pair <ll,ll>;
using vvl  = vector <vll>;
using vpll = vector <pll>;
template<class T>T MIN(T&a,T b){a=min(a,b);return a;}
template<class T>T MAX(T&a,T b){a=max(a,b);return a;}
#define all(a) a.begin(),a.end()
#define sgr v+v+1,(tl+tr)/2+1,tr
#define sgl v+v,tl,(tl+tr)/2
#define pb push_back
#define ins insert
#define S second
#define F first
mt19937_64 MT(time(0));
ll BP(ll a,ll b,ll mod=1e9+7){
	if(b==0)return 1;
	ll q=BP(a,b/2,mod);
	return ((q*q)%mod*(b%2?a:1ll))%mod;
}
ll f(ll x){return x*(x+1)/2;}
ll dup(ll a,ll b){return (a+b-1)/b;}
ll lcm(ll a,ll b){return a/__gcd(a,b)*b;}
ll invf(ll x){return (-1+sqrt(1+8*x))/2;}
const ll  mod=998244353;
	using LL = long long;
	using PLI = pair<LL, int>;
const LL  INF=1e18;
const ll  inf=1e9+7;
const ll  N  =1e6+7;
void YF_MAIN(ll TEST){
	ll n,m;
	cin>>n>>m;
	vpll a(m);
	vvl P(n, vll(n,0));
	vvl open(n+1);
	for(auto &[b, p] : a){
		cin>>b>>p;
		if(p>=n)continue;
		open[b].pb(p);
	}
	for(auto &v : open){
		sort(all(v));
		reverse(all(v));
	}
	ll s=a[0].F,f=a[1].F;
	priority_queue <PLI,vector<PLI>,greater<PLI> > q;
	vector<LL> d(n+1,INF);
	d[s]=0;
	q.push({0,s});
	while(q.size()){
		auto [dist,v] = q.top();
		q.pop();
		if(dist > d[v])continue;
		if(v == f)break;
		for(auto p : open[v]){
			for(int to = v%p; to < n; to+=p){
				LL now = abs(to-v)/p;
				if(d[to] > d[v] + now){
					d[to] = d[v] + now;
					q.push({d[to], to});
				}
			}
		}
	}
	cout<<(d[f]==INF ? -1 : d[f]);
}
bool TECT=0;
bool OUTP=0;
ll lg(ll x){return (x ? 63 - __builtin_clzll(x) : -1);}
const ll SN=2e0 + 7; ll SM[SN];
const ll FN=2e0 + 7; ll FACT[FN], inv[FN], FMOD=inf;
ll PER(ll n,ll k){return FACT[n] *inv[n-k]%FMOD;}
ll CNK(ll n,ll k){return PER(n,k)*inv[k  ]%FMOD;}
void BEFORE(){
	for(ll i=2;i<SN;i++){
		if(SM[i])continue;
		for(ll j=i;j<SN;j+=i)
			MAX(SM[j],i);
	}
	FACT[0]=inv[0]=1;
	for(int i=1;i<FN;i++){
		FACT[i]=FACT[i-1]*i%FMOD;
		if(i<5e5+7)inv[i]=BP(FACT[i],FMOD-2,FMOD);
	}
}
signed main(){
	// freopen(("input.txt"),"r",stdin);freopen(("output.txt"),"w",stdout);
	if(OUTP){YF YUSUF}
	cout<<(0 && Output ? "\nYF_OUTPUT:\n\n" : "");
	int TEST=1;
	if(TECT)
		cin>>TEST;
	BEFORE();
	for(int T=1;T<=TEST;T++){
		// cout<<"Case "<<T<<": ";
		YF_MAIN(T);
		cout<<(T==TEST ? "" : "\n");
	}
	return 0;
} 
//```

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