結果

問題 No.275 中央値を求めよ
ユーザー SlephySlephy
提出日時 2023-12-30 10:27:56
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 2 ms / 1,000 ms
コード長 2,900 bytes
コンパイル時間 2,142 ms
コンパイル使用メモリ 200,148 KB
最終ジャッジ日時 2025-02-18 15:36:59
ジャッジサーバーID
(参考情報)
judge3 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 38
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int INF = (int)1e9 + 1001010;
constexpr ll llINF = (ll)4e18 + 22000020;
const string endn = "\n";
template <class T> inline auto vector2(size_t i, size_t j, const T &init = T()) {return vector(i, vector<T>(j, init));}
const string ELEM_SEPARATION = " ", VEC_SEPARATION = endn;
template<class T> istream& operator >>(istream &i, vector<T> &A) {for(auto &I : A) {i >> I;} return i;}
template<class T> ostream& operator <<(ostream &o, const vector<T> &A) {int i=A.size(); for(auto &I : A){o << I << (--i ? ELEM_SEPARATION : "");}
    return o;}
template<class T> ostream& operator <<(ostream &o, const vector<vector<T>> &A) {int i=A.size(); for(auto &I : A){o << I << (--i ? VEC_SEPARATION : ""
    );} return o;}
template<class T> vector<T>& operator ++(vector<T> &A, int n) {for(auto &I : A) {I++;} return A;}
template<class T> vector<T>& operator --(vector<T> &A, int n) {for(auto &I : A) {I--;} return A;}
template<class T, class U> bool chmax(T &a, const U &b) {return ((a < b) ? (a = b, true) : false);}
template<class T, class U> bool chmin(T &a, const U &b) {return ((a > b) ? (a = b, true) : false);}
ll floor(ll a, ll b){if(b < 0) a = -a, b = -b; return a >= 0 ? a/b : (a+1)/b - 1;}
ll ceil (ll a, ll b){if(b < 0) a = -a, b = -b; return a > 0 ? (a-1)/b + 1 : a/b;}
ll bit(unsigned long long val, unsigned long long digit){return (val >> digit) & 1;}
// ================================== ==================================
//
// floor()
template<class T>
T median(const vector<T> &v){
int n = v.size();
const T &l = v[n/2 -1];
const T &r = v[n/2];
if(n%2 == 1) return r;
else if(l > 0 ^ r > 0) return floor(l+r, 2);
else return l + floor(r-l, 2);
}
//
template<class T>
string median_string(const vector<T> &v){
string ret;
int n = v.size();
const T &l = v[n/2 -1];
const T &r = v[n/2];
if(n%2 == 1) ret = to_string(r);
else if(l > 0 ^ r > 0){
ret = to_string((l+r) / 2);
if((l+r)%2 == 1) ret += ".5";
}
else{
ret = to_string(l + (r-l) / 2);
if((r-l)%2 == 1) ret += ".5";
}
return ret;
}
//
template<class T>
double median_double(const vector<T> &v){
int n = v.size();
double l = v[n/2 -1];
double r = v[n/2];
if(n%2 == 1) return r;
else if(l > 0 ^ r > 0) return (l + r)/2;
else return l - (l - r)/2;
}
int main(int argc, char *argv[]){
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll n; cin >> n;
vector<ll> a(n); cin >> a;
sort(a.begin(), a.end());
cout << fixed << setprecision(1) << median_double(a) << endn;
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0