結果
| 問題 | No.2953 Maximum Right Triangle |
| ユーザー |
👑  AngrySadEight
|
| 提出日時 | 2024-11-08 21:47:48 |
| 言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 3 ms / 2,000 ms |
| コード長 | 3,958 bytes |
| コンパイル時間 | 20,125 ms |
| コンパイル使用メモリ | 258,868 KB |
| 最終ジャッジ日時 | 2025-02-25 02:42:20 |
|
ジャッジサーバーID （参考情報） |
judge5 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 6 |
ソースコード
#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include <algorithm>#include <atcoder/all>#include <bitset>#include <cassert>#include <cmath>#include <ctime>#include <functional>#include <iomanip>#include <iostream>#include <map>#include <queue>#include <random>#include <set>#include <stack>#include <string>#include <tuple>#include <unordered_map>#include <unordered_set>#include <utility>#include <vector>using namespace std;using namespace atcoder;typedef long long ll;#define rep(i, n) for (int i = 0; i < (int)(n); i++)#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)#define repk(i, k, n) for (int i = k; i < (int)(n); i++)#define all(v) v.begin(), v.end()#define mod1 1000000007#define mod2 998244353#define mod3 100000007#define vi vector<int>#define vs vector<string>#define vc vector<char>#define vl vector<ll>#define vb vector<bool>#define vvi vector<vector<int>>#define vvc vector<vector<char>>#define vvl vector<vector<ll>>#define vvb vector<vector<bool>>#define vvvi vector<vector<vector<int>>>#define vvvl vector<vector<vector<ll>>>#define pii pair<int, int>#define pil pair<int, ll>#define pli pair<ll, int>#define pll pair<ll, ll>#define vpii vector<pair<int, int>>#define vpll vector<pair<ll, ll>>#define vvpii vector<vector<pair<int, int>>>#define vvpll vector<vector<pair<ll, ll>>>template <typename T>void debug(T e) {cerr << e << endl;}template <typename T>void debug(vector<T> &v) {rep(i, v.size()) { cerr << v[i] << " "; }cerr << endl;}template <typename T>void debug(vector<vector<T>> &v) {rep(i, v.size()) {rep(j, v[i].size()) { cerr << v[i][j] << " "; }cerr << endl;}}template <typename T>void debug(vector<pair<T, T>> &v) {rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }}template <typename T>void debug(set<T> &st) {for (auto itr = st.begin(); itr != st.end(); itr++) {cerr << *itr << " ";}cerr << endl;}template <typename T>void debug(multiset<T> &ms) {for (auto itr = ms.begin(); itr != ms.end(); itr++) {cerr << *itr << " ";}cerr << endl;}template <typename T>void debug(map<T, T> &mp) {for (auto itr = mp.begin(); itr != mp.end(); itr++) {cerr << itr->first << " " << itr->second << endl;}}void debug_out() { cerr << endl; }template <typename Head, typename... Tail>void debug_out(Head H, Tail... T) {cerr << H << " ";debug_out(T...);}ll my_gcd(ll a, ll b) {ll ret = 0;if (a < b) {swap(a, b);}if (b == 0) {ret = a;} else {ret = my_gcd(b, a % b);}return ret;}int main() {ll T;cin >> T;while (T--) {ll D, x, y;cin >> D >> x >> y;if (x == 0) {cout << y * D << endl;continue;} else if (y == 0) {cout << x * D << endl;continue;}ll g = my_gcd(x, y);// 左上側ll ok = 0;ll ng = D + 1;while (ng - ok > 1) {ll mid = (ok + ng) / 2;ll nx = x - mid * (y / g);ll ny = y + mid * (x / g);if (nx >= 0 && nx <= D && ny >= 0 && ny <= D) {ok = mid;} else {ng = mid;}}ll ok2 = 0;ll ng2 = D + 1;while (ng2 - ok2 > 1) {ll mid = (ok2 + ng2) / 2;ll nx = x + mid * (y / g);ll ny = y - mid * (x / g);if (nx >= 0 && nx <= D && ny >= 0 && ny <= D) {ok2 = mid;} else {ng2 = mid;}}ll lx = x + max(ok, ok2) * (y / g);ll ly = y - max(ok, ok2) * (x / g);// debug_out(lx, ly);ll ans = abs(x * ly - y * lx);cout << ans << endl;}}