제출 #689653

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
689653		saayan007	Discharging (NOI20_discharging)	C++17	11 / 100	118 ms	17796 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];
    }


    cout << n * t[1] << nl;
    return 0;
    ll dp[n + 1][n + 1];
    fur(i, 0, n) {
        fur(j, 0, n) {
            dp[i][j] = inf;
        }
    }

    fur(i, 1, n) {
        dp[i][0] = t[i] * i;
    }

    fur(j, 1, n - 1) {
        fur(i, 1, n) {
            dp[i][j] = dp[i - 1][j];
        }
    }

    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;
    }
    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;
    }
}

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