#222185 (C++17) No.609 Noelちゃんと星々

• 問題: No.609 Noelちゃんと星々
• ユーザー: mai
• 提出日時: 2017-12-09 00:46:18
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 11 ms / 2,000 ms
• コード長: 5,275 bytes
• コンパイル時間: 3,853 ms
• コンパイル使用メモリ: 217,764 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-05-07 06:31:08
• 合計ジャッジ時間: 4,954 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	9 ms; 6,812 KB
testcase_01	AC	6 ms; 6,812 KB
testcase_02	AC	5 ms; 6,944 KB
testcase_03	AC	5 ms; 6,940 KB
testcase_04	AC	3 ms; 6,940 KB
testcase_05	AC	10 ms; 6,940 KB
testcase_06	AC	10 ms; 6,940 KB
testcase_07	AC	6 ms; 6,940 KB
testcase_08	AC	3 ms; 6,944 KB
testcase_09	AC	5 ms; 6,940 KB
testcase_10	AC	8 ms; 6,940 KB
testcase_11	AC	7 ms; 6,940 KB
testcase_12	AC	9 ms; 6,944 KB
testcase_13	AC	3 ms; 6,940 KB
testcase_14	AC	2 ms; 6,940 KB
testcase_15	AC	10 ms; 6,944 KB
testcase_16	AC	11 ms; 6,944 KB
testcase_17	AC	9 ms; 6,940 KB
testcase_18	AC	4 ms; 6,944 KB
testcase_19	AC	9 ms; 6,944 KB
testcase_20	AC	11 ms; 6,944 KB
testcase_21	AC	11 ms; 6,944 KB
testcase_22	AC	11 ms; 6,940 KB
testcase_23	AC	11 ms; 6,944 KB
testcase_24	AC	11 ms; 6,944 KB

コンパイルメッセージ

main.cpp: In member function '{anonymous}::MaiScanner& {anonymous}::MaiScanner::operator>>(std::string&)':
main.cpp:58:9: warning: no return statement in function returning non-void [-Wreturn-type]
   58 |         }
      |         ^

ソースコード

#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include "bits/stdc++.h" // define macro "/D__MAI"

using namespace std;
typedef long long int ll;

#define xprintf(fmt,...) fprintf(stderr,fmt,__VA_ARGS__)
#define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) {printf("L%d %s > ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;}
#define debugaa(m,h,w) {printf("L%d %s >\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}}
#define ALL(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(auto cnt=0ll;(cnt)<(l);++(cnt))
#define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt))
#define MD 1000000007ll
#define PI 3.1415926535897932384626433832795
#define EPS 1e-12
template<typename T1, typename T2> ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o; }
template<typename iterator> inline size_t argmin(iterator begin, iterator end) { return distance(begin, min_element(begin, end)); }
template<typename iterator> inline size_t argmax(iterator begin, iterator end) { return distance(begin, max_element(begin, end)); }
template<typename T> T& maxset(T& to, const T& val) { return to = max(to, val); }
template<typename T> T& minset(T& to, const T& val) { return to = min(to, val); }
void bye(string s, int code = 0) { cout << s << endl; exit(0); }
mt19937_64 randdev(8901016);
inline ll rand_range(ll l, ll h) {
    return uniform_int_distribution<ll>(l, h)(randdev);
}

#if defined(_WIN32) || defined(_WIN64)
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#elif __GNUC__
#else
#define getchar_unlocked getchar
#define putchar_unlocked putchar
#endif
namespace {
#define isvisiblechar(c) (0x21<=(c)&&(c)<=0x7E)
    class MaiScanner {
    public:
        template<typename T> void input_integer(T& var) {
            var = 0; T sign = 1;
            int cc = getchar_unlocked();
            for (; cc<'0' || '9'<cc; cc = getchar_unlocked())
                if (cc == '-') sign = -1;
            for (; '0' <= cc&&cc <= '9'; cc = getchar_unlocked())
                var = (var << 3) + (var << 1) + cc - '0';
            var = var*sign;
        }
        inline int c() { return getchar_unlocked(); }
        inline MaiScanner& operator>>(int& var) { input_integer<int>(var); return *this; }
        inline MaiScanner& operator>>(long long& var) { input_integer<long long>(var); return *this; }
        inline MaiScanner& operator>>(string& var) {
            int cc = getchar_unlocked();
            for (; !isvisiblechar(cc); cc = getchar_unlocked());
            for (; isvisiblechar(cc); cc = getchar_unlocked())
                var.push_back(cc);
        }
        template<typename IT> void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; }
    };
    class MaiPrinter {
    public:
        template<typename T>
        void output_integer(T var) {
            if (var == 0) { putchar_unlocked('0'); return; }
            if (var < 0)
                putchar_unlocked('-'),
                var = -var;
            char stack[32]; int stack_p = 0;
            while (var)
                stack[stack_p++] = '0' + (var % 10),
                var /= 10;
            while (stack_p)
                putchar_unlocked(stack[--stack_p]);
        }
        inline MaiPrinter& operator<<(char c) { putchar_unlocked(c); return *this; }
        inline MaiPrinter& operator<<(int var) { output_integer<int>(var); return *this; }
        inline MaiPrinter& operator<<(long long var) { output_integer<long long>(var); return *this; }
        inline MaiPrinter& operator<<(char* str_p) { while (*str_p) putchar_unlocked(*(str_p++)); return *this; }
        inline MaiPrinter& operator<<(const string& str) {
            const char* p = str.c_str();
            const char* l = p + str.size();
            while (p < l) putchar_unlocked(*p++);
            return *this;
        }
        template<typename IT> void join(IT begin, IT end, char sep = '\n') { for (auto it = begin; it != end; ++it) *this << *it << sep; }
    };
}
MaiScanner scanner;
MaiPrinter printer;



typedef ll tsearch_t;
typedef ll fval_t;
tsearch_t tri_search_minimize(tsearch_t left, tsearch_t right, function<fval_t(tsearch_t)> func) {

    for (int lop = 0; lop < 60; ++lop) {
        tsearch_t l = right - (2 * right - 2 * left) / 3;
        tsearch_t r = right - (right - left) / 3;

        fval_t lval = func(l);
        fval_t rval = func(r);

        if (lval <= rval)
            right = r;
        else
            left = l;

        if (left == right) return left;
    }
    fval_t best = func(left);
    tsearch_t bestidx = left;
    for (tsearch_t t = left + 1; t <= right; ++t) {
        tsearch_t f = func(t);
        if (best > f) {
            best = f; bestidx = t;
        }
    }
    return bestidx;
}

ll m, n, kei;

ll yy[1000010];

int main() {

    scanner >> n;
    scanner.in(yy, yy + n);

    ll ans = tri_search_minimize(-1e9, 1e9, [](ll x) {
        ll d = 0;
        repeat(i, n) { d += abs(x - yy[i]); }
        return d;
    });

    ll d = 0;
    repeat(i, n) { d += abs(ans - yy[i]); }

    cout << d << endl;

    return 0;
}