結果
| 問題 | No.1978 Permutation Repetition |
| ユーザー |
 xyz2606
|
| 提出日時 | 2022-06-10 23:46:32 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 32 ms / 2,000 ms |
| コード長 | 5,258 bytes |
| コンパイル時間 | 2,827 ms |
| コンパイル使用メモリ | 159,032 KB |
| 実行使用メモリ | 8,192 KB |
| 最終ジャッジ日時 | 2024-09-21 07:01:55 |
| 合計ジャッジ時間 | 3,063 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 44 |
ソースコード
#include<vector>#include<set>#include<map>#include<queue>#include<string>#include<algorithm>#include<iostream>#include<bitset>#include<functional>#include<chrono>#include<numeric>#include<cstdio>#include<cstring>#include<cstdlib>#include<cassert>#include<cmath>#include<iomanip>#include<random>#include<ctime>#include<complex>#include<type_traits>#include <ext/pb_ds/assoc_container.hpp>#include <ext/pb_ds/tree_policy.hpp>using namespace std;using namespace __gnu_pbds;typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;typedef long long LL;typedef double D;#define all(v) (v).begin(), (v).end()mt19937 gene(chrono::system_clock::now().time_since_epoch().count());typedef complex<double> Complex;#define fi first#define se second#define ins insert#define pb push_backinline char GET_CHAR(){const int maxn = 131072;static char buf[maxn],*p1=buf,*p2=buf;return p1==p2&&(p2=(p1=buf)+fread(buf,1,maxn,stdin),p1==p2)?EOF:*p1++;}inline int getInt() {int res(0);char c = getchar();while(c < '0') c = getchar();while(c >= '0') {res = res * 10 + (c - '0');c = getchar();}return res;}inline LL fastpo(LL x, LL n, LL mod) {LL res(1);while(n) {if(n & 1) {res = res * (LL)x % mod;}x = x * (LL) x % mod;n /= 2;}return res;}template<LL mod> struct Num {LL a;Num operator + (const Num & b) { return Num{(a + b.a) % mod}; }Num operator - (const Num & b) { return Num{(a - b.a + mod) % mod}; }Num operator * (const Num & b) { return Num{a * b.a % mod}; }Num operator / (const Num & b) { return Num{a * fastpo(b.a, mod - 2, mod) % mod}; }void operator += (const Num & b) {if((a += b.a) >= mod) a -= mod;}void operator -= (const Num & b) {if((a -= b.a) < 0) a += mod;}void operator *= (const Num & b) { a = a * b.a % mod; }void operator /= (const Num & b) { a = a * fastpo(b.a, mod - 2, mod) % mod; }void operator = (const Num & b) { a = b.a; }void operator = (const LL & b) { a = b; }};template<LL mod> ostream & operator << (ostream & os, const Num<mod> & a) {os << a.a;return os;}LL gcd(LL a, LL b) { return b ? gcd(b, a % b) : a; }inline string itoa(LL x, int width = 0) {string res;if(x == 0) res.push_back('0');while(x) {res.push_back('0' + x % 10);x /= 10;}while((int)res.size() < width) res.push_back('0');reverse(res.begin(), res.end());return res;}const int _B = 131072;char buf[_B];int _bl = 0;inline void flush() {fwrite(buf, 1, _bl, stdout);_bl = 0;}__inline void _putchar(char c) {if(_bl == _B) flush();buf[_bl++] = c;}inline void print(LL x, char c) {static char tmp[20];int l = 0;if(!x) tmp[l++] = '0';else {while(x) {tmp[l++] = x % 10 + '0';x /= 10;}}for(int i = l - 1; i >= 0; i--) _putchar(tmp[i]);_putchar(c);}typedef double C;struct P {C x, y;void scan() {double _x, _y;scanf("%lf%lf", &_x, &_y);x = _x; y = _y;}void print() {cout << '(' << x << ' ' << y << ')' << endl;}P operator + (const P & b) const { return P{x + b.x, y + b.y}; }P operator - (const P & b) const { return P{x - b.x, y - b.y}; }C operator * (const P & b) const { return x * b.y - y * b.x; }C operator % (const P & b) const { return x * b.x + y * b.y; }};P operator * (const C & x, const P & b) { return P{x * b.x, x * b.y}; }const int N = 1111;const int LOG = 20;const int mod = 1e9 + 7;const int inf = 1e9 + 7;int n, m;int dx[4] = {1, 0, -1, 0};int dy[4] = {0, 1, 0, -1};int rela[N];int getr(int x) {int p = x;while(rela[p] != p) p = rela[p];int p1 = p; p = x;while(rela[p] != p) {int p2 = rela[p];rela[p] = p1;p = p2;}return p1;}int c[N][N], fac[N], invfac[N], vst[N];int a[N], dp[N], pd[N];int main() {int n, m;scanf("%d%d", &n, &m);for(int i = 1; i <= n; i++) {scanf("%d", &a[i]);}map<int, int> mp;vector<vector<int> > tot;for(int i = 1; i <= n; i++) {if(vst[i]) continue;int x = i;vector<int> vec;do {vec.pb(x);vst[x] = true;x = a[x];}while(x != i);tot.pb(vec);mp[vec.size()]++;}for(int i = 0; i <= n; i++) {for(int j = 0; j <= i; j++) {c[i][j] = !i || !j ? 1 : (c[i - 1][j - 1] + c[i - 1][j]) % mod;}fac[i] = i == 0 ? 1 : fac[i - 1] * (LL)i % mod;invfac[i] = fastpo(fac[i], mod - 2, mod);}LL ans = 1;for(auto t : mp) {vector<int> p;int k = t.fi;int num = t.se;for(int i = 1; i <= num; i++) {dp[i] = 0;}dp[0] = 1;for(int i = 1; i <= num; i++) {if(k * i / gcd(k * i, m) == k) {int w = fastpo(k, i - 1, mod) * fac[i - 1] % mod;//cout << i << ' ' << w << endl;memset(pd, 0, sizeof(int) * (num + 1));for(int j = 0; j <= num; j++) {LL cur = 1;for(int l = 0; j + l * i <= num; l++) {//cout << i << ' ' << j << ' ' << cur << endl;pd[j + l * i] = (pd[j + l * i] + dp[j] * cur % mod * invfac[l]) % mod;cur = cur * w % mod;cur = cur * c[num - j - l * i][i] % mod;}}memcpy(dp, pd, sizeof(int) * (num + 1));}}ans = (LL)ans * dp[num] % mod;}cout << ans << endl;}