結果
問題 | No.1259 スイッチ |
ユーザー | kiyoshi0205 |
提出日時 | 2020-10-16 22:12:49 |
言語 | C++14 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 334 ms / 2,000 ms |
コード長 | 3,463 bytes |
コンパイル時間 | 2,934 ms |
コンパイル使用メモリ | 182,864 KB |
実行使用メモリ | 18,820 KB |
最終ジャッジ日時 | 2023-09-28 03:26:33 |
合計ジャッジ時間 | 16,514 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,376 KB |
testcase_01 | AC | 1 ms
4,376 KB |
testcase_02 | AC | 2 ms
4,380 KB |
testcase_03 | AC | 1 ms
4,376 KB |
testcase_04 | AC | 1 ms
4,376 KB |
testcase_05 | AC | 1 ms
4,380 KB |
testcase_06 | AC | 2 ms
4,380 KB |
testcase_07 | AC | 1 ms
4,380 KB |
testcase_08 | AC | 1 ms
4,380 KB |
testcase_09 | AC | 2 ms
4,380 KB |
testcase_10 | AC | 201 ms
12,356 KB |
testcase_11 | AC | 302 ms
17,776 KB |
testcase_12 | AC | 184 ms
11,832 KB |
testcase_13 | AC | 119 ms
8,284 KB |
testcase_14 | AC | 162 ms
10,604 KB |
testcase_15 | AC | 109 ms
8,300 KB |
testcase_16 | AC | 252 ms
15,176 KB |
testcase_17 | AC | 151 ms
10,312 KB |
testcase_18 | AC | 290 ms
16,716 KB |
testcase_19 | AC | 280 ms
16,720 KB |
testcase_20 | AC | 203 ms
12,720 KB |
testcase_21 | AC | 319 ms
18,012 KB |
testcase_22 | AC | 99 ms
7,612 KB |
testcase_23 | AC | 282 ms
16,488 KB |
testcase_24 | AC | 208 ms
13,160 KB |
testcase_25 | AC | 209 ms
12,956 KB |
testcase_26 | AC | 325 ms
18,408 KB |
testcase_27 | AC | 261 ms
15,492 KB |
testcase_28 | AC | 212 ms
12,940 KB |
testcase_29 | AC | 264 ms
15,440 KB |
testcase_30 | AC | 163 ms
10,572 KB |
testcase_31 | AC | 235 ms
14,344 KB |
testcase_32 | AC | 102 ms
7,808 KB |
testcase_33 | AC | 331 ms
18,220 KB |
testcase_34 | AC | 177 ms
11,368 KB |
testcase_35 | AC | 246 ms
14,716 KB |
testcase_36 | AC | 222 ms
13,748 KB |
testcase_37 | AC | 212 ms
13,148 KB |
testcase_38 | AC | 200 ms
12,460 KB |
testcase_39 | AC | 312 ms
17,528 KB |
testcase_40 | AC | 309 ms
17,836 KB |
testcase_41 | AC | 259 ms
15,360 KB |
testcase_42 | AC | 315 ms
18,016 KB |
testcase_43 | AC | 186 ms
11,884 KB |
testcase_44 | AC | 303 ms
17,272 KB |
testcase_45 | AC | 327 ms
18,556 KB |
testcase_46 | AC | 178 ms
11,400 KB |
testcase_47 | AC | 325 ms
18,556 KB |
testcase_48 | AC | 156 ms
10,404 KB |
testcase_49 | AC | 316 ms
18,008 KB |
testcase_50 | AC | 178 ms
11,584 KB |
testcase_51 | AC | 98 ms
7,540 KB |
testcase_52 | AC | 308 ms
17,752 KB |
testcase_53 | AC | 136 ms
9,584 KB |
testcase_54 | AC | 308 ms
17,500 KB |
testcase_55 | AC | 93 ms
7,340 KB |
testcase_56 | AC | 156 ms
10,336 KB |
testcase_57 | AC | 288 ms
16,476 KB |
testcase_58 | AC | 194 ms
12,104 KB |
testcase_59 | AC | 241 ms
14,268 KB |
testcase_60 | AC | 334 ms
18,820 KB |
ソースコード
#pragma GCC target("avx") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include<bits/stdc++.h> // #include<ext/pb_ds/assoc_container.hpp> // #include<ext/pb_ds/tree_policy.hpp> // #include<ext/pb_ds/tag_and_trait.hpp> // using namespace __gnu_pbds; // #include<boost/multiprecision/cpp_int.hpp> // namespace multiprecisioninteger = boost::multiprecision; // using cint=multiprecisioninteger::cpp_int; using namespace std; using ll=long long; #define double long double using datas=pair<ll,ll>; using ddatas=pair<double,double>; using tdata=pair<ll,datas>; using vec=vector<ll>; using mat=vector<vec>; using pvec=vector<datas>; using pmat=vector<pvec>; // using llset=tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>; #define For(i,a,b) for(i=a;i<(ll)b;++i) #define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i) #define rep(i,N) For(i,0,N) #define rep1(i,N) For(i,1,N) #define brep(i,N) bFor(i,N,0) #define brep1(i,N) bFor(i,N,1) #define all(v) (v).begin(),(v).end() #define allr(v) (v).rbegin(),(v).rend() #define vsort(v) sort(all(v)) #define vrsort(v) sort(allr(v)) #define endl "\n" #define eb emplace_back #define print(x) cout<<x<<endl #define printyes print("Yes") #define printno print("No") #define printYES print("YES") #define printNO print("NO") #define output(v) do{bool f=0;for(auto outi:v){cout<<(f?" ":"")<<outi;f=1;}cout<<endl;}while(0) #define matoutput(v) do{for(auto outimat:v)output(outimat);}while(0) const ll mod=1000000007; // const ll mod=998244353; const ll inf=1LL<<60; const double PI=acos(-1); const double eps=1e-9; template<class T,class E> ostream& operator<<(ostream& os,pair<T,E>& p){return os<<"{"<<p.first<<","<<p.second<<"}";} template<class T> inline bool chmax(T& a,T b){bool x=a<b;if(x)a=b;return x;} template<class T> inline bool chmin(T& a,T b){bool x=a>b;if(x)a=b;return x;} void startupcpp(){ cin.tie(0); ios::sync_with_stdio(false); cout<<fixed<<setprecision(15); } double distance(ddatas x,ddatas y){ double a=x.first-y.first,b=x.second-y.second; return sqrt(a*a+b*b); } ll modinv(ll a,ll m=mod) { ll b=m,u=1,v=0,t; while(b){ t=a/b; a-=t*b; swap(a,b); u-=t*v; swap(u,v); } return (u+m)%m; } ll moddevide(ll a,ll b){return (a*modinv(b))%mod;} vec modncrlistp,modncrlistm; ll modncr(ll n,ll r){ if(n<r)return 0; ll i,size=modncrlistp.size(); if(size<=n){ modncrlistp.resize(n+1); modncrlistm.resize(n+1); if(!size){ modncrlistp[0]=modncrlistm[0]=1; size++; } For(i,size,n+1){ modncrlistp[i]=modncrlistp[i-1]*i%mod; modncrlistm[i]=modinv(modncrlistp[i]); } } return modncrlistp[n]*modncrlistm[r]%mod*modncrlistm[n-r]%mod; } ll modpow(ll a,ll n,ll m=mod){ ll res=1; while(n>0){ if(n&1)res=res*a%m; a=a*a%m; n>>=1; } return res; } ll gcd(ll a,ll b){if(!b)return abs(a);return (a%b==0)?abs(b):gcd(b,a%b);} ll lcm(ll a,ll b){return a/gcd(a,b)*b;} ll countdigits(ll n){ ll ans=0; while(n){n/=10;ans++;} return ans; } ll sumdigits(ll n){ ll ans=0; while(n){ans+=n%10;n/=10;} return ans; } ll N,M,K,H,W,A,B,C,D; string s,t; ll ans; int main(){ startupcpp(); // int codeforces;cin>>codeforces;while(codeforces--){ ll i; cin>>N>>K>>M; modncr(N,0); rep(i,N){ if(K%(i+1))continue; ans+=modncr(N-1,i)*modncrlistp[i]%mod*modpow(N,N-i-1)%mod; } ans%=mod; if(M==1){print(ans);return 0;} ans=modpow(N,N)-ans+mod; print(moddevide(ans,N-1)); }