結果
| 問題 | No.1419 Power Moves |
| ユーザー |
 FF256grhy
|
| 提出日時 | 2023-08-24 19:54:16 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 96 ms / 2,000 ms |
| コード長 | 9,184 bytes |
| コンパイル時間 | 2,250 ms |
| コンパイル使用メモリ | 202,080 KB |
| 最終ジャッジ日時 | 2025-02-16 13:17:10 |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 31 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define incII(i, l, r) for(decay_t<decltype(r)> i = (l) ; i <= (r); i++)#define incIX(i, l, r) for(decay_t<decltype(r)> i = (l) ; i < (r); i++)#define incXI(i, l, r) for(decay_t<decltype(r)> i = (l) + 1; i <= (r); i++)#define incXX(i, l, r) for(decay_t<decltype(r)> i = (l) + 1; i < (r); i++)#define decII(i, l, r) for(decay_t<decltype(r)> i = (r) ; i >= (l); i--)#define decIX(i, l, r) for(decay_t<decltype(r)> i = (r) - 1; i >= (l); i--)#define decXI(i, l, r) for(decay_t<decltype(r)> i = (r) ; i > (l); i--)#define decXX(i, l, r) for(decay_t<decltype(r)> i = (r) - 1; i > (l); i--)#define inc(i, n) incIX(i, 0, n)#define dec(i, n) decIX(i, 0, n)#define inc1(i, n) incII(i, 1, n)#define dec1(i, n) decII(i, 1, n)auto inII = [](auto a, auto l, auto r) -> bool { return (l <= a && a <= r); };auto inIX = [](auto a, auto l, auto r) -> bool { return (l <= a && a < r); };auto inXI = [](auto a, auto l, auto r) -> bool { return (l < a && a <= r); };auto inXX = [](auto a, auto l, auto r) -> bool { return (l < a && a < r); };auto setmin = [](auto & a, auto b) -> bool { return (b < a ? a = b, true : false); };auto setmax = [](auto & a, auto b) -> bool { return (b > a ? a = b, true : false); };auto setmineq = [](auto & a, auto b) -> bool { return (b <= a ? a = b, true : false); };auto setmaxeq = [](auto & a, auto b) -> bool { return (b >= a ? a = b, true : false); };using LL = long long int;using LD = long double;#define PB push_back#define EB emplace_back#define MP make_pair#define MT make_tuple#define FI first#define SE second#define FR front()#define BA back()#define ALL(a) begin(a), end(a)#define RALL(a) rbegin(a), rend(a)#define RV(a) reverse(ALL(a))#define ST(a) sort(ALL(a))#define RST(a) sort(RALL(a))#define SC static_cast#define SI(a) SC<int>(a.size())#define SL(a) SC<LL>(a.size())#define RF(e, ...) for(auto && e: __VA_ARGS__)#define SF(a, ...) for(auto && [__VA_ARGS__]: a)#define until(...) while(not(__VA_ARGS__))#define if_not(...) if(not(__VA_ARGS__))#define ef else if#define UR assert(false)template<typename A> istream & operator>>(istream & is, vector<A> & v);template<typename A> ostream & operator<<(ostream & os, vector<A> const & v);template<typename A, size_t N> istream & operator>>(istream & is, array<A, N> & a);template<typename A, size_t N> ostream & operator<<(ostream & os, array<A, N> const & a);template<typename A, typename B> istream & operator>>(istream & is, pair<A, B> & p);template<typename A, typename B> ostream & operator<<(ostream & os, pair<A, B> const & p);template<typename ... A> istream & operator>>(istream & is, tuple<A ...> & t);template<typename ... A> ostream & operator<<(ostream & os, tuple<A ...> const & t);template<int I = 0, typename T> void tin_ (istream & is, T & t) { if constexpr(I < tuple_size<T>::value) { is >> get<I>(t); tin_<I + 1>(is, t);} }template<int I = 0, typename T> void tout_(ostream & os, T const & t) { if constexpr(I < tuple_size<T>::value) { if(I != 0) { os << " "; } os << get<I>(t); tout_<I + 1>(os, t); } }template<typename A> istream & operator>>(istream & is, vector<A> & v) { for(auto && e: v) { is >> e; } return is; }template<typename A> ostream & operator<<(ostream & os, vector<A> const & v) { string ss; for(auto && e: v) { os << ss << e; ss = " ";} return os; }template<typename A, size_t N> istream & operator>>(istream & is, array<A, N> & a) { for(auto && e: a) { is >> e; } return is; }template<typename A, size_t N> ostream & operator<<(ostream & os, array<A, N> const & a) { string ss; for(auto && e: a) { os << ss << e; ss = " ";} return os; }template<typename A, typename B> istream & operator>>(istream & is, pair<A, B> & p) { return is >> p.first >> p.second; }template<typename A, typename B> ostream & operator<<(ostream & os, pair<A, B> const & p) { return os << p.first << " " << p.second; }template<typename ... A> istream & operator>>(istream & is, tuple<A ...> & t) { tin_ (is, t); return is; }template<typename ... A> ostream & operator<<(ostream & os, tuple<A ...> const & t) { tout_(os, t); return os; }auto * IS = & cin;auto * OS = & cout;template<typename ... A> void in(A & ... a) { (* IS >> ... >> a); }#define IN(...) __VA_ARGS__; in(__VA_ARGS__)template<typename A > auto make_v(A a) { return a; }template<typename A, typename ... M> auto make_v(A a, int n, M ... m) { return vector(n, make_v(a, m ...)); }template<typename A, typename ... N> auto read_v(N ... n) { auto a = make_v(A { }, n ...); in(a); return a; }void out_([[maybe_unused]] string const & s) { }template<typename A > void out_([[maybe_unused]] string const & s, A const & a) { * OS << a; }template<typename A, typename ... B> void out_( string const & s, A const & a, B const & ... b) { * OS << a << s; out_(s, b ...); }auto outF = [](string const & s, string const & t, auto const & ... a) { out_(s, a ...); * OS << t << flush; };auto outN = [](auto const & ... a) { outF("" , "" , a ...); };auto outS = [](auto const & ... a) { outF(" " , " " , a ...); };auto outL = [](auto const & ... a) { outF("\n", "\n", a ...); };auto outSN = [](auto const & ... a) { outF(" " , "" , a ...); };auto outNL = [](auto const & ... a) { outF("" , "\n", a ...); };auto outSL = [](auto const & ... a) { outF(" " , "\n", a ...); };auto out = outSL;template<typename A > void disp_(A const & a) { * OS << a; }template<typename A, typename ... T> void disp_(A const & a, string const & s, T const & ... t) { string ss; for(auto && e: a) { * OS << ss; ss = s;disp_(e, t ...); } }auto dispI = [](auto const & a, auto const & s, auto const & ... t) { disp_(a, t ...); * OS << s << flush; };auto dispT = [](auto const & a, auto const & s, auto const & ... t) { for(auto && e: a) { disp_(e, t ...); * OS << s; } * OS << flush; };auto dispL = [](auto const & a, auto const & ... t) { dispT(a, "\n", t ...); };struct OS_init { OS_init() { * OS << boolalpha << fixed << setprecision(20); } } os_init_;// ---- ----template<int N> class DynModInt {private:static LL M;LL v;pair<LL, LL> ext_gcd(LL a, LL b) {if(b == 0) { assert(a == 1); return { 1, 0 }; }auto p = ext_gcd(b, a % b);return { p.SE, p.FI - (a / b) * p.SE };}public:DynModInt() { v = 0; }DynModInt(LL vv) { assert(M > 0); v = vv; if(abs(v) >= M) { v %= M; } if(v < 0) { v += M; } }static LL & mod() { return M; }LL val() { return v; }DynModInt inv() { return ext_gcd(M, v).SE; }DynModInt exp(LL b) {DynModInt p = 1, a = v; if(b < 0) { a = a.inv(); b = -b; }while(b) { if(b & 1) { p *= a; } a *= a; b >>= 1; }return p;}friend bool operator< (DynModInt a, DynModInt b) { return (a.v < b.v); }friend bool operator> (DynModInt a, DynModInt b) { return (a.v > b.v); }friend bool operator<=(DynModInt a, DynModInt b) { return (a.v <= b.v); }friend bool operator>=(DynModInt a, DynModInt b) { return (a.v >= b.v); }friend bool operator==(DynModInt a, DynModInt b) { return (a.v == b.v); }friend bool operator!=(DynModInt a, DynModInt b) { return (a.v != b.v); }friend DynModInt operator+ (DynModInt a ) { return DynModInt(+a.v); }friend DynModInt operator- (DynModInt a ) { return DynModInt(-a.v); }friend DynModInt operator+ (DynModInt a, DynModInt b) { return DynModInt(a.v + b.v); }friend DynModInt operator- (DynModInt a, DynModInt b) { return DynModInt(a.v - b.v); }friend DynModInt operator* (DynModInt a, DynModInt b) { return DynModInt(a.v * b.v); }friend DynModInt operator/ (DynModInt a, DynModInt b) { return a * b.inv(); }friend DynModInt operator^ (DynModInt a, LL b) { return a.exp(b); }friend DynModInt & operator+=(DynModInt & a, DynModInt b) { return (a = a + b); }friend DynModInt & operator-=(DynModInt & a, DynModInt b) { return (a = a - b); }friend DynModInt & operator*=(DynModInt & a, DynModInt b) { return (a = a * b); }friend DynModInt & operator/=(DynModInt & a, DynModInt b) { return (a = a / b); }friend DynModInt & operator^=(DynModInt & a, LL b) { return (a = a ^ b); }friend istream & operator>>(istream & s, DynModInt & b) { s >> b.v; b = DynModInt(b.v); return s; }friend ostream & operator<<(ostream & s, DynModInt b) { return (s << b.v); }};template<int N> LL DynModInt<N>::M = 0;// ----using MI_P = DynModInt<0>;using MI_N = DynModInt<1>;const LL MOD = 1'000'000'007;int main() {int IN(n, k);MI_N::mod() = n;MI_P::mod() = MOD;LL l = (MI_N(2) ^ (k - 1)).val();auto x = ((MI_P(2) ^ (k - 1)) - l) / n;vector<MI_P> ans(n);inc(i, n) {ans[MI_N(+(2 * i + 1)).val()] += x + (i < l ? 1 : 0);ans[MI_N(-(2 * i + 1)).val()] += x + (i < l ? 1 : 0);}RF(e, ans) { e /= MI_P(2) ^ k; }dispL(ans);}