結果

問題 No.180 美しいWhitespace (2)
ユーザー mai
提出日時 2017-07-09 12:56:27
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 4,147 bytes
コンパイル時間 3,108 ms
コンパイル使用メモリ 216,408 KB
最終ジャッジ日時 2025-01-05 01:22:31
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 28 WA * 3
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In member function ‘{anonymous}::MaiScanner& {anonymous}::MaiScanner::operator>>(std::string&)’:
main.cpp:62:9: warning: no return statement in function returning non-void [-Wreturn-type]
   62 |         }
      |         ^
main.cpp: At global scope:
main.cpp:72:40: warning: use of ‘auto’ in parameter declaration only available with ‘-std=c++20’ or ‘-fconcepts’
   72 | INTEGER b_search(INTEGER l, INTEGER h, auto func) {
      |                                        ^~~~
main.cpp:90:38: warning: use of ‘auto’ in parameter declaration only available with ‘-std=c++20’ or ‘-fconcepts’
   90 | ll t_search_proto(ll left, ll right, auto func) {
      |                                      ^~~~

ソースコード

diff # 

#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 debugv(v) {printf("L%d %s => ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debugm(m) {printf("L%d %s is..\n",__LINE__,#m);for(auto v:m){for(auto e:v){cout<<e<<" ";}cout<<endl;}}
#define debuga(m,w) {printf("L%d %s is => ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;}
#define debugaa(m,w,h) {printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[x][y]<<" ";}cout<<endl;}}
#define debugaar(m,w,h) {printf("L%d %s is..\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(l) for(auto cnt=0;cnt<(l);++cnt)
#define iterate(b,e) for(auto cnt=(b);cnt!=(e);++cnt)
#define MD 1000000007ll
#define PI 3.1415926535897932384626433832795
template<typename T1, typename T2>
ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o; }

mt19937 mt(8901016);
inline int rand_int(int l, int h) {
    return uniform_int_distribution<>(l, h)(mt);
}

#ifdef __MAI
#define getchar_unlocked getchar
#define putchar_unlocked putchar
#endif
#ifdef __VSCC
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#endif
namespace {
#define isvisiablechar(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 (; !isvisiablechar(cc); cc = getchar_unlocked());
            for (; isvisiablechar(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;
        }
    };
}
MaiScanner scanner;


template<typename INTEGER>
INTEGER b_search(INTEGER l, INTEGER h, auto func) {
    ++h;
    // --l;
    INTEGER c;
    while (l + 1 < h) {
        c = (l + h) / 2;
        if (func(c)) {
            h = c;
        }
        else {
            l = c;
        }
    }
    return h;
    // return l;
}

// 極値を求める二分探索
ll t_search_proto(ll left, ll right, auto func) {

    ll lval;
    ll rval;

    repeat(100) {

        ll l = (2 * left + right) / 3;
        ll r = (left + 2 * right) / 3;

        ll lval = func(l);
        ll rval = func(r);
        //printf("%lld %lld ; %lld->%lld %lld->%lld\n", left, right,l,r,lval,rval);

        if (lval <= rval) {
            right = r;
        }
        else {
            left = l;
        }
        if (left == right)
            return left;
    }
    ll best = func(left);
    ll bestidx = left;
    for (ll t = left+1; t<=right; ++t){
        ll f = func(t);
        if (best > f){
            best = f; bestidx = t;
        }
    }
    return bestidx;
}


int n;

ll aa[1010], bb[1010];

ll minixer(ll x) {
    ll high = 0;
    ll low = 1e18;
    for (int i = 0; i < n; ++i) {
        ll l = aa[i] + bb[i] * x;
        high = max(high, l);
        low = min(low, l);
    }
    return high - low;
}

int main() {
    scanner >> n;

    repeat(n) {
        scanner >> aa[cnt] >> bb[cnt];
    }

    ll rs = t_search_proto(1ll, 500000000ll, [](ll x) {return minixer(x); });

    cout << rs << endl;

    return 0;
}
0