제출 #1265292

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1265292		kustov_vadim_533	Group Photo (JOI21_ho_t3)	C++20	100 / 100	1807 ms	624 KiB

Main

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

#define len(v) (int)((v).size())

const int inf = 1e9;
const int sz = 1 << 20;

int tree[sz];

void init(int v, int l, int r){
	tree[v] = 0;
	if (r - l == 1) return;
	int m = (l + r) / 2;
	init(v * 2, l, m);
	init(v * 2 + 1, m, r);
}

void upd(int v, int l, int r, int qi){
	tree[v] += 1;
	if (r - l == 1){
		return;
	}
	int m = (l + r) / 2;
	if (qi < m) upd(v * 2, l, m, qi);
	else upd(v * 2 + 1, m, r, qi);
}

int sum(int v, int l, int r, int ql, int qr){
	if (l >= qr || ql >= r) return 0;
	if (l >= ql && r <= qr) return tree[v];
	int m = (l + r) / 2;
	int r1 = sum(v * 2, l, m, ql, qr);
	int r2 = sum(v * 2 + 1, m, r, ql, qr);
	return r1 + r2;
}

inline void solve(){
	int n;
	cin >> n;
	vector<int> a(n);
	for (int i = 0; i < n; ++i){
		cin >> a[i];
		--a[i];
	}

	vector<ll> dp(n + 1, inf);
	dp[0] = 0;
	for (int i = 0; i < n; ++i){
		vector<int> p;
		for (int j = 0; j < n; ++j){
			if (a[j] >= i){
				p.push_back(a[j]);
			}
		}
		vector<int> q(n);
		for (int j = 0; j < n - i; ++j){
			q[p[j]] = j;
		}

		init(1, 0, n);

		ll res = 0;
		for (int j = i; j < n; ++j){
			res += q[j];
			res -= sum(1, 0, n, q[j], n);
			upd(1, 0, n, q[j]);

			dp[j + 1] = min(dp[j + 1], dp[i] + res);
		}
	}
	cout << dp[n] << '\n';
}

signed main() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	cout.precision(60);

	int t = 1;
//	cin >> t;

	while (t--) {
		solve();
	}
}

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