結果
問題 | No.2420 Simple Problem |
ユーザー | 👑 seekworser |
提出日時 | 2023-08-12 15:39:00 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 13,004 bytes |
コンパイル時間 | 2,245 ms |
コンパイル使用メモリ | 204,488 KB |
実行使用メモリ | 6,824 KB |
最終ジャッジ日時 | 2024-11-20 03:45:00 |
合計ジャッジ時間 | 8,122 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,820 KB |
testcase_01 | WA | - |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | AC | 1 ms
6,816 KB |
testcase_33 | WA | - |
ソースコード
//line 1 "answer.cpp" #if !__INCLUDE_LEVEL__ #include __FILE__ int solve() { ll a,b; input(a,b); auto le = [&] (ll x) -> bool { __int128_t xi = x; __int128_t ai = a; __int128_t bi = a; if (xi * xi - ai - bi < 0) return true; __int128_t lhs = ai * bi * 4; __int128_t rhs = (xi*xi - ai - bi) * (xi *xi-ai-bi); return lhs >= rhs; }; rep(i, 10) debug(i, le(i), a, b); print(binsearch<ll>(0, powm(10, 5), le) + 1); return 0; } int main() { ll n; input(n); rep(n) solve(); } #else //line 2 "/home/fujisawa/atcoder/competitive_library/competitive/std/std.hpp" #include <bits/stdc++.h> #ifndef LOCAL_TEST #pragma GCC target ("avx") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") #endif // LOCAL_TEST using namespace std; // 型名の短縮 using ll = long long; using pii = pair<int, int>; using pll = pair<ll, ll>; using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>; using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>; using vb = vector<bool>; using vvb = vector<vb>; using vvvb = vector<vvb>; using vc = vector<char>; using vvc = vector<vc>; using vvvc = vector<vvc>; using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>; using vs = vector<string>; using vvs = vector<vector<string>>; using vvvs = vector<vector<vector<string>>>; template<typename T> vector<vector<T>> vv(int h, int w, T val = T()) { return vector(h, vector<T>(w, val)); } template<typename T> vector<vector<vector<T>>> vvv(int h1, int h2, int h3, T val = T()) { return vector(h1, vector(h2, vector<T>(h3, val))); } template<typename T> vector<vector<vector<vector<T>>>> vvvv(int h1, int h2, int h3, int h4, T val = T()) { return vector(h1, vector(h2, vector(h3, vector<T>(h4, val)))); } template <class T> using priority_queue_min = priority_queue<T, vector<T>, greater<T>>; // 定数の定義 constexpr double PI = 3.14159265358979323; constexpr int INF = 100100111; constexpr ll INFL = 3300300300300300491LL; float EPS = 1e-8; double EPSL = 1e-16; template<typename T> bool eq(const T x, const T y) { return x == y; } template<> bool eq<double>(const double x, const double y) { return abs(x - y) < EPSL; } template<> bool eq<float>(const float x, const float y) { return abs(x - y) < EPS; } template<typename T> bool neq(const T x, const T y) { return !(eq<T>(x, y)); } template<typename T> bool ge(const T x, const T y) { return (eq<T>(x, y) || (x > y)); } template<typename T> bool le(const T x, const T y) { return (eq<T>(x, y) || (x < y)); } template<typename T> bool gt(const T x, const T y) { return !(le<T>(x, y)); } template<typename T> bool lt(const T x, const T y) { return !(ge<T>(x, y)); } constexpr int MODINT998244353 = 998244353; constexpr int MODINT1000000007 = 1000000007; // 入出力高速化 struct Nyan { Nyan() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } nyan; // 汎用マクロの定義 #define all(a) (a).begin(), (a).end() #define sz(x) ((ll)(x).size()) #define rep1(n) for(ll dummy_iter = 0LL; dummy_iter < n; ++dummy_iter) // 0 から n-1 まで昇順 #define rep2(i, n) for(ll i = 0LL, i##_counter = 0LL; i##_counter < ll(n); ++(i##_counter), (i) = i##_counter) // 0 から n-1 まで昇順 #define rep3(i, s, t) for(ll i = ll(s), i##_counter = ll(s); i##_counter < ll(t); ++(i##_counter), (i) = (i##_counter)) // s から t まで昇順 #define rep4(i, s, t, step) for(ll i##_counter = step > 0 ? ll(s) : -ll(s), i##_end = step > 0 ? ll(t) : -ll(t), i##_step = abs(step), i = ll(s); i##_counter < i##_end; i##_counter += i##_step, i = step > 0 ? i##_counter : -i##_counter) // s から t まで stepずつ #define overload4(a, b, c, d, e, ...) e #define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__) #define repe(a, v) for(auto& a : (v)) // v の全要素(変更可能) #define smod(n, m) ((((n) % (m)) + (m)) % (m)) // 非負mod #define sdiv(n, m) (((n) - smod(n, m)) / (m)) // 非負div #define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} // 重複除去 int Yes(bool b=true) { cout << (b ? "Yes\n" : "No\n"); return 0; }; int YES(bool b=true) { cout << (b ? "YES\n" : "NO\n"); return 0; }; int No(bool b=true) {return Yes(!b);}; int NO(bool b=true) {return YES(!b);}; template<typename T, size_t N> T max(array<T, N>& a) { return *max_element(all(a)); }; template<typename T, size_t N> T min(array<T, N>& a) { return *min_element(all(a)); }; template<typename T> T max(vector<T>& a) { return *max_element(all(a)); }; template<typename T> T min(vector<T>& a) { return *min_element(all(a)); }; template<typename T> vector<T> vec_slice(const vector<T>& a, int l, int r) { vector<T> rev; rep(i, l, r) rev.push_back(a[i]); return rev; }; template<typename T> T sum(vector<T>& a, T zero = T(0)) { T rev = zero; rep(i, sz(a)) rev += a[i]; return rev; }; template<typename T> bool in_range(const T& val, const T& s, const T& t) { return s <= val && val < t; }; template <class T> inline vector<T>& operator--(vector<T>& v) { repe(x, v) --x; return v; } template <class T> inline vector<T>& operator++(vector<T>& v) { repe(x, v) ++x; return v; } // modでのpow ll powm(ll a, ll n, ll mod=INFL) { ll res = 1; while (n > 0) { if (n & 1) res = (res * a) % mod; if (n > 1) a = (a * a) % mod; n >>= 1; } return res; } // 整数Sqrt ll sqrtll(ll x) { assert(x >= 0); ll rev = sqrt(x); while(rev * rev > x) --rev; while((rev+1) * (rev+1)<=x) ++rev; return rev; } template <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // 最大値を更新(更新されたら true を返す) template <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // 最小値を更新(更新されたら true を返す) int digit(ll x, int d=10) { int rev=0; while (x > 0) { rev++; x /= d;}; return rev; } // xのd進数桁数 /** * @brief std.hpp * @docs docs/std/std.md */ //line 3 "/home/fujisawa/atcoder/competitive_library/competitive/math/binsearch.hpp" //s~eでle(ans) = trueとなる最大のansを返す template <class T, class F> T binsearch(T s, T e, F le) { T cmin = s; T cmax = e; while (cmin != cmax) { T p = (cmin + cmax + 1) / 2; if (le(p)) cmin = p; else cmax = p - 1; } return cmin; } //s~eでle(ans) = trueとなる最大のansを返す template <class F> double binsearch_double(double s, double e, F le, double eps=1e-10) { double cmin = s; double cmax = e; while (abs(cmax - cmin) > eps * cmax && abs(cmax - cmin) > eps) { double p = (cmin + cmax) / 2; if (le(p)) cmin = p; else cmax = p; } return cmin; } //s~eで高々1つしか極値を持たないfについて極値を与える点を返す template <class T, class F> T ternary_search(T s, T e, F f, double eps=1e-10) { T cmin = s; T cmax = e; while (cmax - cmin > (T)3) { T p1 = cmin + max<T>(1, (cmax - cmin) / 3); T p2 = cmax - max<T>(1, (cmax - cmin) / 3); if (f(p1) > f(p2)) cmin = p1; else cmax = p2; } T rev = cmin; auto val = f(cmin); rep(i, 4) { if (chmin<T>(val, f(cmin+i))) rev = cmin + i; } return rev; } //s~eで高々1つしか極値を持たないfについて極値を与える点を返す template <class F> double ternary_search_double(double s, double e, F f, double eps=1e-10) { double cmin = s; double cmax = e; while (abs(cmax - cmin) > eps) { double p1 = cmin + (cmax - cmin) / 3; double p2 = cmax - (cmax - cmin) / 3; if (f(p1) > f(p2)) cmin = p1; else cmax = p2; } return cmin; } /** * @brief binsearch.hpp * @docs docs/math/binsearch.md */ //line 3 "/home/fujisawa/atcoder/competitive_library/competitive/std/io.hpp" // 演算子オーバーロード(プロトタイプ宣言) template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p); template <class T> inline istream& operator>>(istream& is, vector<T>& v); template <class T, class U> inline ostream& operator<<(ostream& os, const pair<T, U>& p); template <class T> inline ostream& operator<<(ostream& os, const vector<T>& v); template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp); template <typename T> ostream &operator<<(ostream &os, const set<T> &st); template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st); template <typename T> ostream &operator<<(ostream &os, const unordered_set<T> &st); template <typename T> ostream &operator<<(ostream &os, queue<T> q); template <typename T> ostream &operator<<(ostream &os, deque<T> q); template <typename T> ostream &operator<<(ostream &os, stack<T> st); template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq); // 演算子オーバーロード template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; } template <class T> inline istream& operator>>(istream& is, vector<T>& v) { repe(x, v) is >> x; return is; } template <class T, class U> inline ostream& operator<<(ostream& os, const pair<T, U>& p) { os << p.first << " " << p.second; return os; } template <class T> inline ostream& operator<<(ostream& os, const vector<T>& v) { rep(i, sz(v)) { os << v.at(i); if (i != sz(v) - 1) os << " "; } return os; } template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp) { for (auto &[key, val] : mp) { os << key << ":" << val << " "; } return os; } template <typename T> ostream &operator<<(ostream &os, const set<T> &st) { auto itr = st.begin(); for (int i = 0; i < (int)st.size(); i++) { os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; } template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st) { auto itr = st.begin(); for (int i = 0; i < (int)st.size(); i++) { os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; } template <typename T> ostream &operator<<(ostream &os, const unordered_set<T> &st) { ll cnt = 0; for (auto &e : st) { os << e << (++cnt != (int)st.size() ? " " : ""); } return os; } template <typename T> ostream &operator<<(ostream &os, queue<T> q) { while (q.size()) { os << q.front() << " "; q.pop(); } return os; } template <typename T> ostream &operator<<(ostream &os, deque<T> q) { while (q.size()) { os << q.front() << " "; q.pop_front(); } return os; } template <typename T> ostream &operator<<(ostream &os, stack<T> st) { while (st.size()) { os << st.top() << " "; st.pop(); } return os; } template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq) { while (pq.size()) { os << pq.top() << " "; pq.pop(); } return os; } template <typename T> int print_sep_end(string sep, string end, const T& val) { (void)sep; cout << val << end; return 0; }; template <typename T1, typename... T2> int print_sep_end(string sep, string end, const T1 &val, const T2 &...remain) { cout << val << sep; print_sep_end(sep, end, remain...); return 0; }; template <typename... T> int print(const T &...args) { print_sep_end(" ", "\n", args...); return 0; }; template <typename... T> void flush() { cout << flush; }; template <typename... T> int print_and_flush(const T &...args) { print(args...); flush(); return 0; }; #define debug(...) debug_func(0, #__VA_ARGS__, __VA_ARGS__) // debug print template <typename T> void input(T &a) { cin >> a; }; template <typename T1, typename... T2> void input(T1&a, T2 &...b) { cin >> a; input(b...); }; #ifdef LOCAL_TEST template <typename T> void debug_func(int i, const T name) { (void)i; (void)name; cerr << endl; } template <typename T1, typename T2, typename... T3> void debug_func(int i, const T1 &name, const T2 &a, const T3 &...b) { int scope = 0; for ( ; (scope != 0 || name[i] != ',') && name[i] != '\0'; i++ ) { cerr << name[i]; if (name[i] == '(' || name[i] == '{') scope++; if (name[i] == ')' || name[i] == '}') scope--; } cerr << ":" << a << " "; debug_func(i + 1, name, b...); } template <typename T1, typename T2, typename... T3> void debug_func(int i, const T1 &name, T2 &a, T3 &...b) { int scope = 0; for ( ; (scope != 0 || name[i] != ',') && name[i] != '\0'; i++ ) { cerr << name[i]; if (name[i] == '(' || name[i] == '{') scope++; if (name[i] == ')' || name[i] == '}') scope--; } cerr << ":" << a << " "; debug_func(i + 1, name, b...); } #endif #ifndef LOCAL_TEST template <typename... T> void debug_func(T &...) {} template <typename... T> void debug_func(const T &...) {} #endif /** * @brief io.hpp * @docs docs/std/io.md */ //line 28 "answer.cpp" #endif