제출 #782722

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
782722		RushB	Liteh and Newfiteh (INOI20_litehfiteh)	C++17	0 / 100	4 ms	468 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++) 
#define int long long
const int64_t INF = 1 << 30;
const int N = 1e5 + 5;
const int LG = 17;
int dp[N][LG][LG], mn[N][LG], a[N], n, lg, cp[N];

int solve(int x) {
        int tx = x, cur = 0, ans = 0;
        FOR(i, 0, LG) if (tx >> i & 1) {
                ans += dp[cur][i][0];
                cur += 1 << i;
        }
        tx = n - x, cur = n;
        FOR(i, 0, LG) if (tx >> i & 1) {
                cur -= 1 << i;
                ans += dp[cur][i][0];
        }
        assert(cur == x);
        return ans;
}

signed main() {
        ios::sync_with_stdio(0), cin.tie(0);
        cin >> n;
        FOR(i, 0, n) cin >> a[i];
        assert(n <= 5);
        
        for (int x = n - 1; x >= 0; x--) {
                mn[x][0] = a[x];
                for (int i = 1; (1 << i) + x <= n; i++)
                        mn[x][i] = min(mn[x][i - 1], mn[x + (1 << (i - 1))][i - 1]);
                FOR(j, 0, LG) {
                        if (a[x] <= j + 1) dp[x][0][j] = (a[x] == j + 1);
                        else dp[x][0][j] = INF;
                }
                for (int i = 1; (1 << i) + x <= n; i++) {
                        FOR(j, 0, LG) {
                                dp[x][i][j] = dp[x][i - 1][j] + dp[x + (1 << (i - 1))][i - 1][j];
                                if (mn[x][i] > j) 
                                        dp[x][i][j] = min(dp[x][i][j], dp[x][i - 1][j + 1] + dp[x + (1 << (i - 1))][i - 1][j + 1] + 1);
                        }
                }
        }
        int ans = INF;
        FOR(i, 0, n) {
                ans = min(ans, solve(i));
        }
        if (ans >= INF) ans = -1;
        cout << ans << '\n';
}
//10:39:29

• Subtask 1: 0 / 30
• Subtask 2: 0 / 70