oj.uz

답안 #826648

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
826648 2023-08-15T18:59:38 Z jmyszka2007 Collecting Stamps 3 (JOI20_ho_t3) C++17
0 / 100
 1 ms 468 KB 
#include <bits/stdc++.h>
#include <fstream>
using namespace std;
template<class A, class B>
ostream& operator<<(ostream& o, const pair<A, B>& p) {return o << '(' << p.first << ", " << p.second << ')';}
template<size_t Index = 0, typename... Types>
ostream& printTupleElements(ostream& o, const tuple<Types...>& t) {if constexpr (Index < sizeof...(Types)){if(Index > 0){o << ", ";}o << get<Index>(t);printTupleElements<Index + 1>(o, t);}return o;}
template<typename... Types>
ostream& operator<<(ostream& o, const tuple<Types...>& t){o << "(";printTupleElements(o, t);return o << ")";}
template<class T>
auto operator<<(ostream& o, const T& x) -> decltype(x.end(), o){o << '{';bool first = true;for (const auto& e : x){if (!first){o << ", ";}o << e;first = false;} return o << '}';}
//#define DEBUG
#ifdef DEBUG
#define fastio()
#define debug(x...) cerr << "[" #x "]: ", [](auto... $) {((cerr << $ << "; "), ...); }(x), cerr << '\n'
#define check(x) if (!(x)) { cerr << "Check failed: " << #x << " in line " << __LINE__ << endl; exit(1); }
#else
#define fastio() ios_base::sync_with_stdio(0); cin.tie(0);
#define debug(...)
#define check(x) 
#endif
typedef long long ll;
#define pi pair<int, int>
#define pl pair<ll, ll>
#define st first
#define nd second
#define vi vector<int>
#define vll vector<ll>
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
ll get_sum(vector<vll>sum, int x, int l, int r) {
	if(l > r) {
		return 0ll;
	}
	return sum[x][r] - sum[x][l - 1];
}
ll get_sum2(vll sum, int l, int r) {
	if(l > r) {
		return 0ll;
	}
	return sum[r] - sum[l - 1];
}
void solve() {
	//ifstream cin("nazwa.in");
	//ofstream cout("nazwa.out");
	int n;
	cin >> n;
	vi tab(n + 1), pos(n + 1);
	for(int i = 1; i <= n; i++) {
		cin >> tab[i];
		pos[tab[i]] = i;
	}
	vector<vll>rgt1(n + 1, vll(n + 1, 0));
	vector<vll>rgt2(n + 1, vll(n + 1, 0));
	vector<vll>sum1(n + 1, vll(n + 1, 0));
	vector<vll>sum2(n + 1, vll(n + 1, 0));
	vll sum3(n + 1, 0);
	for(int i = 1; i <= n; i++) {
		for(int j = i; j <= n; j++) {
			rgt1[i][tab[j]]++;
			if(tab[j] > tab[i]) {
				rgt2[i][tab[j]]++;
			}
		}
		for(int j = 1; j <= n; j++) {
			rgt1[i][j] += rgt1[i][j - 1];
			sum1[j][tab[i]] += rgt1[i][j];
		}
		for(int j = tab[i] + 1; j <= n; j++) {
			rgt2[i][j] += rgt2[i][j - 1];
			sum2[j][tab[i]] += rgt2[i][j];
		}
		debug(rgt2[i]);
		sum3[tab[i]] += i;
	}
	debug(sum2[n]);
	for(int j = 1; j <= n; j++) {
		for(int i = 1; i <= n; i++) {
			sum1[j][i] += sum1[j][i - 1];
			sum2[j][i] += sum2[j][i - 1];
		}
		sum3[j] += sum3[j - 1];
	}
	vll dp(n + 1, 1e18);
	dp[0] = 0;
	for(int i = 1; i <= n; i++) {
		for(int j = i; j >= 1; j--) {
			dp[i] = min(dp[i], dp[j - 1] + get_sum(sum1, j - 1, j, i) + get_sum(sum2, i, j, i) + get_sum2(sum3, j, i) - ((ll)(i + 1 - j) * (ll)(j + i) / 2));
		}
	}
	debug(dp);
	cout << dp[n] << '\n';
}
int main() {
	fastio();
	int t;
	//cin >> t;
	t = 1;	
	while(t--) {
		solve();
	}
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 468 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 468 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 468 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #4
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 468 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -