Submission #689706

#	Time	Username	Problem	Language	Result	Execution time	Memory
689706		saayan007	Discharging (NOI20_discharging)	C++17	9 / 100	93 ms	8120 KiB

Discharging

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

using ll = long long;
using pi = pair<int, int>;
using pl = pair<long long, long long>;
using vi = vector<int>;
using vl = vector<long long>;
using vpi = vector<pair<int, int>>;
using vpl = vector<pair<long long, long long>>;

#define fur(i, a, b) for(ll i = a; i <= (ll)b; ++i)
#define ruf(i, a, b) for(ll i = a; i >= (ll)b; --i)
#define fr first 
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define nl "\n"
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()

const ll inf = 1e18L;

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

    ll n;
    cin >> n;
    ll t[n + 1];
    fur(i, 1, n) {
        cin >> t[i];
    }
    t[0] = 0;

    if(n == 1) {
        cout << t[1] << nl;
    } 
    else if(n == 2) {
        cout << min(2*max(t[1], t[2]), 2*t[1] + t[2]) << nl;
    }
    else if(n == 3) {
        ll ans = inf;
        // 00
        ans = min(ans, 3*max({t[1],t[2],t[3]}));

        //01
        ans = min(ans, 3*max(t[1], t[2]) + t[3]);

        // 10
        ans = min(ans, 3*t[1] + 2*max(t[2], t[3]));

        // 11
        ans = min(ans, 3*t[1] + 2*t[2] + t[3]);

        cout << ans << nl;
    } else {
        ll res = t[n] * n;
        ll x = n;
        ruf(i, n, 2) {
            if(n*t[x] > n*t[i - 1] + t[x] * (n - i + 1)) {
                res = res - n*t[x] + n*t[i - 1] + t[x] * (n - i + 1);
            }
        }
        cout << res << nl;
        return 0;
        // ll x = 1;
        // fur(i, 2, n) {
            // if(t[i] != t[i - 1]) {
                // if(t[n] * (n - x + 1) > t[n] * (n - i + 1) + t[i - 1] * (n - x + 1)) {
                    // res = res - (t[n] * (n - x + 1) - (t[n] * (n - i + 1) + t[i - 1] * (n - x + 1)));
                    // x = i;
                // }         
            // }
        // }
        // cout << res << nl;
    }
}

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