結果
問題 | No.2953 Maximum Right Triangle |
ユーザー |
![]() |
提出日時 | 2024-11-08 22:14:20 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 3,034 bytes |
コンパイル時間 | 5,389 ms |
コンパイル使用メモリ | 307,880 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-11-08 22:14:28 |
合計ジャッジ時間 | 5,093 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 6 |
ソースコード
#include <bits/stdc++.h>using namespace std;#if __has_include(<atcoder/all>)#include <atcoder/all>#endifusing ll=long long;using ull=unsigned long long;using P=pair<ll,ll>;template<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;template<typename T>bool chmax(T &a,const T &b){return (a<b?(a=b,true):false);}template<typename T>bool chmin(T &a,const T &b){return (a>b?(a=b,true):false);}template<typename T1,typename T2>istream &operator>>(istream &is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}template<typename T>istream &operator>>(istream &is,vector<T> &a){for(auto &i:a)is>>i;return is;}template<typename T1,typename T2>void operator++(pair<T1,T2>&a,int n){a.first++,a.second++;}template<typename T1,typename T2>void operator--(pair<T1,T2>&a,int n){a.first--,a.second--;}template<typename T>void operator++(vector<T>&a,int n){for(auto &i:a)i++;}template<typename T>void operator--(vector<T>&a,int n){for(auto &i:a)i--;}#define reps(i,a,n) for(int i=(a);i<int(n);i++)#define rep(i,n) reps(i,0,n)#define all(x) x.begin(),x.end()#define pcnt(x) __builtin_popcountll(x)#define fin(x) return cout<<x<<'\n',static_cast<void>(0)ll myceil(ll a,ll b){return (a+b-1)/b;}template<typename T,size_t n,size_t id=0>auto vec(const int (&d)[n],const T &init=T()){if constexpr (id<n)return vector(d[id],vec<T,n,id+1>(d,init));else return init;}#ifdef LOCAL#include<debug.h>#else#define debug(...) static_cast<void>(0)#define debugg(...) static_cast<void>(0)template<typename T1,typename T2>ostream &operator<<(ostream &os,const pair<T1,T2>&p){os<<p.first<<' '<<p.second;return os;}#endifvoid SOLVE();int main(){ios::sync_with_stdio(false);cin.tie(nullptr);cout<<fixed<<setprecision(16);#ifdef LOCALclock_t start=clock();#endifint testcase=1;cin>>testcase;for(int i=0;i<testcase;i++){SOLVE();}#ifdef LOCALcerr<<"time:";cerr<<(clock()-start)/1000;cerr<<"ms\n";#endif}#include<type_traits>template<typename T,std::enable_if_t<std::is_integral_v<T>,std::nullptr_t> =nullptr,typename Func>T bin_search(T ok,T ng,const Func&f){while(std::abs(ok-ng)>1){T mid=(ok&ng)+((ok^ng)>>1);(f(mid)?ok:ng)=mid;}return ok;}template<typename T,std::enable_if_t<std::is_floating_point_v<T>,int> loop=100,typename Func>T bin_search(T ok,T ng,const Func&f){for(int i=0;i<loop;i++){T mid=(ok+ng)/2;(f(mid)?ok:ng)=mid;}return ok;}void SOLVE(){ll d,x,y;cin>>d>>x>>y;auto is_ok=[&](ll a,ll b)->bool {return 0<=a&&a<=d&&0<=b&&b<=d;};ll g=gcd(x,y);ll gx=x/g;ll gy=y/g;auto cross=[&](ll ax,ll ay,ll bx,ll by){return ax*by-ay*bx;};ll ans=0;{ll dx=bin_search<ll>(0,d+1,[&](ll v)->bool {return is_ok(x+v*gy,y-gx*v);});debug(dx);chmax(ans,abs(cross(x,y,x+dx*gy,y-dx*gx)));}{ll dx=bin_search<ll>(0,d+1,[&](ll v)->bool {return is_ok(x-v*gy,y+gx*v);});debug(dx);chmax(ans,abs(cross(x,y,x-dx*gy,y+dx*gx)));}cout<<ans<<'\n';}