結果
問題 | No.1419 Power Moves |
ユーザー |
![]() |
提出日時 | 2021-03-05 22:23:44 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 134 ms / 2,000 ms |
コード長 | 4,683 bytes |
コンパイル時間 | 1,366 ms |
コンパイル使用メモリ | 170,492 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-10-07 02:53:43 |
合計ジャッジ時間 | 5,365 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 31 |
ソースコード
#include <bits/stdc++.h>//#include <chrono>//#pragma GCC optimize("Ofast")using namespace std;#define reps(i,s,n) for(int i = s; i < n; i++)#define rep(i,n) reps(i,0,n)#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)#define Rrep(i,n) Rreps(i,n,0)#define ALL(a) a.begin(), a.end()using ll = long long;using vec = vector<ll>;using mat = vector<vec>;ll N,M,H,W,Q,K,A,B;string S;using P = pair<ll, ll>;const ll INF = (1LL<<60);template<class T> bool chmin(T &a, const T b){if(a > b) {a = b; return true;}else return false;}template<class T> bool chmax(T &a, const T b){if(a < b) {a = b; return true;}else return false;}template<class T> void my_printv(std::vector<T> v,bool endline = true){if(!v.empty()){for(std::size_t i{}; i<v.size()-1; ++i) std::cout<<v[i]<<" ";std::cout<<v.back();}if(endline) std::cout<<std::endl;}template <unsigned long long mod > class modint{public:ll x;constexpr modint(){x = 0;}constexpr modint(ll _x) : x((_x < 0 ? ((_x += (LLONG_MAX / mod) * mod) < 0 ? _x + (LLONG_MAX / mod) * mod : _x) : _x)%mod){}constexpr modint set_raw(ll _x){//_x in [0, mod)x = _x;return *this;}constexpr modint operator-(){return x == 0 ? 0 : mod - x;}constexpr modint& operator+=(const modint& a){if((x += a.x) >= mod) x -= mod;return *this;}constexpr modint operator+(const modint& a) const{return modint(*this) += a;}constexpr modint& operator-=(const modint& a){if((x -= a.x) < 0) x += mod;return *this;}constexpr modint operator-(const modint& a) const{return modint(*this) -= a;}constexpr modint& operator*=(const modint& a){(x *= a.x)%=mod;return *this;}constexpr modint operator*(const modint& a) const{return modint(*this) *= a;}constexpr modint pow(unsigned long long pw) const{modint res(1), comp(*this);while(pw){if(pw&1) res *= comp;comp *= comp;pw >>= 1;}return res;}//以下、modが素数のときのみconstexpr modint inv() const{if(x == 2) return (mod + 1) >> 1;return modint(*this).pow(mod - 2);}constexpr modint& operator/=(const modint &a){(x *= a.inv().x)%=mod;return *this;}constexpr modint operator/(const modint &a) const{return modint(*this) /= a;}constexpr bool sqrt(bool find_mini = false) {if(x == 0) return true;modint jge = this->pow((mod - 1)>>1);if(jge.x + 1 == mod) return false;if((mod&3) == 3){*this = this->pow((mod + 1)>>2);}else{int m = 0;modint c, t;if(mod == 998244353){m = 23; c = 15311432; t = this->pow(119);*this = this->pow(60);}else{ll q = mod - 1;modint z = 2;while(!(q&1)){q>>=1; ++m;}while(z.pow((mod-1)>>1).x == 1) z += 1;c = z.pow(q); t = this->pow(q);*this = this->pow((q+1)>>1);}while(t.x != 1){modint cpy_t = t;int pw = m;while(cpy_t.x != 1){--pw; cpy_t *= cpy_t;}rep(i, pw-1) c *= c;(*this) *= c;c *= c;t *= c;m -= pw;}}if(find_mini) this->x = min(this->x, (ll)mod - this->x);return true;}};#define mod2 1000000007using mint = modint<mod2>;ostream& operator<<(ostream& os, const mint& a){os << a.x;return os;}using vm = vector<mint>;ll mpow(ll a, ll pw, ll mod){ll res = 1, tmp = a;while(pw){if(pw&1) (res *= tmp)%=mod;(tmp *= tmp)%=mod;pw >>= 1;}return res;}int main(){cin.tie(nullptr);ios::sync_with_stdio(false);cin>>N>>K;vm res(N, 0);ll id = (mpow(2, K, N) - 1 + N)%N;mint bunbo = mint(2).pow(K).inv(), k2 = mint(2).pow(K);if(N&1){int lnum = (id + 1)%N;rep(i, N) res[i] = (k2 - lnum) / N;rep(i, lnum){res[id] += 1;(id += N - 2)%=N;}rep(i, N) cout<<res[i] * bunbo<<endl;}else{int lnum = (id + 1)%(N / 2);rep(i, N / 2) res[i * 2 + (id&1)] = (k2 - lnum) / (N / 2);rep(i, lnum){res[id] += 1;(id += N - 2)%=N;}rep(i, N) cout<<res[i] * bunbo<<endl;}}