#419684 (C++14) No.972 選び方のスコア

提出ソース

結果

問題	No.972 選び方のスコア
ユーザー	ningenMe
提出日時	2020-01-18 20:36:44
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	147 ms / 2,000 ms
コード長	5,825 bytes
コンパイル時間	1,918 ms
コンパイル使用メモリ	175,492 KB
実行使用メモリ	8,960 KB
最終ジャッジ日時	2024-06-28 03:00:18
合計ジャッジ時間	7,262 ms
ジャッジサーバーID （参考情報）	judge1 / judge3

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	143 ms 8,832 KB
testcase_01	AC	147 ms 8,904 KB
testcase_02	AC	136 ms 8,832 KB
testcase_03	AC	67 ms 6,016 KB
testcase_04	AC	138 ms 8,832 KB
testcase_05	AC	135 ms 8,832 KB
testcase_06	AC	136 ms 8,828 KB
testcase_07	AC	107 ms 8,448 KB
testcase_08	AC	137 ms 8,840 KB
testcase_09	AC	133 ms 8,832 KB
testcase_10	AC	95 ms 8,960 KB
testcase_11	AC	100 ms 8,960 KB
testcase_12	AC	102 ms 8,904 KB
testcase_13	AC	123 ms 8,828 KB
testcase_14	AC	104 ms 8,828 KB
testcase_15	AC	127 ms 8,960 KB
testcase_16	AC	127 ms 8,832 KB
testcase_17	AC	126 ms 8,960 KB
testcase_18	AC	2 ms 5,376 KB
testcase_19	AC	128 ms 8,960 KB
testcase_20	AC	127 ms 8,960 KB
testcase_21	AC	125 ms 8,932 KB
testcase_22	AC	129 ms 8,960 KB
testcase_23	AC	126 ms 8,820 KB
testcase_24	AC	128 ms 8,812 KB
testcase_25	AC	2 ms 5,376 KB
testcase_26	AC	2 ms 5,376 KB
testcase_27	AC	2 ms 5,376 KB
testcase_28	AC	2 ms 5,376 KB
testcase_29	AC	2 ms 5,376 KB
testcase_30	AC	2 ms 5,376 KB
testcase_31	AC	2 ms 5,376 KB
testcase_32	AC	2 ms 5,376 KB
testcase_33	AC	2 ms 5,376 KB
testcase_34	AC	2 ms 5,376 KB

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

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;

#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);

template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;

constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433;

template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}



template<class Operator> class SegmentTree {
	Operator Op;                            //Operator 演算子、型、単位元を持つ
	using typeNode = decltype(Op.unitNode); //nodeの型
	size_t length;                          //セグメント木の最下段の要素の数(vectorの要素の数を超える2べきの数)
	vector<typeNode> node;                  //ノード

public:

	//unitで初期化
	SegmentTree(const size_t num){
		for (length = 1; length < num; length *= 2);
		node.resize(2 * length, Op.unitNode);
	}

	//vectorで初期化
	SegmentTree(const vector<typeNode> & vec){
		for (length = 1; length < vec.size(); length *= 2);
		node.resize(2 * length, Op.unitNode);
		for (int i = 0; i < vec.size(); ++i) node[i + length] = vec[i];
		for (int i = length - 1; i >= 0; --i) node[i] = Op.funcNode(node[(i<<1)+0],node[(i<<1)+1]);
	}
 
	//同じinitで初期化
	SegmentTree(const size_t num, const typeNode init) {
		for (length = 1; length < num; length *= 2);
		node.resize(2 * length, init);
	}
	
	//idx : 0-indexed
	void update(size_t idx, const typeNode var) {
		if(idx < 0 || length <= idx) return;
		idx += length;
		node[idx] = Op.funcMerge(node[idx],var);
		while(idx >>= 1) node[idx] = Op.funcNode(node[(idx<<1)+0],node[(idx<<1)+1]);
	}

	//[l,r)
	typeNode get(int l, int r) {
		if (l < 0 || length <= l || r < 0 || length < r) return Op.unitNode;
		typeNode vl = Op.unitNode, vr = Op.unitNode;
		for(l += length, r += length; l < r; l >>=1, r >>=1) {
			if(l&1) vl = Op.funcNode(vl,node[l++]);
			if(r&1) vr = Op.funcNode(node[--r],vr);
		}
		return Op.funcNode(vl,vr);
	}
 
	void print(){
		cout << "{ " << get(0,1);
		for(int i = 1; i < length; ++i) cout << ", " << get(i,i+1);
		cout << " }" << endl;

		for(int i = 1,j = 1; i < 2*length; ++i) {
			cout << node[i] << " ";
			if(i==((1<<j)-1) && ++j) cout << endl;
		}
	}

};

//一点加算 区間最大
template<class typeNode> struct nodeSumRangeMax {
	typeNode unitNode = 0;
	typeNode funcNode(typeNode l,typeNode r){return max(l,r);}
	typeNode funcMerge(typeNode l,typeNode r){return l+r;}
};

//一点加算 区間総和
template<class typeNode> struct nodeSumRangeSum {
	typeNode unitNode = 0;
	typeNode funcNode(typeNode l,typeNode r){return l+r;}
	typeNode funcMerge(typeNode l,typeNode r){return l+r;}
};

//一点更新 区間最小
template<class typeNode> struct nodeUpdateRangeMin {
	typeNode unitNode = (1LL<<31)-1;
	typeNode funcNode(typeNode l,typeNode r){return min(l,r);}
	typeNode funcMerge(typeNode l,typeNode r){return r;}
};




int main() {
    ll N; cin >> N;
    vector<ll> A(N+1,0);
    for(int i = 0; i < N; ++i) cin >> A[i];
    sort(ALL(A));
    SegmentTree<nodeSumRangeSum<ll>> seg(A);
    ll ans = 0;
    for(ll i = 1; i <= N; ++i) {
        ll ok = 0,ng = N,md;
        int l,r;
        while(ng-ok>1){
            md = (ok+ng)/2;
            l = i - md,r = N+1 - md;
            (l>0&&N>=r&&r>i&&(A[l]+A[r])>2*A[i]?ok:ng)=md;
        }
        l = i - ok,r = N+1 - ok;
        chmax(ans,seg.get(l,i)+seg.get(r,N+1)-2*ok*A[i]);
    }
    cout << ans << endl;
    return 0;
}

yukicoder

結果

テストケース

ソースコード