#655302 (C++17) No.1501 酔歩

提出ソース

結果

問題	No.1501 酔歩
ユーザー	opt
提出日時	2021-05-07 22:56:16
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	5,859 bytes
コンパイル時間	4,483 ms
コンパイル使用メモリ	265,432 KB
実行使用メモリ	5,760 KB
最終ジャッジ日時	2024-09-15 11:02:35
合計ジャッジ時間	7,768 ms
ジャッジサーバーID （参考情報）	judge2 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,376 KB
testcase_02	AC	2 ms 5,376 KB
testcase_03	AC	2 ms 5,376 KB
testcase_04	WA	-
testcase_05	AC	39 ms 5,376 KB
testcase_06	AC	30 ms 5,376 KB
testcase_07	AC	38 ms 5,376 KB
testcase_08	AC	10 ms 5,376 KB
testcase_09	AC	32 ms 5,376 KB
testcase_10	AC	15 ms 5,376 KB
testcase_11	AC	29 ms 5,376 KB
testcase_12	AC	22 ms 5,376 KB
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	AC	50 ms 5,504 KB
testcase_23	AC	51 ms 5,632 KB
testcase_24	AC	49 ms 5,632 KB
testcase_25	AC	53 ms 5,632 KB
testcase_26	AC	50 ms 5,504 KB
testcase_27	AC	50 ms 5,632 KB
testcase_28	AC	49 ms 5,632 KB
testcase_29	AC	51 ms 5,504 KB
testcase_30	AC	52 ms 5,632 KB
testcase_31	AC	50 ms 5,632 KB
testcase_32	AC	50 ms 5,504 KB
testcase_33	AC	50 ms 5,632 KB
testcase_34	AC	48 ms 5,632 KB
testcase_35	AC	49 ms 5,504 KB
testcase_36	AC	51 ms 5,760 KB
testcase_37	AC	48 ms 5,632 KB
testcase_38	AC	51 ms 5,632 KB
testcase_39	AC	53 ms 5,632 KB
testcase_40	AC	47 ms 5,504 KB
testcase_41	WA	-
testcase_42	AC	27 ms 5,632 KB
testcase_43	WA	-
testcase_44	WA	-
testcase_45	AC	20 ms 5,760 KB
testcase_46	AC	20 ms 5,760 KB
testcase_47	AC	20 ms 5,760 KB
testcase_48	AC	32 ms 5,760 KB
testcase_49	AC	33 ms 5,632 KB
testcase_50	AC	32 ms 5,632 KB
testcase_51	AC	36 ms 5,632 KB
testcase_52	AC	33 ms 5,632 KB
testcase_53	WA	-
testcase_54	AC	2 ms 5,376 KB
testcase_55	AC	2 ms 5,376 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include<bits/stdc++.h>
using namespace std;
#include<atcoder/all>
using namespace atcoder;
// input and output of modint
istream &operator>>(istream &is, modint998244353 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint998244353 &a) { return os << a.val(); }
istream &operator>>(istream &is, modint1000000007 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint1000000007 &a) { return os << a.val(); }
template<int m> istream &operator>>(istream &is, static_modint<m> &a) { long long v; is >> v; a = v; return is; }
template<int m> ostream &operator<<(ostream &os, const static_modint<m> &a) { return os << a.val(); }
template<int m> istream &operator>>(istream &is, dynamic_modint<m> &a) { long long v; is >> v; a = v; return is; }
template<int m> ostream &operator<<(ostream &os, const dynamic_modint<m> &a) { return os << a.val(); }
#define rep_(i, a_, b_, a, b, ...) for (int i = (a), lim##i = (b); i < lim##i; ++i)
#define rep(i, ...) rep_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define drep_(i, a_, b_, a, b, ...) for (int i = (a)-1, lim##i = (b); i >= lim##i; --i)
#define drep(i, ...) drep_(i, __VA_ARGS__, __VA_ARGS__, __VA_ARGS__, 0)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#ifdef LOCAL
void debug_out() { cerr << endl; }
template <class Head, class... Tail> void debug_out(Head H, Tail... T) { cerr << ' ' << H; debug_out(T...); }
#define debug(...) cerr << 'L' << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define dump(x) cerr << 'L' << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
template<class T> using V = vector<T>;
using ll = long long;
using ld = long double;
using Vi = V<int>;  using VVi = V<Vi>;
using Vl = V<ll>;   using VVl = V<Vl>;
using Vd = V<ld>;   using VVd = V<Vd>;
using Vb = V<bool>; using VVb = V<Vb>;
template<class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
template<class T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); }
template<class... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); }
template<class T> inline int sz(const T &x) { return x.size(); }
template<class T> inline bool chmin(T &a, const T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T &a, const T b) { if (a < b) { a = b; return true; } return false; }
template<class T1, class T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.first >> p.second; return is; }
template<class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p) { os << '(' << p.first << ", " << p.second << ')'; return os; }
template<class T, size_t n> istream &operator>>(istream &is, array<T, n> &v) { for (auto &e : v) is >> e; return is; }
template<class T, size_t n> ostream &operator<<(ostream &os, const  array<T, n> &v) { for (auto &e : v) os << e << ' '; return os; }
template<class T> istream &operator>>(istream &is, vector<T> &v) { for (auto &e : v) is >> e; return is; }
template<class T> ostream &operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; }
template<class T> inline void deduplicate(vector<T> &a) { sort(all(a)); a.erase(unique(all(a)), a.end()); }
template<class T> inline int count_between(const vector<T> &a, T l, T r) { return lower_bound(all(a), r) - lower_bound(all(a), l); } // [l, r)
inline ll ceil_div(const ll x, const ll y) { return (x+y-1) / y; } // ceil(x/y)
inline int floor_log2(const ll x) { assert(x > 0); return 63-__builtin_clzll(x); } // floor(log2(x))
inline int ceil_log2(const ll x) { assert(x > 0); return (x == 1) ? 0 : 64-__builtin_clzll(x-1); } // ceil(log2(x))
inline int popcount(const ll x) { return __builtin_popcountll(x); }
inline void fail() { cout << -1 << '\n'; exit(0); }
struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
// const int INF  = (1<<30) - 1;
// const ll INFll = (1ll<<60) - 1;
// const ld EPS   = 1e-10;
// const ld PI    = acos(-1.0);
// using mint = modint998244353;
// using mint = modint1000000007;
// using mint = modint;
// using Vm = V<mint>; using VVm = V<Vm>;



template<class T>
struct rational {
  T p, q;
  rational(T _p = 0, T _q = 1, bool red = true) : p(_p), q(_q) {
    if (q != 1 && red) reduce(p, q);
  }
  void reduce(T &a, T &b) {
    T g = gcd(a, b);
    a /= g, b /= g;
    if (b < 0) a = -a, b = -b;
    else if (a < 0 && b == 0) a = -a;
  }
  bool operator<(const rational &r) const { return p * r.q < r.p * q; }
  rational& operator+=(const rational &r) { p = p * r.q + r.p * q, q *= r.q; reduce(p, q); return *this; }
  rational& operator-=(const rational &r) { p = p * r.q - r.p * q, q *= r.q; reduce(p, q); return *this; }
  rational& operator*=(const rational &r) { p *= r.p, q *= r.q; reduce(p, q); return *this; }
  rational& operator/=(const rational &r) { p *= r.q, q *= r.p; reduce(p, q); return *this; }
  rational operator+(const rational &r) const { return rational(*this) += r; }
  rational operator-(const rational &r) const { return rational(*this) -= r; }
  rational operator*(const rational &r) const { return rational(*this) *= r; }
  rational operator/(const rational &r) const { return rational(*this) /= r; }
};
template<class T> ostream &operator<<(ostream &os, const rational<T> &a) { return os << a.p << '/' << a.q; }

using rat = rational<ll>;


void solve() {
  int n, k; cin >> n >> k;
  Vl a(n); cin >> a;

  V<rat> x(n);
  x[1] = 1;

  rep(i, 2, n) x[i] = x[i-1] * rat{a[i-2]+a[i], a[i]} - x[i-2] * rat{a[i-2], a[i]};
  auto ans = x[k-1] / x[n-1];

  if (ans.p == 0) cout << 0 << '\n';
  else cout << ans << '\n';
}


int main() {
  solve();
}

yukicoder

結果

テストケース

ソースコード