結果

問題 No.1204 お菓子配り-FINAL
ユーザー 👑 PCTprobabilityPCTprobability
提出日時 2020-08-23 21:04:26
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,042 ms / 8,000 ms
コード長 9,726 bytes
コンパイル時間 5,884 ms
コンパイル使用メモリ 435,804 KB
実行使用メモリ 160,352 KB
最終ジャッジ日時 2024-04-27 03:26:35
合計ジャッジ時間 32,756 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 132 ms
159,652 KB
testcase_01 AC 143 ms
160,196 KB
testcase_02 AC 154 ms
159,768 KB
testcase_03 AC 122 ms
159,604 KB
testcase_04 AC 139 ms
160,212 KB
testcase_05 AC 127 ms
159,868 KB
testcase_06 AC 129 ms
159,948 KB
testcase_07 AC 131 ms
160,088 KB
testcase_08 AC 122 ms
159,696 KB
testcase_09 AC 128 ms
159,628 KB
testcase_10 AC 147 ms
160,036 KB
testcase_11 AC 151 ms
159,996 KB
testcase_12 AC 129 ms
160,000 KB
testcase_13 AC 143 ms
160,080 KB
testcase_14 AC 130 ms
159,864 KB
testcase_15 AC 123 ms
159,572 KB
testcase_16 AC 127 ms
159,636 KB
testcase_17 AC 125 ms
159,492 KB
testcase_18 AC 123 ms
159,736 KB
testcase_19 AC 123 ms
159,732 KB
testcase_20 AC 138 ms
159,768 KB
testcase_21 AC 250 ms
159,872 KB
testcase_22 AC 136 ms
159,768 KB
testcase_23 AC 166 ms
160,144 KB
testcase_24 AC 144 ms
160,292 KB
testcase_25 AC 122 ms
159,600 KB
testcase_26 AC 168 ms
159,776 KB
testcase_27 AC 226 ms
160,076 KB
testcase_28 AC 123 ms
159,448 KB
testcase_29 AC 161 ms
160,016 KB
testcase_30 AC 168 ms
160,056 KB
testcase_31 AC 203 ms
160,128 KB
testcase_32 AC 122 ms
159,568 KB
testcase_33 AC 168 ms
159,712 KB
testcase_34 AC 133 ms
159,848 KB
testcase_35 AC 149 ms
159,924 KB
testcase_36 AC 180 ms
159,952 KB
testcase_37 AC 169 ms
159,852 KB
testcase_38 AC 136 ms
159,664 KB
testcase_39 AC 141 ms
159,708 KB
testcase_40 AC 136 ms
160,220 KB
testcase_41 AC 121 ms
159,548 KB
testcase_42 AC 120 ms
159,476 KB
testcase_43 AC 121 ms
159,596 KB
testcase_44 AC 119 ms
159,540 KB
testcase_45 AC 126 ms
159,616 KB
testcase_46 AC 126 ms
159,552 KB
testcase_47 AC 120 ms
159,508 KB
testcase_48 AC 134 ms
160,164 KB
testcase_49 AC 129 ms
159,960 KB
testcase_50 AC 134 ms
160,088 KB
testcase_51 AC 121 ms
159,716 KB
testcase_52 AC 120 ms
159,572 KB
testcase_53 AC 128 ms
160,012 KB
testcase_54 AC 138 ms
160,256 KB
testcase_55 AC 122 ms
159,688 KB
testcase_56 AC 160 ms
160,096 KB
testcase_57 AC 119 ms
159,556 KB
testcase_58 AC 124 ms
159,696 KB
testcase_59 AC 127 ms
159,936 KB
testcase_60 AC 120 ms
159,436 KB
testcase_61 AC 119 ms
159,456 KB
testcase_62 AC 122 ms
159,472 KB
testcase_63 AC 121 ms
159,348 KB
testcase_64 AC 119 ms
159,484 KB
testcase_65 AC 118 ms
159,476 KB
testcase_66 AC 119 ms
159,452 KB
testcase_67 AC 120 ms
159,476 KB
testcase_68 AC 119 ms
159,508 KB
testcase_69 AC 119 ms
159,516 KB
testcase_70 AC 118 ms
159,444 KB
testcase_71 AC 119 ms
159,500 KB
testcase_72 AC 118 ms
159,468 KB
testcase_73 AC 119 ms
159,508 KB
testcase_74 AC 122 ms
159,436 KB
testcase_75 AC 121 ms
159,472 KB
testcase_76 AC 123 ms
159,444 KB
testcase_77 AC 122 ms
159,544 KB
testcase_78 AC 2 ms
6,940 KB
testcase_79 AC 120 ms
159,476 KB
testcase_80 AC 120 ms
159,472 KB
testcase_81 AC 121 ms
159,468 KB
testcase_82 AC 119 ms
159,312 KB
testcase_83 AC 121 ms
159,468 KB
testcase_84 AC 120 ms
159,476 KB
testcase_85 AC 121 ms
159,528 KB
testcase_86 AC 119 ms
159,504 KB
testcase_87 AC 119 ms
159,436 KB
testcase_88 AC 2 ms
6,940 KB
testcase_89 AC 2 ms
6,940 KB
testcase_90 AC 476 ms
159,924 KB
testcase_91 AC 214 ms
159,508 KB
testcase_92 AC 289 ms
159,720 KB
testcase_93 AC 567 ms
159,768 KB
testcase_94 AC 450 ms
159,692 KB
testcase_95 AC 619 ms
160,004 KB
testcase_96 AC 1,042 ms
160,188 KB
testcase_97 AC 209 ms
159,996 KB
testcase_98 AC 481 ms
159,736 KB
testcase_99 AC 617 ms
159,900 KB
testcase_100 AC 149 ms
159,636 KB
testcase_101 AC 462 ms
159,732 KB
testcase_102 AC 805 ms
160,248 KB
testcase_103 AC 740 ms
160,204 KB
testcase_104 AC 923 ms
160,020 KB
testcase_105 AC 189 ms
159,728 KB
testcase_106 AC 123 ms
159,532 KB
testcase_107 AC 166 ms
159,516 KB
testcase_108 AC 495 ms
159,748 KB
testcase_109 AC 608 ms
160,024 KB
testcase_110 AC 199 ms
160,232 KB
testcase_111 AC 144 ms
160,352 KB
testcase_112 AC 145 ms
160,212 KB
testcase_113 AC 162 ms
160,212 KB
testcase_114 AC 180 ms
160,244 KB
testcase_115 AC 189 ms
160,084 KB
testcase_116 AC 196 ms
160,272 KB
testcase_117 AC 182 ms
160,256 KB
testcase_118 AC 136 ms
160,220 KB
testcase_119 AC 214 ms
160,084 KB
testcase_120 AC 271 ms
160,228 KB
testcase_121 AC 145 ms
160,256 KB
testcase_122 AC 201 ms
160,288 KB
testcase_123 AC 138 ms
160,088 KB
testcase_124 AC 250 ms
160,252 KB
testcase_125 AC 231 ms
160,248 KB
testcase_126 AC 182 ms
160,248 KB
testcase_127 AC 179 ms
160,212 KB
testcase_128 AC 182 ms
160,232 KB
testcase_129 AC 409 ms
160,292 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp:51:22: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
   51 | inline auto reversed(auto v){reverse(v.begin(),v.end());return v;}
      |                      ^~~~
main.cpp:58:12: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
   58 | bool chmin(auto& s,const auto& t){bool res=s>t;s=min(s,t);return res;}
      |            ^~~~
main.cpp:58:26: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
   58 | bool chmin(auto& s,const auto& t){bool res=s>t;s=min(s,t);return res;}
      |                          ^~~~
main.cpp:59:12: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
   59 | bool chmax(auto& s,const auto& t){bool res=s<t;s=max(s,t);return res;}
      |            ^~~~
main.cpp:59:26: warning: use of 'auto' in parameter declaration only available with '-std=c++20' or '-fconcepts'
   59 | bool chmax(auto& s,const auto& t){bool res=s<t;s=max(s,t);return res;}
      |                          ^~~~

ソースコード

diff # 

#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC push_options
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#include<bits/stdc++.h>
#include <xmmintrin.h>
#include <immintrin.h>
using namespace::std;
__attribute__((constructor))void init(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
#include<ext/pb_ds/tag_and_trait.hpp>
// #include <boost/multiprecision/cpp_dec_float.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
// typedef mp::number<mp::cpp_dec_float<0>> cdouble;
// typedef mp::cpp_int cint;
template<typename T>using pbds=__gnu_pbds::tree<T,__gnu_pbds::null_type,less<T>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>;
template<typename T>using pbds_map=__gnu_pbds::tree<T,T,less<T>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>;
template<typename T,typename E>using hash_map=__gnu_pbds::gp_hash_table<T,E>;
template<typename T>using pqueue =__gnu_pbds::priority_queue<T, greater<T>,__gnu_pbds::rc_binomial_heap_tag>;
typedef long long lint;
#define INF (1LL<<60)
#define IINF (1<<30)
#define LINF (9223372036854775807LL)
#define EPS (1e-10)
#define endl ('\n')
#define MOD 1000000007LL
//#define MOD 998244353LL
//#define MOD 18446744069414584321ULL
typedef vector<lint> vec;
typedef vector<vector<lint>> mat;
typedef vector<vector<vector<lint>>> mat3;
typedef vector<string> svec;
typedef vector<vector<string>> smat;
template<typename T>inline void numout(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i<INF/2?i:"INF";f=1;}cout<<endl;}
template<typename T>inline void numout2(T t){for(auto i:t)numout(i);}
template<typename T>inline void output(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i;f=1;}cout<<endl;}
template<typename T>inline void output2(T t){for(auto i:t)output(i);}
template<typename T>inline void _output(T t){bool f=0;for(lint i=0;i<t.size();i++){cout<<f?"":" "<<t[i];f=1;}cout<<endl;}
template<typename T>inline void _output2(T t){for(lint i=0;i<t.size();i++)output(t[i]);}
#define rep(i,...) for(auto i:range(__VA_ARGS__)) 
#define rrep(i,...) for(auto i:reversed(range(__VA_ARGS__)))
#define repi(i,a,b) for(lint i=lint(a);i<(lint)(b);++i)
#define rrepi(i,a,b) for(lint i=lint(b)-1;i>=lint(a);--i)
#define irep(i) for(lint i=0;;++i)
inline vector<int64_t> range(int64_t n){vector<int64_t>v(n);iota(v.begin(),v.end(),0LL);return v;}
inline vector<int64_t> range(int64_t a,int64_t b){vector<int64_t>v(b-a);iota(v.begin(),v.end(),a);return v;}
inline vector<int64_t> range(int64_t a,int64_t b,int64_t c){vector<int64_t>v((b-a+c-1)/c);for(int i=0;i<(int)v.size();++i)v[i]=i?v[i-1]+c:a;return v;}
inline auto reversed(auto v){reverse(v.begin(),v.end());return v;}
#define all(n) begin(n),end(n)
#define dist(a,b,c,d) sqrt(pow(a-c,2)+pow(b-d,2))
//inline lint gcd(lint A,lint B){return B?gcd(B,A%B):A;}
//inline lint lcm(lint A,lint B){return A/gcd(A,B)*B;}
// inline cint cgcd(cint A,cint B){return B?cgcd(B,A%B):A;}
// inline cint clcm(cint A,cint B){return A/cgcd(A,B)*B;}
bool chmin(auto& s,const auto& t){bool res=s>t;s=min(s,t);return res;}
bool chmax(auto& s,const auto& t){bool res=s<t;s=max(s,t);return res;}
const vector<lint> dx={1,0,-1,0,1,1,-1,-1};
const vector<lint> dy={0,1,0,-1,1,-1,1,-1};
#define SUM(v) accumulate(all(v),0LL)
auto call=[](auto f,auto... args){return f(f,args...);};
template<typename T,typename ...Args>auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector<T>(arg,x);else return vector(arg,make_vector<T>(x,args...));}

class mint {
  using u64 = std::uint_fast64_t;
    public:
    u64 a;
    constexpr mint(const long long x = 0)noexcept:a(x>=0?x%get_mod():get_mod()-(-x)%get_mod()){}
    constexpr u64 &value()noexcept{return a;}
    constexpr const u64 &value() const noexcept {return a;}
    constexpr mint operator+(const mint rhs)const noexcept{return mint(*this) += rhs;}
    constexpr mint operator-(const mint rhs)const noexcept{return mint(*this)-=rhs;}
    constexpr mint operator*(const mint rhs) const noexcept {return mint(*this) *= rhs;}
    constexpr mint operator/(const mint rhs) const noexcept {return mint(*this) /= rhs;}
    constexpr mint &operator+=(const mint rhs) noexcept {
        a += rhs.a;
        if (a >= get_mod())a -= get_mod();
        return *this;
    }
    constexpr mint &operator-=(const mint rhs) noexcept {
        if (a<rhs.a)a += get_mod();
        a -= rhs.a;
        return *this;
    }
    constexpr mint &operator*=(const mint rhs) noexcept {
        a = a * rhs.a % get_mod();
        return *this;
    }
    constexpr mint operator++(int n) noexcept {
        a += 1;
        if (a >= get_mod())a -= get_mod();
        return *this;
    }
    constexpr mint operator--(int n) noexcept {
        if (a<1)a += get_mod();
        a -= 1;
        return *this;
    }
    constexpr mint &operator/=(mint rhs) noexcept {
        u64 exp=get_mod()-2;
        while (exp) {
            if (exp % 2) {
                *this *= rhs;
            }
            rhs *= rhs;
            exp /= 2;
        }
        return *this;
    }
    constexpr bool operator==(mint x) noexcept {
        return a==x.a;
    }
    constexpr bool operator!=(mint x) noexcept {
        return a!=x.a;
    }
	constexpr bool operator<(mint x) noexcept {
        return a<x.a;
    }
	constexpr bool operator>(mint x) noexcept {
        return a>x.a;
    }
	constexpr bool operator<=(mint x) noexcept {
        return a<=x.a;
    }
	constexpr bool operator>=(mint x) noexcept {
        return a>=x.a;
    }
    constexpr static int root(){
        mint root = 2;
        while(root.pow((get_mod()-1)>>1).a==1)root++;
        return root.a;
    }
    constexpr mint pow(long long n){
        long long x=a;
        mint ret = 1;
        while(n>0) {
            if(n&1)(ret*=x);
            (x*=x)%=get_mod();
            n>>=1;
        }
        return ret;
    }
    constexpr mint inv(){
        return pow(get_mod()-2);
    }
    static vector<mint> fac,ifac;
    static bool init;
    constexpr static int mx=10000001;
    void build(){
        init=0;
        fac.resize(mx);
        ifac.resize(mx);
        fac[0]=1,ifac[0]=1;
        for(int i=1;i<mx;i++)fac[i]=fac[i-1]*i;
        ifac[mx-1]=fac[mx-1].inv();
        for(int i=mx-2;i>=0;i--)ifac[i]=ifac[i+1]*(i+1);
    }
    mint comb(lint b){
        if(init)build();
        if(a==0&&b==0)return 1;
        if((lint)a<b||a<0)return 0;
        return fac[a]*ifac[a-b]*ifac[b];
    }
    mint fact(){
        if(init)build();
        return fac[a];
    }
    mint fact_inv(){
        if(init)build();
        return ifac[a];
    }
    friend ostream& operator<<(ostream& lhs, const mint& rhs) noexcept {
        lhs << rhs.a;
        return lhs;
    }
    friend istream& operator>>(istream& lhs,mint& rhs) noexcept {
        lhs >> rhs.a;
        return lhs;
    }
    constexpr static u64 get_mod(){return MOD;}
};
vector<mint> mint::fac;
vector<mint> mint::ifac;
bool mint::init=1;

constexpr int N=20;
mint f(bitset<N>v,const string& s,lint n){
    mint ans=0;
    {
        for(int i=0;i<n-(int)s.size()+1;++i){
            bool b=1;
            rep(j,s.size()){
                if((s[j]=='-')^(v[i+j]))b=0;
            }
            if(b)ans+=mint(n).pow(n-v.count());
        }
    }
    if(int(v.count())==n)return ans;
    for(int i=0;i<n;++i){
        bitset<N>b=v;
        lint tmp=i;
        while(b[tmp++%n]);
        b[(tmp+n-1)%n]=1;
        ans+=f(b,s,n);
    }
    return ans;
}

int main(){
    lint n,m;
    cin>>n>>m;
    string s;
    cin>>s;
    //cout<<f(bitset<N>(),s,n)<<endl;
    auto f=[](lint n,lint k)->mint{
        n++;
        if(k==0)return 1;
        return mint(n-k)*mint(n).pow(k-1);
    };
    if(count(all(s),'o')==0){
        mint ans=0;
        rep(i,n-m+1){
            mint tmp=0;
            tmp+=mint(n).pow(i+m);
            if(n-m-i>=1){
                tmp-=mint(m)*f(n-1,i+m);
            }
            if(n-m-i>=2){
                for(int j=0;j<=m-2;++j){
                    tmp+=mint(m-1-j)*f(n-(j+2),i+m-j)*f(j,j)*mint(i+m).comb(j);
                }
            }
            ans+=tmp*(n-m+1)*mint(n).pow(n-m-i);
        }
        cout<<ans<<endl;
    }else{
        vec v;
        lint now=0;
        rep(i,m){
            if(s[i]=='o'){
                if(now)v.push_back(now);
                now=0;
            }else{
                now++;
            }
        }
        lint l=(s[0]=='o'?0:v[0]),r=now;
        if(s[0]!='o')v.erase(v.begin());
        mint tmp=1;
        lint cnt=0;
        for(auto e:v){
            tmp*=f(e,e);
            tmp/=mint(e).fact();
            cnt+=e;
        }
        tmp*=mint(cnt).fact();
        mint ans=0;
        vector<mint>table(max(l+r-1,1LL),0);
        rep(i,l)rep(j,r){
            table[i+j]+=f(i,i)*f(j,j)*mint(i+j).comb(i);
        }
        rep(i,n-m+1){
            mint tmp2=0;
            tmp2+=f(n-m+l+r,i+l+r);
            if(n-m-i>=1){
                for(int j=0;j<=l-1;++j){
                    tmp2-=f((n-m+l+r)-(1+j),(i+l+r)-j)*f(j,j)*mint(i+l+r).comb(j);
                }
                for(int j=0;j<=r-1;++j){
                    tmp2-=f((n-m+l+r)-(1+j),(i+l+r)-j)*f(j,j)*mint(i+l+r).comb(j);
                }
            }
            if(n-m-i>=2){
                for(int j=0;j<=l+r-2;++j){
                    tmp2+=f((n-m+l+r)-(2+j),(i+l+r)-j)*table[j]*mint(i+l+r).comb(j);
                }
            }
            ans+=tmp*tmp2*mint(i+l+r+cnt).comb(cnt)*(n-m+1)*mint(n).pow(n-i-cnt-l-r);
        }
        cout<<ans<<endl;
    }
}
0