結果
問題 | No.1259 スイッチ |
ユーザー |
![]() |
提出日時 | 2020-10-16 23:33:05 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,287 bytes |
コンパイル時間 | 911 ms |
コンパイル使用メモリ | 85,204 KB |
実行使用メモリ | 50,432 KB |
最終ジャッジ日時 | 2024-07-21 00:11:51 |
合計ジャッジ時間 | 21,140 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 41 WA * 20 |
ソースコード
#include <iostream>#include <algorithm>#include <iomanip>#include <vector>#include <queue>#include <set>#include <map>#define N_MAX 2000002using namespace std;typedef long long ll;const ll MOD = 1000000007;class ModInt{public:ll v;ModInt(ll _v = 0){v = _v;}ModInt operator+(ll n){return ModInt((v+n)%MOD);}ModInt operator-(ll n){return ModInt((v-n+MOD)%MOD);}ModInt operator*(ll n){return ModInt((v*n)%MOD);}ModInt operator/(ll n){return ModInt((ModInt(n).inv()*v).v%MOD);}void operator+=(ll n){v = (v+n)%MOD;}void operator-=(ll n){v = (v-n+MOD)%MOD;}void operator*=(ll n){v = (v*n)%MOD;}ModInt operator+(ModInt n){return ModInt((v+n.v)%MOD);}ModInt operator-(ModInt n){return ModInt((v-n.v+MOD)%MOD);}ModInt operator*(ModInt n){return ModInt((v*n.v)%MOD);}ModInt operator/(ModInt n){return ModInt((n.inv()*v).v%MOD);}void operator+=(ModInt n){v = (v+n.v)%MOD;}void operator-=(ModInt n){v = (v-n.v+MOD)%MOD;}void operator*=(ModInt n){v = (v*n.v)%MOD;}void operator=(ModInt n){v = n.v;}void operator=(ll n){v = n;}ModInt inv(){if(v == 1) return ModInt(1);else return ModInt(MOD-ModInt(MOD%v).inv().v*(MOD/v)%MOD);}};ostream& operator<<(ostream& os, const ModInt& m){os << m.v;return os;}istream & operator >> (istream &in, ModInt &m){in >> m.v;return in;}ModInt pow(ModInt a, ll n) {ModInt ans = 1;ModInt tmp = a;for (int i = 0; i <= 60; i++) {ll m = (ll)1 << i;if (m & n) {ans *= tmp;}tmp *= tmp;}return ans;}ModInt inv[N_MAX],fac[N_MAX],finv[N_MAX];void init(){fac[0]=1;fac[1]=1;finv[0]=1;finv[1]=1;inv[1]=1;for(int i=2;i<N_MAX;i++){inv[i]=(ModInt)MOD-inv[MOD%i]*(MOD/i);fac[i]=fac[i-1]*(ll) i;finv[i]=finv[i-1]*inv[i];}}ModInt comb(ll n, ll r){if(n < r){return ModInt(0);}else{return fac[n]*finv[r]*finv[n-r];}}int main(){ios::sync_with_stdio(false);cin.tie(0);cout << setprecision(10) << fixed;init();ll n, k, m;cin >> n >> k >> m;if(m == 1 && k == 1){cout << pow(ModInt(n), n-1) << endl;return 0;}ModInt ans = 0;// 1がloopに含まれるfor(int l = 2; l <= n; l++){if(k%l == 0) {if(m == 1) ans += comb(n-2, l-2)*fac[l-1]*pow(ModInt(n), n-l);}else{if(m != 1) ans += comb(n-2, l-2)*fac[l-2]*pow(ModInt(n), n-l);}}if(m == 1){ans += pow(ModInt(n), n-1);cout << ans << endl;return 0;}// cout << ans << endl;// 1がloopに含まれないかつ一周以上しているfor(int x = 2; x <= n; x++){// ModInt tmp =if(k >= x) ans += comb(n-2, x-2)*fac[x-2]*pow(ModInt(n), n-x)*(x-1);else continue;}// cout << ans << endl;// 一周未満if(k+1 <= n) ans += comb(n-2, k-1)*fac[k-1]*pow(ModInt(n), n-k-1)*n;cout << ans << endl;}