結果
問題 | No.180 美しいWhitespace (2) |
ユーザー |
|
提出日時 | 2017-01-06 18:53:13 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 3 ms / 5,000 ms |
コード長 | 1,996 bytes |
コンパイル時間 | 1,854 ms |
コンパイル使用メモリ | 170,540 KB |
実行使用メモリ | 6,824 KB |
最終ジャッジ日時 | 2024-12-17 14:40:43 |
合計ジャッジ時間 | 3,059 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 31 |
コンパイルメッセージ
main.cpp: In function 'void solve()': main.cpp:91:13: warning: 'x' may be used uninitialized [-Wmaybe-uninitialized] 91 | for( ; lb <= rb; ){ | ~~~^~~~~ main.cpp:83:6: note: 'x' was declared here 83 | ll x, min_ugliness = 1LL << 61; | ^
ソースコード
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef vector< int > vi; typedef vector< vi > vvi; typedef vector< ll > vl; typedef vector< vl > vvl; typedef pair< int, int > pii; typedef vector< pii > vp; typedef vector< double > vd; typedef vector< vd > vvd; typedef vector< string > vs; template< class T1, class T2 > int upmin( T1 &x, T2 v ){ if( x > v ){ x = v; return 1; } return 0; } template< class T1, class T2 > int upmax( T1 &x, T2 v ){ if( x < v ){ x = v; return 1; } return 0; } const int INF = 0x3f3f3f3f; int N; vi A, B; void init(){ cin >> N; A = B = vi( N ); for( int i = 0; i < N; ++i ){ cin >> A[ i ] >> B[ i ]; } } void preprocess(){ } ll calc( ll x ){ ll maxv = - ( 1LL << 61 ); for( int i = 0; i < N; ++i ){ upmax( maxv, 1LL * A[ i ] + 1LL * B[ i ] * x ); } ll minv = 1LL << 61; for( int i = 0; i < N; ++i ){ upmin( minv, 1LL * A[ i ] + 1LL * B[ i ] * x ); } return maxv - minv; } void solve(){ ll lb = 1LL, rb = ( ll ) 1e9; for( ; rb - lb > 5; ){ ll p = ( lb * 2 + rb ) / 3; ll q = ( lb + rb * 2 ) / 3; ll rl = calc( lb ); ll rp = calc( p ); ll rq = calc( q ); ll rr = calc( rb ); if( rl <= rp and rp <= rq and rq <= rr ){ rb = p; } else if( rl >= rp and rp <= rq and rq <= rr ){ rb = q; } else if( rl >= rp and rp >= rq and rq <= rr ){ lb = p; } else if( rl >= rp and rp >= rq and rq >= rr ){ lb = q; } else{ assert( false ); } } ll x, min_ugliness = 1LL << 61; for( ll t = lb; t <= rb; ++t ){ if( upmin( min_ugliness, calc( t ) ) ){ x = t; } } lb = 1LL, rb = x; ll ans = x; for( ; lb <= rb; ){ ll mid = ( lb + rb ) / 2; if( calc( mid ) == min_ugliness ){ ans = mid; rb = mid - 1; } else{ lb = mid + 1; } } cout << ans << endl; } signed main(){ ios::sync_with_stdio( 0 ); init(); preprocess(); solve(); return 0; }