#738571 (C++17) No.1838 Modulo Straight

提出ソース

結果

問題	No.1838 Modulo Straight
ユーザー	heno239
提出日時	2022-02-11 22:38:37
言語	C++17 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	165 ms / 2,000 ms
コード長	5,755 bytes
コンパイル時間	2,536 ms
コンパイル使用メモリ	156,436 KB
実行使用メモリ	38,104 KB
最終ジャッジ日時	2023-09-10 04:32:42
合計ジャッジ時間	7,984 ms
ジャッジサーバーID （参考情報）	judge15 / judge11

このコードへのチャレンジ（β）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	20 ms 11,608 KB
testcase_01	AC	20 ms 11,748 KB
testcase_02	AC	20 ms 11,552 KB
testcase_03	AC	21 ms 11,960 KB
testcase_04	AC	21 ms 11,664 KB
testcase_05	AC	20 ms 11,748 KB
testcase_06	AC	20 ms 11,624 KB
testcase_07	AC	20 ms 11,612 KB
testcase_08	AC	21 ms 11,636 KB
testcase_09	AC	21 ms 11,636 KB
testcase_10	AC	21 ms 11,744 KB
testcase_11	AC	156 ms 37,924 KB
testcase_12	AC	159 ms 37,836 KB
testcase_13	AC	162 ms 37,900 KB
testcase_14	AC	164 ms 38,104 KB
testcase_15	AC	165 ms 37,840 KB
testcase_16	AC	121 ms 26,292 KB
testcase_17	AC	123 ms 26,104 KB
testcase_18	AC	120 ms 26,172 KB
testcase_19	AC	109 ms 22,304 KB
testcase_20	AC	108 ms 22,420 KB
testcase_21	AC	108 ms 22,228 KB
testcase_22	AC	124 ms 29,228 KB
testcase_23	AC	119 ms 24,096 KB
testcase_24	AC	94 ms 18,168 KB
testcase_25	AC	85 ms 17,552 KB
testcase_26	AC	84 ms 17,676 KB
testcase_27	AC	84 ms 16,784 KB
testcase_28	AC	83 ms 16,180 KB
testcase_29	AC	83 ms 16,504 KB
testcase_30	AC	83 ms 16,496 KB
testcase_31	AC	87 ms 17,020 KB
testcase_32	AC	85 ms 17,884 KB
testcase_33	AC	127 ms 26,172 KB
testcase_34	AC	118 ms 26,112 KB
testcase_35	AC	93 ms 20,228 KB
testcase_36	AC	88 ms 17,388 KB
testcase_37	AC	85 ms 16,616 KB
testcase_38	AC	83 ms 16,352 KB
testcase_39	AC	51 ms 19,616 KB
testcase_40	AC	20 ms 11,580 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 << 20;
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() { ; };
	BIT(int n_) {
		n = n_; node.resize(n, 0);
	}
	void init(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);
	}
};

void solve() {
	int m, k; cin >> m >> k;
	vector<int> a(m * k);
	rep(i, m * k)cin >> a[i];
	vector<vector<int>> v(k);
	vector<int> cnt(m, 0);
	BIT<ll> bt(k+1);
	BIT<ll> btnum(k + 1);
	ll sum = 0;
	rep(i, m * k) {
		v[cnt[a[i]]].push_back(a[i]);
		bt.add(cnt[a[i]], -cnt[a[i]]);
		btnum.add(cnt[a[i]], -1);
		cnt[a[i]]++;
		sum += bt.sum(cnt[a[i]], k + 1) - btnum.sum(cnt[a[i]], k + 1) * cnt[a[i]];
		bt.add(cnt[a[i]], cnt[a[i]]);
		btnum.add(cnt[a[i]], 1);
	}
	rep(i, k) {
		BIT<ll> bt(m);
		rep(j, m) {
			int id = v[i][j];
			sum += bt.sum(id, m);
			bt.add(id, 1);
		}
	}
	ll ans = sum;
	//vector<BIT<ll>> btcur(k);
	vector<vector<int>> loc(m, vector<int>(k));
	rep(i, k) {
		rep(j, v[i].size()) {
			loc[v[i][j]][i] = j;
		}
	}
	rep(i, m - 1) {
		rep(j, k) {
			int l = loc[i][j];
			sum += m - l - 1;
			sum -= l;
		}
		chmin(ans, sum);
	}
	cout << ans << "\n";
}

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

yukicoder

結果

テストケース

ソースコード