| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 541933 | farhan132 | Jakarta Skyscrapers (APIO15_skyscraper) | C++17 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
/***Farhan132***/
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
//#pragma GCC optimization ("unroll-loops")
//#pragma GCC optimize("Ofast,fast-math")
#include <bits/stdc++.h>
using namespace std;
typedef short ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<ll> vll;
typedef pair<ll , ll> ii;
typedef vector< ii > vii;
typedef pair < pair < ll , ll > , pair < ll , ll > > cm;
typedef tuple < int, ll, ll > tp;
#define ff first
#define ss second
#define pb push_back
#define in insert
#define f0(b) for(int i=0;i<(b);i++)
#define f00(b) for(int j=0;j<(b);j++)
#define f1(b) for(int i=1;i<=(b);i++)
#define f11(b) for(int j=1;j<=(b);j++)
#define f2(a,b) for(int i=(a);i<=(b);i++)
#define f22(a,b) for(int j=(a);j<=(b);j++)
#define sf(a) scanf("%lld",&a)
#define sff(a,b) scanf("%lld %lld", &a , &b)
#define pf(a) printf("%lld\n",a)
#define pff(a,b) printf("%lld %lld\n", a , b)
#define bug printf("**!\n")
#define mem(a , b) memset(a, b ,sizeof(a))
#define front_zero(n) __builtin_clzll(n)
#define back_zero(n) __builtin_ctzll(n)
#define total_one(n) __builtin_popcount(n)
#define clean fflush(stdout)
//const ll mod = (ll) 998244353;
const ll mod = (ll) 1e9 + 7;
const ll maxn = (ll)1e8 + 5;
const int nnn = 1048590;
const int inf = numeric_limits<int>::max()-1;
//const ll INF = numeric_limits<ll>::max()-1;
const ll INF = (ll)1e18;
ll dx[]={0,1,0,-1};
ll dy[]={1,0,-1,0};
ll dxx[]={0,1,0,-1,1,1,-1,-1};
ll dyy[]={1,0,-1,0,1,-1,1,-1};
bool USACO = 0;
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const ll N = 3e4 + 5;
vector < ll > g[N];
vector < int > dp[N];
vector < ll > car[N];
const ll M = 2001;
ll mp[N][M];
void solve(){
ll n , m;
cin >> n >> m;
ll a , b;
vector < ii > v;
for(ll i = 0; i < m; i++){
ll x , p; cin >> x >> p;
g[x].pb(p);
if(i == 0) a = x;
if(i == 1) b = x;
v.pb({p , x % p});
}
sort(v.begin(), v.end());
v.erase(unique(v.begin(), v.end()) , v.end());
car[a].pb(0);
for(auto [c , j] : v){
for(ll i = j; i < n; i += c){
car[i].pb(c);
if(c < M) mp[i][c] = car[i].size() - 1;
}
}
for(ll i = 0; i < n; i++){
dp[i].resize(car[i].size(), -1);
}
queue < tp > p;
p.push({0, a, 0});
dp[a][0] = 0;
while(p.size()){
auto [cost , pos , extra] = p.front(); p.pop();
g[pos].pb(car[pos][extra]);
if(pos == b){
cout << cost << '\n';
return;
}
for(auto u : g[pos]){
if(!u) continue;
if(pos - u >= 0){
ll c1 = pos - u;
ll c2 = (u < M ? mp[c1][u] : lower_bound(car[c1].begin(), car[c1].end(), u) - car[c1].begin()) ;
if(dp[c1][c2] == -1){
dp[c1][c2] = cost + 1;
p.push({cost + 1, c1 , c2});
}
}
if(pos + u < n){
ll c1 = pos + u;
ll c2 = (u < M ? mp[c1][u] : lower_bound(car[c1].begin(), car[c1].end(), u) - car[c1].begin()) ;
if(dp[c1][c2] == -1){
dp[c1][c2] = cost + 1;
p.push({cost + 1, c1 , c2});
}
}
}
g[pos].pop_back();
}
cout << "-1\n";
return;
}
int main() {
#ifdef LOCAL
freopen("in", "r", stdin);
freopen("out", "w", stdout);
auto start_time = clock();
#else
ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
#endif
//pre();
ll T = 1, CT = 0; // cin >> T;
while(T--){
// cout << "Case #" << ++CT <<": " ;
solve();
}
#ifdef LOCAL
auto end_time = clock();
cerr<< "Execution time: "<<(end_time - start_time)*(int)1e3/CLOCKS_PER_SEC<<" ms\n";
#endif
return 0;
}/***Farhan132***/
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
//#pragma GCC optimization ("unroll-loops")
//#pragma GCC optimize("Ofast,fast-math")
#include <bits/stdc++.h>
using namespace std;
typedef short ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<ll> vll;
typedef pair<ll , ll> ii;
typedef vector< ii > vii;
typedef pair < pair < ll , ll > , pair < ll , ll > > cm;
typedef tuple < int, ll, ll > tp;
#define ff first
#define ss second
#define pb push_back
#define in insert
#define f0(b) for(int i=0;i<(b);i++)
#define f00(b) for(int j=0;j<(b);j++)
#define f1(b) for(int i=1;i<=(b);i++)
#define f11(b) for(int j=1;j<=(b);j++)
#define f2(a,b) for(int i=(a);i<=(b);i++)
#define f22(a,b) for(int j=(a);j<=(b);j++)
#define sf(a) scanf("%lld",&a)
#define sff(a,b) scanf("%lld %lld", &a , &b)
#define pf(a) printf("%lld\n",a)
#define pff(a,b) printf("%lld %lld\n", a , b)
#define bug printf("**!\n")
#define mem(a , b) memset(a, b ,sizeof(a))
#define front_zero(n) __builtin_clzll(n)
#define back_zero(n) __builtin_ctzll(n)
#define total_one(n) __builtin_popcount(n)
#define clean fflush(stdout)
//const ll mod = (ll) 998244353;
const ll mod = (ll) 1e9 + 7;
const ll maxn = (ll)1e8 + 5;
const int nnn = 1048590;
const int inf = numeric_limits<int>::max()-1;
//const ll INF = numeric_limits<ll>::max()-1;
const ll INF = (ll)1e18;
ll dx[]={0,1,0,-1};
ll dy[]={1,0,-1,0};
ll dxx[]={0,1,0,-1,1,1,-1,-1};
ll dyy[]={1,0,-1,0,1,-1,1,-1};
bool USACO = 0;
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const ll N = 3e4 + 5;
vector < ll > g[N];
vector < int > dp[N];
vector < ll > car[N];
const ll M = 2001;
ll mp[N][M];
void solve(){
ll n , m;
cin >> n >> m;
ll a , b;
vector < ii > v;
for(ll i = 0; i < m; i++){
ll x , p; cin >> x >> p;
g[x].pb(p);
if(i == 0) a = x;
if(i == 1) b = x;
v.pb({p , x % p});
}
sort(v.begin(), v.end());
v.erase(unique(v.begin(), v.end()) , v.end());
car[a].pb(0);
for(auto [c , j] : v){
for(ll i = j; i < n; i += c){
car[i].pb(c);
if(c < M) mp[i][c] = car[i].size() - 1;
}
}
for(ll i = 0; i < n; i++){
dp[i].resize(car[i].size(), -1);
}
queue < tp > p;
p.push({0, a, 0});
dp[a][0] = 0;
while(p.size()){
auto [cost , pos , extra] = p.front(); p.pop();
g[pos].pb(car[pos][extra]);
if(pos == b){
cout << cost << '\n';
return;
}
for(auto u : g[pos]){
if(!u) continue;
if(pos - u >= 0){
ll c1 = pos - u;
ll c2 = (u < M ? mp[c1][u] : lower_bound(car[c1].begin(), car[c1].end(), u) - car[c1].begin()) ;
if(dp[c1][c2] == -1){
dp[c1][c2] = cost + 1;
p.push({cost + 1, c1 , c2});
}
}
if(pos + u < n){
ll c1 = pos + u;
ll c2 = (u < M ? mp[c1][u] : lower_bound(car[c1].begin(), car[c1].end(), u) - car[c1].begin()) ;
if(dp[c1][c2] == -1){
dp[c1][c2] = cost + 1;
p.push({cost + 1, c1 , c2});
}
}
}
g[pos].pop_back();
}
cout << "-1\n";
return;
}
int main() {
#ifdef LOCAL
freopen("in", "r", stdin);
freopen("out", "w", stdout);
auto start_time = clock();
#else
ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
#endif
//pre();
ll T = 1, CT = 0; // cin >> T;
while(T--){
// cout << "Case #" << ++CT <<": " ;
solve();
}
#ifdef LOCAL
auto end_time = clock();
cerr<< "Execution time: "<<(end_time - start_time)*(int)1e3/CLOCKS_PER_SEC<<" ms\n";
#endif
return 0;
}