結果

問題 No.1220 yukipoker
ユーザー 👑 hitonanodehitonanode
提出日時 2020-09-04 21:31:06
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 57 ms / 2,000 ms
コード長 4,411 bytes
コンパイル時間 2,056 ms
コンパイル使用メモリ 200,416 KB
実行使用メモリ 11,292 KB
最終ジャッジ日時 2023-08-17 15:02:08
合計ジャッジ時間 4,512 ms
ジャッジサーバーID
(参考情報)
judge14 / judge11
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 22 ms
11,040 KB
testcase_01 AC 22 ms
10,752 KB
testcase_02 AC 21 ms
10,764 KB
testcase_03 AC 21 ms
10,684 KB
testcase_04 AC 22 ms
10,796 KB
testcase_05 AC 22 ms
10,804 KB
testcase_06 AC 21 ms
10,800 KB
testcase_07 AC 21 ms
10,752 KB
testcase_08 AC 23 ms
10,744 KB
testcase_09 AC 22 ms
10,744 KB
testcase_10 AC 22 ms
10,732 KB
testcase_11 AC 38 ms
10,692 KB
testcase_12 AC 39 ms
10,776 KB
testcase_13 AC 55 ms
10,844 KB
testcase_14 AC 54 ms
10,732 KB
testcase_15 AC 42 ms
11,292 KB
testcase_16 AC 46 ms
10,748 KB
testcase_17 AC 34 ms
10,780 KB
testcase_18 AC 38 ms
10,856 KB
testcase_19 AC 56 ms
10,700 KB
testcase_20 AC 57 ms
10,748 KB
testcase_21 AC 22 ms
10,744 KB
testcase_22 AC 21 ms
10,700 KB
testcase_23 AC 21 ms
10,780 KB
testcase_24 AC 21 ms
10,760 KB
testcase_25 AC 21 ms
10,716 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template <typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template <typename V, typename T> void ndfill(V &x, const T &val) { x = val; }
template <typename V, typename T> void ndfill(vector<V> &vec, const T &val) { for (auto &v : vec) ndfill(v, val); }
template <typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template <typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template <typename T> vector<T> srtunq(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
#if __cplusplus >= 201703L
template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os; }
#endif
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl
#else
#define dbg(x)
#endif

constexpr double minusloginf = 300;
vector<double> logfac;
void facInit(int nmax)
{
    logfac = vector<double>(nmax + 1, 0);
    for (int i = 2; i <= nmax; i++)
    {
        logfac[i] = logfac[i - 1] + log(i);
    }
}
double lognCr(lint n, lint r)
{
    if (n<r || r<0) return minusloginf;
    return logfac[n] - logfac[r] - logfac[n - r];
}

bool solve(int N, int M, int K)
{
    double pf = lognCr(N, K) + log(M);
    double ps = log(N - K + 1) + log(M) * K;
    return pf < ps;
}

int main()
{
    int Q;
    cin >> Q;
    facInit(1e6);
    while (Q--)
    {
        int N, M, K;
        cin >> N >> M >> K;
        cout << (solve(N, M, K) ? "Flush" : "Straight") << '\n';
    }
}
0