結果

問題 No.919 You Are A Project Manager
ユーザー heno239heno239
提出日時 2023-04-26 11:53:25
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 71 ms / 3,000 ms
コード長 9,496 bytes
コンパイル時間 2,137 ms
コンパイル使用メモリ 159,288 KB
実行使用メモリ 15,488 KB
最終ジャッジ日時 2024-04-27 16:18:11
合計ジャッジ時間 5,379 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 62 ms
15,304 KB
testcase_01 AC 5 ms
11,776 KB
testcase_02 AC 5 ms
11,844 KB
testcase_03 AC 5 ms
11,776 KB
testcase_04 AC 13 ms
12,800 KB
testcase_05 AC 14 ms
12,744 KB
testcase_06 AC 5 ms
11,852 KB
testcase_07 AC 24 ms
13,440 KB
testcase_08 AC 10 ms
12,228 KB
testcase_09 AC 8 ms
11,976 KB
testcase_10 AC 11 ms
12,364 KB
testcase_11 AC 10 ms
12,160 KB
testcase_12 AC 6 ms
11,776 KB
testcase_13 AC 11 ms
12,492 KB
testcase_14 AC 6 ms
11,844 KB
testcase_15 AC 6 ms
11,904 KB
testcase_16 AC 15 ms
12,744 KB
testcase_17 AC 64 ms
15,304 KB
testcase_18 AC 61 ms
15,432 KB
testcase_19 AC 62 ms
15,308 KB
testcase_20 AC 58 ms
14,976 KB
testcase_21 AC 64 ms
15,488 KB
testcase_22 AC 27 ms
13,512 KB
testcase_23 AC 27 ms
13,384 KB
testcase_24 AC 29 ms
13,516 KB
testcase_25 AC 27 ms
13,512 KB
testcase_26 AC 57 ms
15,104 KB
testcase_27 AC 51 ms
14,592 KB
testcase_28 AC 61 ms
15,304 KB
testcase_29 AC 67 ms
15,308 KB
testcase_30 AC 67 ms
15,308 KB
testcase_31 AC 66 ms
15,436 KB
testcase_32 AC 71 ms
15,488 KB
testcase_33 AC 31 ms
13,696 KB
testcase_34 AC 30 ms
13,568 KB
testcase_35 AC 64 ms
15,436 KB
testcase_36 AC 66 ms
15,436 KB
testcase_37 AC 66 ms
15,432 KB
testcase_38 AC 64 ms
15,360 KB
testcase_39 AC 5 ms
11,720 KB
testcase_40 AC 7 ms
12,032 KB
testcase_41 AC 6 ms
11,980 KB
testcase_42 AC 5 ms
11,904 KB
testcase_43 AC 6 ms
11,972 KB
testcase_44 AC 8 ms
12,032 KB
testcase_45 AC 6 ms
11,848 KB
testcase_46 AC 7 ms
12,160 KB
testcase_47 AC 28 ms
13,568 KB
testcase_48 AC 27 ms
13,384 KB
testcase_49 AC 28 ms
13,512 KB
testcase_50 AC 28 ms
13,384 KB
testcase_51 AC 26 ms
13,388 KB
testcase_52 AC 21 ms
12,876 KB
testcase_53 AC 25 ms
13,312 KB
testcase_54 AC 7 ms
11,976 KB
testcase_55 AC 5 ms
11,648 KB
testcase_56 AC 5 ms
11,776 KB
testcase_57 AC 5 ms
11,720 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 int mod17 = 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 };

//-----------------------------------------

const int sz = 14;
struct wavelet_matrix {
private:
	vector<bool> b[sz];
	vector<int> cntone[sz];
	vector<int> nex[sz];

	vector<P> le[sz], ri[sz];

	vector<int> las;
public:
	void init(vector<int> v) {
		int n = v.size();

		per(i, sz) {
			vector<P> v0, v1;
			rep(j, n) {
				cntone[i][j + 1] = cntone[i][j];
				if (v[j] & (1 << i)) {
					b[i][j] = true;
					cntone[i][j + 1]++;
					v1.push_back({ v[j],j });
				}
				else {
					b[i][j] = false;
					v0.push_back({ v[j],j });
				}
			}

			P pre = { 0,0 };
			rep(j, n) {
				le[i][j] = pre;
				if (b[i][j])pre.second = j;
				else pre.first = j;
			}
			le[i][n] = pre;
			pre = { n,n };
			per(j, n) {
				if (b[i][j])pre.second = j;
				else pre.first = j;
				ri[i][j] = pre;
			}
			v.clear();
			rep(j, v0.size()) {
				nex[i][v0[j].second] = j; v.push_back(v0[j].first);
			}
			rep(j, v1.size()) {
				nex[i][v1[j].second] = j + v0.size();
				v.push_back(v1[j].first);
			}
		}
		las = v;
	}
	wavelet_matrix(vector<int> v) {
		int n = v.size();
		rep(i, sz) {
			b[i].resize(n);
			cntone[i].resize(n + 1);
			nex[i].resize(n);
			le[i].resize(n + 1);
			ri[i].resize(n);
		}

		per(i, sz) {
			vector<P> v0, v1;
			rep(j, n) {
				cntone[i][j + 1] = cntone[i][j];
				if (v[j] & (1 << i)) {
					b[i][j] = true;
					cntone[i][j + 1]++;
					v1.push_back({ v[j],j });
				}
				else {
					b[i][j] = false;
					v0.push_back({ v[j],j });
				}
			}

			P pre = { 0,0 };
			rep(j, n) {
				le[i][j] = pre;
				if (b[i][j])pre.second = j;
				else pre.first = j;
			}
			le[i][n] = pre;
			pre = { n,n };
			per(j, n) {
				if (b[i][j])pre.second = j;
				else pre.first = j;
				ri[i][j] = pre;
			}
			v.clear();
			rep(j, v0.size()) {
				nex[i][v0[j].second] = j; v.push_back(v0[j].first);
			}
			rep(j, v1.size()) {
				nex[i][v1[j].second] = j + v0.size();
				v.push_back(v1[j].first);
			}
		}
		las = v;
	}
	//[l,r)
	//0-indexed
	int take_kth(int k, int l, int r) {
		k++;
		per(i, sz) {
			int c = cntone[i][r] - cntone[i][l];
			if (r - l - c < k) {
				k -= r - l - c;
				l = nex[i][ri[i][l].second];
				r = nex[i][le[i][r].second] + 1;
			}
			else {
				l = nex[i][ri[i][l].first];
				r = nex[i][le[i][r].first] + 1;
			}
		}
		return las[l];
	}

	//number of >=k in [l,r)
	int number_upk(int k, int l, int r) {
		int res = 0;
		per(i, sz) {
			if (k & (1 << i)) {
				l = ri[i][l].second;
				r = le[i][r].second;
				if (l > r)break;
				l = nex[i][l];
				r = nex[i][r] + 1;
			}
			else {
				res += cntone[i][r] - cntone[i][l];
				l = ri[i][l].first;
				r = le[i][r].first;
				if (l > r)break;
				l = nex[i][l];
				r = nex[i][r] + 1;
			}
		}
		if (l < r)res += r - l;
		return res;
	}
	//number of <=k in [l,r)
	int number_dwk(int k, int l, int r) {
		int res = 0;
		per(i, sz) {
			if (k & (1 << i)) {
				res += r - l;
				res -= cntone[i][r] - cntone[i][l];
				l = ri[i][l].second;
				r = le[i][r].second;
				if (l > r)break;
				l = nex[i][l];
				r = nex[i][r] + 1;
			}
			else {
				l = ri[i][l].first;
				r = le[i][r].first;
				if (l > r)break;
				l = nex[i][l];
				r = nex[i][r] + 1;
			}
		}
		if (l < r)res += r - l;
		return res;
	}
};

void solve() {
	int n; cin >> n;
	vector<int> a(n);
	rep(i, n)cin >> a[i];
	auto 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();
	wavelet_matrix wm(a);
	auto query = [&](int l, int r) {
		int k = (r - l - 1) / 2;
		return va[wm.take_kth(k, l, r)];
	};
	ll ans = 0;
	for (int k = 1; k <= n; k++) {
		int d = n / k;
		vector<ll> vl(d + 1);
		vector<ll> vr(d + 1);
		rep(i, d) {
			vl[i + 1] = vl[i] + (ll)k * query(i * k, (i + 1) * k);
			vr[i + 1] = vr[i] + (ll)k * query(n - (i + 1) * k, n - i * k);
		}
		rep(i, d) {
			chmax(vl[i + 1], vl[i]);
			chmax(vr[i + 1], vr[i]);
		}
		rep(i, d + 1) {
			chmax(ans, vl[i] + vr[d - i]);
		}
	}
	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