#681533 (C++17) No.1621 Sequence Inversions

提出ソース

結果

問題	No.1621 Sequence Inversions
ユーザー	heno239
提出日時	2021-07-22 21:47:59
言語	C++17 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	32 ms / 3,000 ms
コード長	4,082 bytes
コンパイル時間	1,954 ms
コンパイル使用メモリ	151,252 KB
実行使用メモリ	15,844 KB
最終ジャッジ日時	2023-09-24 16:25:52
合計ジャッジ時間	3,521 ms
ジャッジサーバーID （参考情報）	judge14 / judge11

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	8 ms 15,664 KB
testcase_01	AC	9 ms 15,676 KB
testcase_02	AC	8 ms 15,628 KB
testcase_03	AC	8 ms 15,668 KB
testcase_04	AC	8 ms 15,684 KB
testcase_05	AC	9 ms 15,608 KB
testcase_06	AC	9 ms 15,620 KB
testcase_07	AC	9 ms 15,628 KB
testcase_08	AC	20 ms 15,720 KB
testcase_09	AC	13 ms 15,772 KB
testcase_10	AC	13 ms 15,696 KB
testcase_11	AC	20 ms 15,768 KB
testcase_12	AC	26 ms 15,776 KB
testcase_13	AC	30 ms 15,768 KB
testcase_14	AC	31 ms 15,844 KB
testcase_15	AC	31 ms 15,736 KB
testcase_16	AC	25 ms 15,720 KB
testcase_17	AC	31 ms 15,792 KB
testcase_18	AC	24 ms 15,704 KB
testcase_19	AC	9 ms 15,700 KB
testcase_20	AC	13 ms 15,744 KB
testcase_21	AC	32 ms 15,728 KB
testcase_22	AC	32 ms 15,748 KB
testcase_23	AC	32 ms 15,740 KB
testcase_24	AC	8 ms 15,764 KB
testcase_25	AC	9 ms 15,724 KB
testcase_26	AC	8 ms 15,720 KB
testcase_27	AC	8 ms 15,740 KB
testcase_28	AC	8 ms 15,596 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>
using namespace std;

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

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 998244353;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#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;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acosl(-1.0);

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;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n % mod + mod) % mod;
	}
	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 << 18;
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];
}


modint dp[105][10005];
void solve() {
	int n, k; cin >> n >> k;
	assert(n <= 100);
	vector<ll> a(n);
	rep(i, n) {
		cin >> a[i];
		assert(a[i] <= 1000000000);
	}
	//rep(i, n - 1)assert(a[i] <= a[i + 1]);
	vector<int> c;
	sort(all(a));
	rep(i, n) {
		int le = i;
		while (i + 1 < n && a[i] == a[i + 1])i++;
		c.push_back(i - le + 1);
	}
	vector<modint> cdp = { 1 };
	int sum = c[0];
	for (int i = 1; i < c.size(); i++) {
		rep(j, c[i] + 1)rep(k, sum * c[i] + 1)dp[j][k] = 0;
		dp[0][0] = 1;
		for (int num = 0; num <= sum; num++) {
			rep(j, c[i])rep(k, sum * c[i] + 1) {
				if (dp[j][k] == (modint)0)continue;
				assert(k + num <= sum * c[i]);
				dp[j + 1][k + num] += dp[j][k];
			}
		}
		vector<modint> ndp(cdp.size() + sum * c[i]);
		rep(j, cdp.size())rep(k, sum * c[i] + 1) {
			modint val = cdp[j] * dp[c[i]][k];
			ndp[j + k] += val;
		}
		swap(cdp, ndp);
		sum += c[i];
	}
	modint ans = 0;
	if (k < cdp.size())ans = cdp[k];
	cout << ans << "\n";
}

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

yukicoder

結果

テストケース

ソースコード