Submission #6084845

---

Source Code Expand

// {{{
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
// }}}

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;

static constexpr int mod = (int)1e9 + 7;
static constexpr int inf = 100100100;
static constexpr ll linf = 1e18;
static constexpr double eps = 1e-9;
static constexpr double pi = 3.14159265359;

#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rrep(i, n) for (ll i = n; i >= 0; --i)
#define all(c) begin(c), end(c)
#define rall(c) rbegin(c), rend(c)
#define pb push_back
#define ist insert
#define fst first
#define snd second


vector<ll> V;
void dfs(set<ll> s, ll cost, ll& ans) {
    if (s.size() == 5) {
        ans = min(cost, ans);
        return;
    }
    if (cost % 10 != 0) {
        cost = cost / 10 * 10 + 10;
    }
    rep (i, 5) {
        if (!s.count(i)) {
            s.ist(i);
            dfs(s, cost + V[i], ans);
            s.erase(i);
        }
    }
}


int main() {
    // cin.tie(0);
    // ios_base::sync_with_stdio(false);
    rep (i, 5) {
        ll v;
        cin >> v;
        V.pb(v);
    }
    ll ans = linf;
    dfs(set<ll>(), 0, ans);
    cout << ans << endl;
}

Submission Info

Judge Result