Submission #529543

#	Time	Username	Problem	Language	Result	Execution time	Memory
529543		abc864197532	Group Photo (JOI21_ho_t3)	C++17	64 / 100	5068 ms	98316 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define pb push_back
#define eb emplace_back
#define pii pair<int,int>
#define X first
#define Y second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
void abc() {cout << endl;}
template <typename T, typename ...U> void abc(T i, U ...j) {
	cout << i << ' ', abc(j...);
}
template <typename T> void printv(T l, T r) {
	for (; l != r; ++l) cout << *l << " \n"[l + 1 == r];
}
#ifdef Doludu
#define test(x...) abc("[" + string(#x) + "]", x)
#define owo freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#else
#define test(x...) void(0)
#define owo ios::sync_with_stdio(false), cin.tie(0)
#endif
const int N = 200000;

int main () {
	owo;
	int n;
	cin >> n;
	vector <int> p(n);
	for (int i = 0; i < n; ++i)
		cin >> p[i], --p[i];
	vector <int> dp(n + 1, 1 << 30);
	vector <vector <int>> cost(n + 1, vector <int> (n + 1, 0));
	vector <int> inversion(n);
	for (int r = 1; r <= n; ++r) {
		vector <int> ord;
		for (int i = 0; i < n; ++i) if (p[i] < r)
			ord.pb(p[i]);
		for (int i = 0; i < ord.size(); ++i) {
			inversion[ord[i]] = 0;
			for (int j = 0; j < i; ++j)
				inversion[ord[i]] += ord[j] > ord[i];
		}
		for (int l = r - 1; ~l; --l) {
			int pos = find(all(ord), l) - ord.begin();
			cost[l][r] = cost[l + 1][r] + int(ord.size()) - pos - 1 - inversion[l];
		}
	}
	dp[0] = 0;
	for (int i = 1; i <= n; ++i) {
		for (int j = 0; j < i; ++j) {
			// max at postion j
			dp[i] = min(dp[i], dp[j] + cost[j][i]);
		}
	}
	cout << dp[n] << endl;
}

Compilation message (stderr)

Main.cpp: In function 'int main()':
Main.cpp:41:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |   for (int i = 0; i < ord.size(); ++i) {
      |                   ~~^~~~~~~~~~~~

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