Submission #1128842

#	Time	Username	Problem	Language	Result	Execution time	Memory
1128842		belgianbot	Jakarta Skyscrapers (APIO15_skyscraper)	C++20	10 / 100	276 ms	327680 KiB

skyscraper

/*
    AUTHOR : BELGIANBOT
*/

#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;

template<typename T> void read(T& x) { cin >> x;}
template<typename T1, typename T2> void read(pair<T1, T2>& p) { read(p.first), read(p.second);}
template<typename T> void read(vector<T>& v) { for (auto& x : v) read(x); }
template<typename T1, typename T2> void read(T1& x, T2& y) { read(x), read(y); }
template<typename T1, typename T2, typename T3> void read(T1& x, T2& y, T3& z) { read(x), read(y), read(z); }
template<typename T1, typename T2, typename T3, typename T4> void read(T1& x, T2& y, T3& z, T4& zz) { read(x), read(y), read(z), read(zz); }
template<typename T> void print(vector<T>& v) { for (auto& x : v) cout << x << ' '; cout << endl; }

#define pb push_back
#define fi first
#define se second
#define ordered_set tree<pair<int,int>, null_type, less<pair<int,int>>, rb_tree_tag, tree_order_statistics_node_update>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define mp make_pair
#define sz(x) (int)(x.size())
#define YES cout<<"YES\n";
#define Yes cout<<"Yes\n";
#define NO cout<<"NO\n";
#define No cout << "No\n";
#define cmin(a, b) a = min(a, b)
#define cmax(a, b) a = max(a, b)
#define int long long
#define double long double


const int inf = numeric_limits<int>::max() / 4;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1e9+7, LOG=20;

void solve();

signed main() {
   ios::sync_with_stdio(false);
   int t = 1;
   //cin >> t;
   while (t--) solve();
   return 0;
}

vector<vector<int>> memo;
vector<int> b, p;
int n, m;
int dp(int pos, int i) {
    if (i == 1 || b[i] == pos) return dp(pos, i + 1);
    if (pos == b[0]) return 0;
    if (i >= m) return inf;

    if (memo[pos][i] != -1) return memo[pos][i];

    int go = inf;
    if ( abs(b[i] - pos) % p[i] == 0) go = dp(b[i], 0) + abs(b[i] - pos) / p[i];
    int nogo = dp(pos, i+1);

    return memo[pos][i] = min(go, nogo);

}
void solve() {
    cin >> n >> m;
    b.resize(m); p.resize(m); memo.resize(n + 1, vector<int> (m + 1,-1));
    for (int i = 0; i < m; i++) cin >> b[i] >> p[i];

    int ans = dp(b[1], 0);
    cout << (ans >= inf ? -1 : ans) << '\n';
}

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