제출 #1147522

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1147522		Theo830	Jakarta Skyscrapers (APIO15_skyscraper)	C++20	57 / 100	1096 ms	2372 KiB

skyscraper

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9+7;
const ll MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<ii,ll>
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///Training
int main(void){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll n,m;
    cin>>n>>m;
    ll b[m],p[m];
    vector<ll>ex[n];
    f(i,0,m){
        cin>>b[i]>>p[i];
        ex[b[i]].pb(p[i]);
    }
    bool done[n] = {0};
    ll best[n];
    f(i,0,n){
        best[i] = INF;
    }
    best[b[0]] = 0;
    ll ek = n;
    while(ek--){
        ll mini = INF+1;
        ll pos = -1;
        f(i,0,n){
            if(!done[i] && mini > best[i]){
                pos = i;
                mini = best[i];
            }
        }
        done[pos] = 1;
        for(auto x:ex[pos]){
            ll cur = pos;
            ll posa = 0;
            while(cur < n){
                best[cur] = min(best[cur],mini + posa);
                cur += x;
                posa++;
            }
            cur = pos;
            posa = 0;
            while(cur >= 0){
                best[cur] = min(best[cur],mini + posa);
                cur -= x;
                posa++;
            }
        }
    }
    ll ans = best[b[1]];
    if(ans == INF){
        ans = -1;
    }
    cout<<ans<<"\n";
}

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