제출 #413383

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
413383		ocarima	Group Photo (JOI21_ho_t3)	C++14	100 / 100	2246 ms	626204 KiB

Main

#include<bits/stdc++.h>

using namespace std;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define lli long long int
#define vi vector<int>
#define vlli vector<long long int>
#define pii pair<int, int>
#define plli pair<lli, lli>
#define rep(i, a, b) for(lli i = (a); i <= (b); i++)
#define repa(i, a, b) for(lli i = (a); i >= (b); i--)
#define repv(x, v) for(auto x : v)
#define debug(x) cout << #x << " = " << x << endl
#define debugsl(x) cout << #x << " = " << x << ", "
#define debugarr(x, a, b) cout << #x << " = ["; rep(ii, a, b) cout << x[ii] << ", "; cout << "]\n"
#define pb push_back
#define nl "\n"

#define MAX_N 5002
#define INF (1ll << 62)

#define menoresderecha(x, pos) ((x - 1) - menores[x][pos])

lli n, h[MAX_N], dp[MAX_N], pos[MAX_N], mov[MAX_N][MAX_N], c[MAX_N][MAX_N], menores[MAX_N][MAX_N], mayores[MAX_N][MAX_N];

lli costo(lli l, lli r){
    if (l != r){
        return c[l][r] = c[l][r - 1] + mov[l][r] - menoresderecha(r, pos[r]) + menoresderecha(l, pos[r]);
    }

    c[l][r] = mayores[l][pos[l]];
    return c[l][r];
}

int main()
{
    fastio;

    cin >> n;
    rep(i, 1, n){ cin >> h[i]; pos[h[i]] = i; }

    rep(i, 1, n){
        rep(j, 1, n){
            mayores[j][i] = mayores[j][i - 1];
            menores[j][i] = menores[j][i - 1];
        }
        rep(j, h[i] + 1, n) ++menores[j][i];
        repa(j, h[i] - 1, 1) ++mayores[j][i];
    }

    rep(i, 1, n){
        rep(j, i + 1, n){
            mov[i][j] = menores[j][pos[j]] - menores[i][pos[j]] + mayores[j][pos[j]];
        }
    }

    rep(i, 1, n){
        dp[i] = INF;
        repa(j, i - 1, 0){
            dp[i] = min(dp[i], dp[j] + costo(j + 1, i));
        }
    }

    cout << dp[n];

    return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 7 / 7
• Subtask 3: 32 / 32
• Subtask 4: 20 / 20
• Subtask 5: 36 / 36