結果

問題 No.738 平らな農地
ユーザー heno239heno239
提出日時 2023-04-14 00:06:36
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 175 ms / 2,000 ms
コード長 7,378 bytes
コンパイル時間 2,428 ms
コンパイル使用メモリ 167,016 KB
実行使用メモリ 17,868 KB
最終ジャッジ日時 2024-10-09 19:35:30
合計ジャッジ時間 10,779 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 9 ms
11,844 KB
testcase_01 AC 8 ms
11,648 KB
testcase_02 AC 9 ms
11,776 KB
testcase_03 AC 9 ms
11,776 KB
testcase_04 AC 9 ms
11,776 KB
testcase_05 AC 10 ms
11,848 KB
testcase_06 AC 10 ms
11,848 KB
testcase_07 AC 11 ms
11,776 KB
testcase_08 AC 9 ms
11,776 KB
testcase_09 AC 8 ms
11,648 KB
testcase_10 AC 9 ms
11,648 KB
testcase_11 AC 9 ms
11,848 KB
testcase_12 AC 9 ms
11,776 KB
testcase_13 AC 10 ms
11,852 KB
testcase_14 AC 9 ms
11,776 KB
testcase_15 AC 94 ms
14,536 KB
testcase_16 AC 96 ms
14,540 KB
testcase_17 AC 91 ms
13,644 KB
testcase_18 AC 91 ms
13,644 KB
testcase_19 AC 75 ms
13,056 KB
testcase_20 AC 175 ms
14,404 KB
testcase_21 AC 97 ms
13,568 KB
testcase_22 AC 97 ms
14,336 KB
testcase_23 AC 90 ms
13,384 KB
testcase_24 AC 82 ms
13,128 KB
testcase_25 AC 9 ms
11,852 KB
testcase_26 AC 9 ms
11,776 KB
testcase_27 AC 9 ms
11,724 KB
testcase_28 AC 9 ms
11,776 KB
testcase_29 AC 10 ms
11,972 KB
testcase_30 AC 10 ms
11,776 KB
testcase_31 AC 9 ms
11,720 KB
testcase_32 AC 10 ms
11,904 KB
testcase_33 AC 9 ms
11,848 KB
testcase_34 AC 9 ms
11,848 KB
testcase_35 AC 9 ms
11,776 KB
testcase_36 AC 9 ms
11,724 KB
testcase_37 AC 9 ms
11,776 KB
testcase_38 AC 9 ms
11,848 KB
testcase_39 AC 9 ms
11,844 KB
testcase_40 AC 9 ms
11,724 KB
testcase_41 AC 10 ms
11,720 KB
testcase_42 AC 9 ms
11,724 KB
testcase_43 AC 9 ms
11,720 KB
testcase_44 AC 9 ms
11,776 KB
testcase_45 AC 103 ms
15,488 KB
testcase_46 AC 94 ms
14,720 KB
testcase_47 AC 98 ms
15,304 KB
testcase_48 AC 95 ms
15,488 KB
testcase_49 AC 92 ms
15,432 KB
testcase_50 AC 96 ms
15,744 KB
testcase_51 AC 101 ms
15,048 KB
testcase_52 AC 95 ms
15,048 KB
testcase_53 AC 97 ms
15,104 KB
testcase_54 AC 102 ms
15,104 KB
testcase_55 AC 103 ms
14,916 KB
testcase_56 AC 100 ms
14,976 KB
testcase_57 AC 94 ms
14,920 KB
testcase_58 AC 99 ms
15,308 KB
testcase_59 AC 103 ms
15,560 KB
testcase_60 AC 101 ms
15,744 KB
testcase_61 AC 100 ms
15,616 KB
testcase_62 AC 95 ms
15,104 KB
testcase_63 AC 106 ms
15,104 KB
testcase_64 AC 102 ms
15,304 KB
testcase_65 AC 49 ms
12,928 KB
testcase_66 AC 50 ms
12,996 KB
testcase_67 AC 70 ms
15,232 KB
testcase_68 AC 71 ms
15,560 KB
testcase_69 AC 71 ms
13,900 KB
testcase_70 AC 78 ms
15,180 KB
testcase_71 AC 41 ms
12,616 KB
testcase_72 AC 50 ms
13,128 KB
testcase_73 AC 54 ms
14,024 KB
testcase_74 AC 46 ms
12,740 KB
testcase_75 AC 72 ms
13,892 KB
testcase_76 AC 75 ms
14,924 KB
testcase_77 AC 63 ms
13,384 KB
testcase_78 AC 69 ms
13,440 KB
testcase_79 AC 66 ms
13,772 KB
testcase_80 AC 72 ms
14,920 KB
testcase_81 AC 61 ms
13,892 KB
testcase_82 AC 56 ms
13,508 KB
testcase_83 AC 53 ms
13,184 KB
testcase_84 AC 49 ms
13,312 KB
testcase_85 AC 59 ms
13,380 KB
testcase_86 AC 56 ms
13,256 KB
testcase_87 AC 83 ms
17,868 KB
testcase_88 AC 79 ms
17,536 KB
testcase_89 AC 9 ms
11,648 KB
testcase_90 AC 8 ms
11,848 KB
testcase_91 AC 9 ms
11,776 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#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;
//ll mod = 1;
//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;

using ld = long double;
typedef pair<ld, ld> LDP;
const ld eps = 1e-10;
const ld pi = acosl(-1.0);

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>
vector<T> vmerge(vector<T>& a, vector<T>& b) {
	vector<T> res;
	int ida = 0, idb = 0;
	while (ida < a.size() || idb < b.size()) {
		if (idb == b.size()) {
			res.push_back(a[ida]); ida++;
		}
		else if (ida == a.size()) {
			res.push_back(b[idb]); idb++;
		}
		else {
			if (a[ida] < b[idb]) {
				res.push_back(a[ida]); ida++;
			}
			else {
				res.push_back(b[idb]); idb++;
			}
		}
	}
	return res;
}
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;
}
//mod should be <2^31
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; }
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 -= (int)mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)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;
}
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 = 2000005;
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>;
mP operator+(mP a, mP b) {
	return { a.first + b.first,a.second + b.second };
}
mP operator+=(mP& a, mP b) {
	a = a + b; return a;
}
mP operator-(mP a, mP b) {
	return { a.first - b.first,a.second - b.second };
}
mP operator-=(mP& a, mP b) {
	a = a - b; return a;
}
LP operator+(LP a, LP b) {
	return { a.first + b.first,a.second + b.second };
}
LP operator+=(LP& a, LP b) {
	a = a + b; return a;
}
LP operator-(LP a, LP b) {
	return { a.first - b.first,a.second - b.second };
}
LP operator-=(LP& a, LP b) {
	a = a - b; return a;
}

mt19937 mt(time(0));

const string drul = "DRUL";
string senw = "SENW";
//DRUL,or SENW
//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);
	}
};
void solve() {
	int n, k; cin >> n >> k;
	vector<int> a(n);
	rep(i, n)cin >> a[i];
	vector<int> va = a;
	sort(all(va)); va.erase(unique(all(va)), va.end());
	rep(i, n) {
		a[i] = lower_bound(all(va), a[i]) - va.begin();
	}
	BIT<ll> bt(va.size());
	BIT<int> btcnt(va.size());
	multiset<int> stl, str;
	int dl = (k + 1) / 2;
	int dr = k - dl;
	rep(i, k - 1) {
		bt.add(a[i], va[a[i]]);
		btcnt.add(a[i], 1);
		stl.insert(a[i]);
	}
	ll ans = INF;
	for (int i = k - 1; i < n; i++) {
		if (i >= k) {
			bt.add(a[i - k], -va[a[i - k]]);
			btcnt.add(a[i - k], -1);
			if (stl.find(a[i - k]) != stl.end()) {
				stl.erase(stl.find(a[i - k]));
			}
			else {
				str.erase(str.find(a[i - k]));
			}
		}
		bt.add(a[i], va[a[i]]);
		btcnt.add(a[i], 1);
		if (str.size() && (*str.begin()) <= a[i]) {
			str.insert(a[i]);
		}
		else {
			stl.insert(a[i]);
		}
		while (stl.size() > dl) {
			int v = *--stl.end();
			stl.erase(--stl.end());
			str.insert(v);
		}
		while (str.size() > dr) {
			int v = *str.begin();
			str.erase(str.begin());
			stl.insert(v);
		}

		int mid = *--stl.end();
		//cout << i << " " << va[mid] << " " << stl.size() << " " << str.size() << "\n";
		ll sl = bt.sum(mid);
		ll sr = bt.sum(mid, va.size());
		ll cl = btcnt.sum(mid);
		ll cr = btcnt.sum(mid, va.size());

		ll cval = 0;
		cval += cl * va[mid] - sl;
		cval += sr - cr * va[mid];
		chmin(ans, cval);
	}
	cout << ans << "\n";
}



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