#743685 (C++17) No.1867 Partitions and Inversions

提出ソース

結果

問題	No.1867 Partitions and Inversions
ユーザー	heno239
提出日時	2022-03-04 23:41:03
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	4,731 ms / 5,000 ms
コード長	6,393 bytes
コンパイル時間	2,135 ms
コンパイル使用メモリ	159,204 KB
実行使用メモリ	38,892 KB
最終ジャッジ日時	2023-09-26 02:52:56
合計ジャッジ時間	30,717 ms
ジャッジサーバーID （参考情報）	judge15 / judge12

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 4,380 KB
testcase_01	AC	1 ms 4,380 KB
testcase_02	AC	4,552 ms 38,560 KB
testcase_03	AC	4,533 ms 38,772 KB
testcase_04	AC	4,677 ms 38,592 KB
testcase_05	AC	4,671 ms 38,628 KB
testcase_06	AC	4,572 ms 38,580 KB
testcase_07	AC	4,564 ms 38,556 KB
testcase_08	AC	4,668 ms 38,760 KB
testcase_09	AC	4,525 ms 38,892 KB
testcase_10	AC	4,533 ms 38,560 KB
testcase_11	AC	4,731 ms 38,880 KB
testcase_12	AC	4,594 ms 38,596 KB
testcase_13	AC	4,532 ms 38,728 KB
testcase_14	AC	4,664 ms 38,712 KB
testcase_15	AC	4,649 ms 38,564 KB
testcase_16	AC	4,517 ms 38,556 KB
testcase_17	AC	4,627 ms 38,884 KB
testcase_18	AC	4,580 ms 38,872 KB
testcase_19	AC	4,662 ms 38,536 KB
testcase_20	AC	4,600 ms 38,868 KB
testcase_21	AC	4,515 ms 38,636 KB
testcase_22	AC	4,574 ms 38,560 KB
testcase_23	AC	4,545 ms 38,844 KB
testcase_24	AC	4,650 ms 38,828 KB
testcase_25	AC	4,600 ms 38,768 KB
testcase_26	AC	4,562 ms 38,768 KB
testcase_27	AC	4,659 ms 38,724 KB
testcase_28	AC	4,598 ms 38,864 KB
testcase_29	AC	4,710 ms 38,772 KB
testcase_30	AC	4,716 ms 38,876 KB
testcase_31	AC	4,685 ms 38,560 KB
testcase_32	AC	1 ms 4,376 KB
testcase_33	AC	2 ms 4,380 KB
testcase_34	AC	2 ms 4,380 KB
testcase_35	AC	2 ms 4,376 KB
testcase_36	AC	2 ms 4,380 KB
testcase_37	AC	2 ms 4,380 KB
testcase_38	AC	67 ms 8,564 KB
testcase_39	AC	67 ms 8,772 KB
testcase_40	AC	68 ms 8,484 KB
testcase_41	AC	66 ms 8,564 KB
testcase_42	AC	65 ms 8,560 KB
testcase_43	AC	1,726 ms 28,332 KB
testcase_44	AC	1,766 ms 28,248 KB
testcase_45	AC	1,730 ms 28,336 KB
testcase_46	AC	1,740 ms 28,180 KB
testcase_47	AC	1,770 ms 28,056 KB
testcase_48	AC	1,679 ms 28,244 KB
testcase_49	AC	1,756 ms 28,252 KB
testcase_50	AC	1,754 ms 28,028 KB
testcase_51	AC	1,797 ms 28,036 KB
testcase_52	AC	1,774 ms 28,360 KB
testcase_53	AC	1,756 ms 28,348 KB
testcase_54	AC	1,775 ms 28,352 KB
testcase_55	AC	1,802 ms 28,312 KB
testcase_56	AC	1,748 ms 28,244 KB
testcase_57	AC	1,769 ms 28,180 KB
testcase_58	AC	1,791 ms 28,356 KB
testcase_59	AC	1,767 ms 28,036 KB
testcase_60	AC	1,775 ms 28,040 KB
testcase_61	AC	1,742 ms 28,200 KB
testcase_62	AC	1,784 ms 28,096 KB
testcase_63	AC	3,081 ms 38,876 KB
testcase_64	AC	2 ms 4,384 KB
testcase_65	AC	1 ms 4,380 KB
testcase_66	AC	1 ms 4,384 KB
testcase_67	AC	3,091 ms 38,840 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 998244353;
//constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;

template<typename T>
void chmin(T& a, T b) {
	a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
	a = max(a, b);
}
template<typename T>
void cinarray(vector<T>& v) {
	rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
	rep(i, v.size()) {
		if (i > 0)cout << " "; cout << v[i];
	}
	cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	//if (x == 0)return 0;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	int n;
	modint() :n(0) { ; }
	modint(ll m) {
		if (m < 0 || mod <= m) {
			m %= mod; if (m < 0)m += mod;
		}
		n = m;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 2;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	a = abs(a); b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-8;
const ld pi = acosl(-1.0);
template<typename T>
void addv(vector<T>& v, int loc, T val) {
	if (loc >= v.size())v.resize(loc + 1, 0);
	v[loc] += val;
}
/*const int mn = 100005;
bool isp[mn];
vector<int> ps;
void init() {
	fill(isp + 2, isp + mn, true);
	for (int i = 2; i < mn; i++) {
		if (!isp[i])continue;
		ps.push_back(i);
		for (int j = 2 * i; j < mn; j += i) {
			isp[j] = false;
		}
	}
}*/

//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	if (res == st.begin())return st.end();
	res--; return res;
}

//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	return res;
}
using mP = pair<modint, modint>;


int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };
//-----------------------------------------

template<typename T>
struct BIT {
private:
	vector<T> node; int n;
public:
	BIT(int n_) {
		n = n_; node.resize(n, 0);
	}
	//0-indexed
	void add(int a, T w) {
		for (int i = a; i < n; i |= i + 1)node[i] += w;
	}
	//[0,a)
	T sum(int a) {
		T ret = 0;
		for (int i = a - 1; i >= 0; i = (i & (i + 1)) - 1)ret += node[i];
		return ret;
	}
	//[a,b)
	T sum(int a, int b) {
		return sum(b) - sum(a);
	}
};

int cost[3005][3005];

void solve() {
	int n; cin >> n;
	vector<int> p(n);
	rep(i, n)cin >> p[i];
	rep(i, n) {
		BIT<int> bt(n + 1);
		int cur = 0;
		Rep(j, i, n) {
			cur += bt.sum(p[j], n + 1);
			bt.add(p[j], 1);
			cost[i][j + 1] = cur;
		}
	}
	vector<int> ans;
	vector<int> dp(n + 1, 0);
	for (int c = 1; c <= n; c++) {
		//cout << "? " << c << "\n";
		//coutarray(dp);
		auto calc = [&](int i, int j) {
			int le = j;
			int ri = n + 1;
			while (ri - le > 1) {
				int mid = (le + ri) / 2;
				int c1 = dp[i] + cost[i][mid];
				int c2 = dp[j] + cost[j][mid];
				if (c1 >= c2) {
					ri = mid;
				}
				else {
					le = mid;
				}
			}
			return ri;
		};
		vector<int> ndp(n + 1, 0);
		set<int> st;
		vector<vector<int>> er(n + 2);
		rep(i, n + 1) {
			//erase nonvalid
			while (er[i].size()) {
				int id = er[i].back(); er[i].pop_back();
				if (st.count(id)) {
					st.erase(id);
					auto itrpre = prev_itr(st, id);
					auto itrnex = next_itr(st, id);
					if (itrpre != st.end() && itrnex != st.end()) {
						int le = *itrpre;
						int ri = *itrnex;
						int loc = calc(le, ri);
						chmax(loc, i);
						er[loc].push_back(ri);
					}
				}
			}
			//answer
			if (st.empty())ndp[i] = -mod;
			else {
				int id = *--st.end();
				ndp[i] = dp[id] + cost[id][i];
			}
			//add
			st.insert(i);
			auto itrpre = prev_itr(st, i);
			if (itrpre != st.end()) {
				int le = *itrpre;
				int ri = i;
				er[calc(le, ri)].push_back(ri);
			}
		}
		swap(dp, ndp);
		ans.push_back(dp[n]);
	}
	rep(i, ans.size()) {
		cout << cost[0][n] - ans[i] << "\n";
	}
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init_f();
	//init();
	//while(true)
	//useexpr();
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}

yukicoder

結果

テストケース

ソースコード