結果
問題 | No.180 美しいWhitespace (2) |
ユーザー |
![]() |
提出日時 | 2018-09-10 17:22:44 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 29 ms / 5,000 ms |
コード長 | 2,176 bytes |
コンパイル時間 | 1,881 ms |
コンパイル使用メモリ | 170,124 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-12-30 03:28:17 |
合計ジャッジ時間 | 3,896 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 31 |
ソースコード
#include "bits/stdc++.h" using namespace std; typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; const int INF = 1e9; const ll LINF = 1e18; template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; } template<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; } template<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; } template<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; } /* <url:https://yukicoder.me/problems/no/180> 問題文============================================================ ================================================================= 解説============================================================= ================================================================ */ ll f(ll m,vector<ll>& a,vector<ll>& b){ ll minv = LINF,maxv = 0; for(int i = 0; i < a.size();i++){ ll c = a[i] + b[i]*m; minv = min(minv,c); maxv = max(maxv,c); } return maxv - minv; } ll solve(){ ll res = 0; int N; cin >> N; vector<ll> a(N),b(N); for(int i = 0; i < N;i++) cin >> a[i] >> b[i]; ll l = 1, r = INF; for(int kassa = 0; kassa < 10000;kassa++){ ll ml = (r-l)/3 + l; ll mr = (r-l)*2/3 + l; ll fl = f(ml,a,b); ll fr = f(mr,a,b); if(fl <= fr){ r = mr; }else{ l = ml; } } ll V = LINF; res = LINF; for(ll m = l; m <= r;m++){ ll F = f(m,a,b); if(F < V){ res = m; V = F; } } return res; } int main(void) { cin.tie(0); ios_base::sync_with_stdio(false); cout << solve() << endl; return 0; }