제출 #1184080

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1184080		steveonalex	Roses (BOI20_roses)	C++20	0 / 100	1 ms	328 KiB

Roses

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()

ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(abs(a), abs(b));}
ll lcm(ll a, ll b){return abs(a) / gcd(a, b) * abs(b);}

ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ull mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}

mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}

template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }

template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }

template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }

template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

void solve(){
    ll n, a, b, c, d; cin >> n >> a >> b >> c >> d;

    ll dih = n / (a * c);
    n %= a * c;
    ll opening_sum = dih * min(a * d, b * c);
    ll ans = 1e18 + 69;
    for(ll i = 0; ; ++i){
        ll rem = n - i * a;
        ll cur = i * b;
        if (rem > 0){
            cur += d * (rem / c);
            if (rem % c) cur += d;
        }

        minimize(ans, cur);
        if (i * a >= n) break;
    }

    cout << opening_sum + ans << "\n";
}

int main(void){
    ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);

    clock_t start = clock();

    solve();

    cerr << "Time elapsed: " << clock() - start << "ms!\n";
    return 0;
}

• Subtask 1: 0 / 20
• Subtask 2: 0 / 80