#235822 (C++11) No.609 Noelちゃんと星々

• 問題: No.609 Noelちゃんと星々
• ユーザー: komori3
• 提出日時: 2018-02-12 18:42:18
• 言語: C++11 (gcc 11.4.0)
• 結果: AC
• 実行時間: 49 ms / 2,000 ms
• コード長: 3,744 bytes
• コンパイル時間: 1,365 ms
• コンパイル使用メモリ: 161,040 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-05-03 19:12:17
• 合計ジャッジ時間: 3,666 ms
• ジャッジサーバーID （参考情報）: judge3 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	36 ms; 5,248 KB
testcase_01	AC	19 ms; 5,376 KB
testcase_02	AC	13 ms; 5,376 KB
testcase_03	AC	17 ms; 5,376 KB
testcase_04	AC	9 ms; 5,376 KB
testcase_05	AC	45 ms; 5,376 KB
testcase_06	AC	40 ms; 5,376 KB
testcase_07	AC	23 ms; 5,376 KB
testcase_08	AC	6 ms; 5,376 KB
testcase_09	AC	16 ms; 5,376 KB
testcase_10	AC	29 ms; 5,376 KB
testcase_11	AC	29 ms; 5,376 KB
testcase_12	AC	35 ms; 5,376 KB
testcase_13	AC	8 ms; 5,376 KB
testcase_14	AC	4 ms; 5,376 KB
testcase_15	AC	40 ms; 5,376 KB
testcase_16	AC	47 ms; 5,376 KB
testcase_17	AC	36 ms; 5,376 KB
testcase_18	AC	13 ms; 5,376 KB
testcase_19	AC	39 ms; 5,376 KB
testcase_20	AC	46 ms; 5,376 KB
testcase_21	AC	48 ms; 5,376 KB
testcase_22	AC	49 ms; 5,376 KB
testcase_23	AC	49 ms; 5,376 KB
testcase_24	AC	49 ms; 5,376 KB

ソースコード

#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"

#include <random>
//#include "util.k"

using namespace std;

//呪文
#define DUMPOUT cout
#define dump(...) DUMPOUT<<"  ";DUMPOUT<<#__VA_ARGS__<<" :["<<__LINE__<<":"<<__FUNCTION__<<"]"<<endl;DUMPOUT<<"    ";dump_func(__VA_ARGS__)

typedef unsigned uint; typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef pair<double, double> pdd; typedef pair<string, string> pss;
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const pair<_KTy, _Ty>& m) { ostr << "{" << m.first << ", " << m.second << "}"; return ostr; }
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const map<_KTy, _Ty>& m) { if (m.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { ostr << ", " << *itr; } ostr << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const vector<_Ty>& v) { if (v.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << v.front(); for (auto itr = ++v.begin(); itr != v.end(); itr++) { ostr << ", " << *itr; }	ostr << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const set<_Ty>& s) { if (s.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { ostr << ", " << *itr; }	ostr << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const stack<_Ty>& s) { if (s.empty()) { ostr << "{ }"; return ostr; } stack<_Ty> t(s); ostr << "{" << t.top(); t.pop(); while (!t.empty()) { ostr << ", " << t.top(); t.pop(); } ostr << "}";	return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const list<_Ty>& l) { if (l.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << l.front(); for (auto itr = ++l.begin(); itr != l.end(); ++itr) { ostr << ", " << *itr; } ostr << "}"; return ostr; }
template <typename _KTy, typename _Ty> istream& operator >> (istream& istr, pair<_KTy, _Ty>& m) { istr >> m.first >> m.second; return istr; }
template <typename _Ty> istream& operator >> (istream& istr, vector<_Ty>& v) { for (size_t i = 0; i < v.size(); i++) istr >> v[i]; return istr; }

template<typename A, size_t N, typename T> inline void Fill(A(&array)[N], const T &val) { std::fill((T*)array, (T*)(array + N), val); }

void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head&& head, Tail&&... tail) { DUMPOUT << head; if (sizeof...(Tail) == 0) { DUMPOUT << " "; } else { DUMPOUT << ", "; } dump_func(std::move(tail)...); }

#define PI 3.14159265358979323846
#define EPS 1e-11
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define fake false



int N;
vector<ll> Y;

ll dif(ll h) {
	ll res = 0;
	for (int i = 0; i < N; i++) {
		res += abs(h - Y[i]);
	}
	return res;
}

//[from, to)におけるunimodalFuncのargmax(もし複数ある場合は一番若い番号)を返す
template<typename Ty> Ty Minimize(Ty from, Ty to) {
	// d[i] = a[i] - a[i-1]とする。
	// このとき、d[i] > 0 <=> a[i] > a[i-1]なので、
	// d[i] > 0なる最大のi in (from, to)を見つけると、a[i]が最大値
	for (; to - from > 1;) {
		Ty mid = (from + to) / 2;
		(dif(mid - 1) - dif(mid) > 0 ? from : to) = mid;
	}
	return from;
}

int main()
{
	//clock_t start, end;
	//start = clock();

	//cin.tie(0);
	//ios::sync_with_stdio(false);

	cin >> N;
	Y.resize(N);
	cin >> Y;

	ll l = INT_MIN, r = INT_MAX;
	cout << dif(Minimize(l, r)) << endl;

	//end = clock();
	//printf("%d msec.\k", end - start);

	return 0;
}