제출 #885575

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
885575		seriouslyFlawed	Rabbit Carrot (LMIO19_triusis)	C++17	14 / 100	1099 ms	62524 KiB

triusis

#include <bits/stdc++.h>

using namespace std;

// Shortcuts for common operations
#define pb push_back
#define ppb pop_back
#define f first
#define s second
#define all(x) (x).begin(), (x).end()
#define ll long long
#define endl "\n"

// Type definitions for convenience
typedef vector<ll> vi;
typedef vector<bool> vb;
typedef pair<ll, ll> pii;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef unordered_set<int> usi;
typedef unordered_map<int, int> umii;

// Debugging macros
#define debug(x) cerr << #x << " = " << (x) << '\n'
#define debug_vector(v) _debug_vector(#v, v)
template<typename T>
void _debug_vector(const string& name, const vector<T>& a) {
    cerr << name << " = [ ";
    for(const auto &x : a) cerr << x << ' ';
    cerr << "]\n";
}

// I/O redirection for local testing
#define iofile(io) \
        freopen((io + ".in").c_str(), "r", stdin); \
        freopen((io + ".out").c_str(), "w", stdout);

// delta for floodfill
vi dx = {0, 1, 0, -1};
vi dy = {1, 0, -1, 0};

// extended deltas for floodfill
vi edx = {0, 1, 0, -1, 1, 1, -1, -1};
vi edy = {1, 0, -1, 0, 1, -1, 1, -1};

// Common outputs
void yes() { cout << "YES" << '\n'; }
void no() { cout << "NO" << '\n'; }

#define int ll
// cin.tie(0)->sync_with_stdio(0);
int n, k;  
vector<int>tab;

map<pii, int>dp;

int fx2(int i, int h){
    if(i == n) return 0;
    if(dp.count({i, h})) return dp[{i, h}];

    dp[{i, h}] = INT_MAX;
    if(tab[i] <= (h + k) or tab[i] <= h) dp[{i, h}] = fx2(i+1, tab[i]);
    dp[{i, h}] = min(dp[{i, h}], 1 + fx2(i+1, h + k));
    return dp[{i, h}];
}

void fx() {
    // Functionality for fx
    cin >> n >> k;
    tab.assign(n, 0);
    for(auto &i: tab) cin >> i;

    cout << fx2(0, 0) << endl;

}

signed main() {
    // Uncomment the following lines for file I/O
    // iofile(string("hello"));
    
    // Uncomment the following lines for multiple test cases
    // int t; cin >> t;
    // while(t--) fx();
    
    // Single test case
    fx();
    
    return 0;
}

• Subtask 1: 14 / 14
• Subtask 2: 0 / 21
• Subtask 3: 0 / 28
• Subtask 4: 0 / 37