#548405 (C++17) No.1220 yukipoker

• 問題: No.1220 yukipoker
• ユーザー: minato
• 提出日時: 2020-09-05 08:46:23
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 35 ms / 2,000 ms
• コード長: 2,835 bytes
• コンパイル時間: 3,337 ms
• コンパイル使用メモリ: 217,736 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-11-27 17:14:04
• 合計ジャッジ時間: 4,734 ms
• ジャッジサーバーID （参考情報）: judge2 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	4 ms; 5,248 KB
testcase_01	AC	3 ms; 5,248 KB
testcase_02	AC	4 ms; 5,248 KB
testcase_03	AC	4 ms; 5,248 KB
testcase_04	AC	3 ms; 5,248 KB
testcase_05	AC	4 ms; 5,248 KB
testcase_06	AC	4 ms; 5,248 KB
testcase_07	AC	4 ms; 5,248 KB
testcase_08	AC	4 ms; 5,248 KB
testcase_09	AC	4 ms; 5,248 KB
testcase_10	AC	4 ms; 5,248 KB
testcase_11	AC	17 ms; 5,248 KB
testcase_12	AC	19 ms; 5,248 KB
testcase_13	AC	34 ms; 5,248 KB
testcase_14	AC	35 ms; 5,248 KB
testcase_15	AC	22 ms; 5,248 KB
testcase_16	AC	25 ms; 5,248 KB
testcase_17	AC	16 ms; 5,248 KB
testcase_18	AC	20 ms; 5,248 KB
testcase_19	AC	34 ms; 5,248 KB
testcase_20	AC	34 ms; 5,248 KB
testcase_21	AC	4 ms; 5,248 KB
testcase_22	AC	4 ms; 5,248 KB
testcase_23	AC	4 ms; 5,248 KB
testcase_24	AC	4 ms; 5,248 KB
testcase_25	AC	4 ms; 5,248 KB

ソースコード

#pragma GCC target("avx2,avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//using i128 = __int128_t;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
constexpr char ln = '\n';
template<class T1, class T2> inline bool chmax(T1 &a, T2 b) {if (a < b) {a = b; return true;} return false;}
template<class T1, class T2> inline bool chmin(T1 &a, T2 b) {if (a > b) {a = b; return true;} return false;}
inline int topbit(int x) {return x == 0 ? -1 : 31-__builtin_clz(x);}
inline int topbit(long long x) {return x == 0 ? -1 : 63-__builtin_clzll(x);}
inline int botbit(int x) {return x == 0 ? 32 : __builtin_ctz(x);}
inline int botbit(long long x) {return x == 0 ? 64 : __builtin_ctzll(x);}
inline int popcount(int x) {return __builtin_popcount(x);}
inline int popcount(long long x) {return __builtin_popcountll(x);}
inline int kthbit(long long x, int k) {return (x>>k)&1;}
inline void print() {cout << "\n";}
template<class T>
inline void print(const vector<T> &v) {
    for (auto itr = v.begin(); itr != v.end(); ++itr) cout << *itr << " ";
    print();
}
template<class T, class... Args>
inline void print(const T &x, const Args &... args) {
    cout << x << " ";
    print(args...);
}
#ifdef MINATO_LOCAL
#define dump(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl;
inline void debug() {cerr << endl;}
template<class T>
inline void debug(const vector<T> &v) {
    for (auto itr = v.begin(); itr != v.end(); ++itr) cerr << *itr << " ";
    debug();
}
template<class T, class... Args>
inline void debug(const T &x, const Args &... args) {
    cerr << x << " ";
    debug(args...);
}
#else
#define dump(x) void(0)
inline void debug() {}
template<class T> inline void debug(const vector<T> &v) {}
template<class T, class... Args> inline void debug(const T &x, const Args &... args) {}
#endif
struct Fast_ios {Fast_ios() {cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20);};} fast_ios;
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

const int MAX = 1e5;
using DD = double;
int main() {
    vector<DD> A(MAX+1);
    for (int i = 1; i <= MAX; i++) A[i] = log(i);
    vector<DD> B(MAX+2);
    for (int i = 0; i <= MAX; i++) B[i+1] = B[i] + A[i];

    int Q; cin >> Q;
    while (Q--) {
        int N,M,K; cin >> N >> M >> K;
        DD val = A[M]*(K-1) + A[N-K+1] - B[N+1] + B[K+1] + B[N-K+1];

        cout <<  (val > 0 ? "Flush" : "Straight") << ln;
    }
}