제출 #689671

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
689671		zeroesandones	Discharging (NOI20_discharging)	C++17	9 / 100	100 ms	8120 KiB

Discharging

#include "bits/stdc++.h"
using namespace std;

typedef long long ll;
typedef long double ld;
typedef vector<ll> vi;
typedef pair<ll, ll> pi;

#define FOR(i, j, k) for (ll i = j; i < (ll) k; ++i)
#define FORD(i, j, k) for (ll i = j; i >= (ll) k; --i)
#define nl "\n"
#define sp " "

#define all(x) (x).begin(), (x).end()
#define sc second
#define fr first
#define pb emplace_back

// Binary Search, maybe

void solve()
{
    ll n;
    cin >> n;

    ll t[n + 1];
    FOR(i, 1, n + 1)
        cin >> t[i];

    // ll dp[n + 1][n + 1];
    // dp[i][j] = min time taken for the first i customers if they are in j groups

    if(n == 1) {
        cout << t[1] << nl;
        return;
    }

    if(n == 2) {
        ll op1 = t[1] + t[1] + t[2];
        ll op2 = max(t[1], t[2]) * 2;

        cout << min(op1, op2) << nl;
        return;
    }

    ll op1 = max({t[1], t[2], t[3]}) * 3;
    ll op2 = t[1] + (t[1] + max(t[2], t[3])) * 2;
    ll op3 = max(t[1], t[2]) * 2 + (max(t[1], t[2]) + t[3]);
    ll op4 = t[1] + t[1] + t[2] + t[1] + t[2] + t[3];

    cout << min({op1, op2, op3, op4}) << nl;
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    ll t = 1;
    // cin >> t;
    while (t--)
    {
        solve();
    }
}

• Subtask 1: 9 / 9
• Subtask 2: 0 / 13
• Subtask 3: 0 / 25
• Subtask 4: 0 / 11
• Subtask 5: 0 / 14
• Subtask 6: 0 / 28