제출 #1292015

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1292015		yf_yusuf	Jakarta Skyscrapers (APIO15_skyscraper)	C++20	0 / 100	59 ms	94368 KiB

skyscraper

//```//    YF YUSUF
#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 <iomanip>
// #include <ctime>
using namespace std;
#ifdef YF_CHECK
	bool LOCAL = 1;
#else
	#pragma GCC optimize ("unroll-loops")
	#pragma GCC optimize ("inline")
	#pragma GCC optimize ("Ofast")
	#pragma GCC optimize ("O3")
	bool LOCAL = 0;
#endif
using ll   = long long;
using ld   = long double;
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 rall(a) a.rbegin(),a.rend()
#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;}
ll lg(ll x){return (x ? 63 - __builtin_clzll(x) : -1);}
const ll  mod=998244353;
const ll  INF=1e18;
const ll  inf=1e9+7;
const ll  N  =2e6+7;
ll n, m;
vpll a(m);
ll ns;
pll DH(ll h)   {return {h/ns, h%ns};} 
ll H(ll a,ll b){return a * ns + b;}
set<pll> g[N];
void pout(pll a){
	cout<<a.F<<" "<<a.S;
}
bool make_edge(int v, int to, int w = 1){
	bool out = 0;
	bool ret = g[v].count({w, to});
	if(out){
		cout.width(2);
		cout<<v<<" ";
		cout.width(2);
		cout<<to<<" : ";pout(DH(v));cout<<", ";pout(DH(to));
		cout<<"\n"<<w<<" "<<ret;
		cout<<" tov\n";
	}
	if(ret){
		return 0;
	}
	g[v].ins({w, to});
	return 1;
}
void YF_MAIN(ll TEST){
	cin>>n>>m;
	a.resize(m);
	ns = sqrt(n) * 3;
	for(int i=1;i<=n;i++){
		for(int j=1; j<=sqrt(n);j++){
			make_edge(H(i, 0), H(i, j), 0);
			make_edge(H(i, j), H(i, 0), 0);
		}
	}
	for(auto &[b, p] : a){
		cin>>b>>p;
		++b;
		if(p>=n)continue;
		if(p <= sqrt(n)){
			for(int to = b - p; 1 <= to; to -= p){
				if(!make_edge(H(b, p), H(to, p), abs(b - to) / p)){
					// cout<<b<<" "<<to<<" "<<p<<" break\n";
					break;
				}
			}
			for(int to = b + p; to <= n; to += p){
				if(!make_edge(H(b, p), H(to, p), abs(b - to) / p)){
					// cout<<b<<" "<<to<<" "<<p<<" break\n";
					break;
				}
			}
		} else{
			for(int to = b % p; to <= n; to+=p)if(1 <= to){
				make_edge(H(to, 0), H(b, 0), abs(to-b) / p);
			}
		}
	}
	ll s=H(a[0].F, 0), f=H(a[1].F, 0);
	priority_queue <pll,vector<pll>,greater<pll> > q;
	vector<ll> d(H(n, sqrt(n))+1,inf);
	d[s]=0;
	q.push({0,s});
	// cout<<s<<" "<<f<<" sf\n";
	while(q.size()){
		auto [dist,v] = q.top();
		q.pop();
		// pout(DH(v));
		// cout<<", "<<dist<<" ";
		// cout<<v<<" : ";
		for(auto [dto,to] : g[v]){
			if(d[to] > d[v] + dto){
				// cout<<to<<" ";
				d[to]=d[v]+dto;
				q.push({d[to],to});
			}
		}
		// cout<<"\n";
	}
	cout<<d[f];
}
const bool TECT=0;
const bool FLSH=1;
const ll SN=1e0 + 7; ll SM[SN];
const ll FN=1e0 + 7; ll FACT[FN], inv[FN], FMOD=inf;
ll PNK(ll n,ll k){return FACT[n] *inv[n-k]%FMOD;}
ll CNK(ll n,ll k){return PNK(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;
		inv[i]=BP(FACT[i],FMOD-2,FMOD);
	}
}
signed main(){
	// freopen(("input.txt"),"r",stdin);freopen(("output.txt"),"w",stdout);
	if(FLSH){
		ios_base::sync_with_stdio(0);
		cout.setf(ios::fixed);
		cout.precision(0);
		cout.tie(0);
		cin.tie(0);
	}
	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;
} 
//   YF YUSUF ```

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