結果
問題 | No.2953 Maximum Right Triangle |
ユーザー |
![]() |
提出日時 | 2024-11-08 21:39:48 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 11,458 bytes |
コンパイル時間 | 5,072 ms |
コンパイル使用メモリ | 311,908 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-11-08 21:40:01 |
合計ジャッジ時間 | 5,509 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 6 |
ソースコード
#include <bits/stdc++.h>#include <atcoder/all>using namespace std;#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#define INT(...)\int __VA_ARGS__;\IN(__VA_ARGS__)#define LL(...)\ll __VA_ARGS__;\IN(__VA_ARGS__)#define STR(...)\string __VA_ARGS__;\IN(__VA_ARGS__)#define CHR(...)\char __VA_ARGS__;\IN(__VA_ARGS__)#define DBL(...)\double __VA_ARGS__;\IN(__VA_ARGS__)#define ll long long#define yes cout<<"Yes"<<"\n"#define no cout<<"No"<<"\n"#define rep(i,a,b) for(int i=a;i<b;i++)#define rrep(i,a,b) for(int i=a;i>=b;i--)#define fore(i,a) for(auto &i:a)#define all(x) (x).begin(),(x).end()#define allr(x) (x).rbegin(),(x).rend()#define SUM(v) accumulate(all(v), 0LL)#define MIN(v) *min_element(all(v))#define MAX(v) *max_element(all(v))#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))#define pii pair<int, int>#define pll pair<long long,long long>#define pb push_back#define eb emplace_back#define ff first#define ss second#define vi vector<int>#define vll vector<long long>#define vc vector<char>#define vvi vector<vector<int>>#define vec(type, name, ...) vector<type> name(__VA_ARGS__)#define VEC(type, name, size)\vector<type> name(size);\IN(name)int scan() { return getchar(); }void scan(int &a) { cin >> a; }void scan(long long &a) { cin >> a; }void scan(char &a) { cin >> a; }void scan(double &a) { cin >> a; }void scan(string &a) { cin >> a; }template <class T, class S> void scan(pair<T, S> &p) { scan(p.first), scan(p.second); }template <class T> void scan(vector<T> &);template <class T> void scan(vector<T> &a) {for(auto &i : a) scan(i);}template <class T> void scan(T &a) { cin >> a; }void IN() {}template <class Head, class... Tail> void IN(Head &head, Tail &...tail) {scan(head);IN(tail...);}template <class T> void print(const T &a) { cout << a; }void OUT() { cout << endl; }template <class Head, class... Tail> void OUT(const Head &head, const Tail &...tail) {print(head);if(sizeof...(tail)) cout << ' ';OUT(tail...);}#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))#define VV(type, name, h, w)\vector<vector<type>> name(h, vector<type>(w));\IN(name)#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))#define vvvv(type, name, a, b, c, ...)\vector<vector<vector<vector<type>>>> name(a, vector<vector<vector<type>>>(b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;template <class T> pair<T, T> operator-(const pair<T, T> &x, const pair<T, T> &y) { return pair<T, T>(x.ff - y.ff, x.ss - y.ss); }template <class T> pair<T, T> operator+(const pair<T, T> &x, const pair<T, T> &y) { return pair<T, T>(x.ff + y.ff, x.ss + y.ss); }template <class T> pair<T, T> operator&(const pair<T, T> &l, const pair<T, T> &r) { return pair<T, T>(max(l.ff, r.ff), min(l.ss, r.ss)); }template <class T> vector<T> &operator--(vector<T> &v) {fore(e, v) e--;return v;}template <class T> vector<T> operator--(vector<T> &v, int) {auto res = v;fore(e, v) e--;return res;}template <class T> vector<T> &operator++(vector<T> &v) {fore(e, v) e++;return v;}template <class T> vector<T> operator++(vector<T> &v, int) {auto res = v;fore(e, v) e++;return res;}template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())//座標圧縮template <typename T> void zip(vector<T> &x) {vector<T> y = x;UNIQUE(y);for(int i = 0; i < x.size(); ++i) { x[i] = lb(y, x[i]); }}template <class T> T ceil(T x, T y) {assert(y >= 1);return (x > 0 ? (x + y - 1) / y : x / y);}template <class T> T floor(T x, T y) {assert(y >= 1);return (x > 0 ? x / y : (x + y - 1) / y);}long long POW(long long x, int n) {long long res = 1LL;for(; n; n >>= 1, x *= x)if(n & 1) res *= x;return res;}//0^n=0long long modpow(long long a, long long n, long long mod) {a%=mod;assert(a!=0||n!=0);if(a==0)return 0;long long res = 1;while (n > 0) {if (n & 1) res = res * a % mod;a = a * a % mod;n >>= 1;}return res;}//return 0<=a&&a<h&&0<=b&&b<w;inline bool ingrid(ll a,ll b,ll h,ll w){return 0<=a&&a<h&&0<=b&&b<w;}//return 0<=a&&a<n;inline bool inl(int a,int n){return 0<=a&&a<n;}// bit 演算系ll pow2(int i) { return 1LL << i; }int topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }int topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }int lowbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }int lowbit(ll a) { return a == 0 ? 64 : __builtin_ctzll(a); }// int allbit(int n) { return (1 << n) - 1; }ll allbit(ll n) { return (1LL << n) - 1; }int popcount(signed t) { return __builtin_popcount(t); }int popcount(ll t) { return __builtin_popcountll(t); }bool ispow2(int i) { return i && (i & -i) == i; }int in() {int x;cin >> x;return x;}ll lin() {unsigned long long x;cin >> x;return x;}long long sqrtll(long long x) {assert(x >= 0);long long rev = sqrt(x);while(rev * rev > x) --rev;while((rev+1) * (rev+1)<=x) ++rev;return rev;}int logN(long long n){int ret=1;while((1LL<<ret)<n)ret++;return ret;}const double PI=3.1415926535897932384626433832795028841971;const ll MOD998 = 998244353;const int INFI = numeric_limits<int>::max() / 2; const long long INFL = numeric_limits<long long>::max() / 2;#define inf INFINITYtemplate<class T>void debug(vector<T> a){rep(i,0,(int)a.size()){cout<<a[i]<<' ';}cout<<endl;return;}bool palindrome(const string& s){return equal(all(s),s.rbegin());}template <std::uint_fast64_t Modulus> class modint {using u64 = std::uint_fast64_t;public:u64 a;constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}constexpr u64 &val() noexcept { return a; }constexpr const u64 &val() const noexcept { return a; }constexpr modint operator+(const modint rhs) const noexcept {return modint(*this) += rhs;}constexpr modint operator-(const modint rhs) const noexcept {return modint(*this) -= rhs;}constexpr modint operator*(const modint rhs) const noexcept {return modint(*this) *= rhs;}constexpr modint operator/(const modint rhs) const noexcept {return modint(*this) /= rhs;}constexpr modint &operator+=(const modint rhs) noexcept {a += rhs.a;if (a >= Modulus) {a -= Modulus;}return *this;}constexpr modint &operator-=(const modint rhs) noexcept {if (a < rhs.a) {a += Modulus;}a -= rhs.a;return *this;}constexpr modint &operator*=(const modint rhs) noexcept {a = a * rhs.a % Modulus;return *this;}constexpr modint &operator/=(modint rhs) noexcept {u64 exp = Modulus - 2;while (exp) {if (exp % 2) {*this *= rhs;}rhs *= rhs;exp /= 2;}return *this;}friend bool operator==(const modint& a,const modint& b) { return a.val()==b.val(); }friend bool operator!=(const modint& a,const modint& b) { return a.val()!=b.val(); }};using mint9=modint<998244353>;using mint1=modint<1000000007>;//基本的にcostを指定しないと重みなし辺になりますstruct Edge{int from,to;ll cost;Edge()=default;Edge(int from,int to,ll cost=1):from(from),to(to),cost(cost){}operator int() const {return to;}};constexpr pii dx4[4] = {pii{-1, 0},pii{0, -1}, pii{0, 1}, pii{1, 0} };constexpr pii dx8[8] = {{1, 0}, {1, 1}, {0, 1}, {-1, 1}, {-1, 0}, {-1, -1}, {0, -1}, {1, -1}};constexpr pii dx[100]={{2,1},{1,2},{-1,2},{-2,1},{-2,-1},{-1,-2},{1,-2},{2,-1}};#define el "\n"#define endl "\n"#define fastio std::cin.sync_with_stdio(false);std::cin.tie(nullptr),cout<<fixed<<setprecision(16);int main(){fastioINT(t);while(t--){LL(d,a,b);pll A={a,b};auto f=[](pll a,pll b)->ll {return abs(a.ff*b.ss-a.ss*b.ff);};ll ans=0;{ll ng=INFI,ok=0;ll g=gcd(a,b);a/=g;b/=g;while(abs(ok-ng)>1){ll mid=(ok+ng)/2;ll x=A.ff-b*mid;ll y=A.ss+a*mid;if(ingrid(x,y,d+1,d+1))ok=mid;else ng=mid;}ll x=A.ff-b*ok;ll y=A.ss+a*ok;chmax(ans,f(A,pll(x,y)));}{ll ng=INFI,ok=0;while(abs(ok-ng)>1){ll mid=(ok+ng)/2;ll x=A.ff+b*mid;ll y=A.ss-a*mid;if(ingrid(x,y,d+1,d+1))ok=mid;else ng=mid;}ll x=A.ff-b*ok;ll y=A.ss+a*ok;chmax(ans,f(A,pll(x,y)));}OUT(ans);}return 0;}/**/