結果
問題 | No.1259 スイッチ |
ユーザー |
![]() |
提出日時 | 2020-10-16 22:14:38 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 20 ms / 2,000 ms |
コード長 | 4,233 bytes |
コンパイル時間 | 1,051 ms |
コンパイル使用メモリ | 117,192 KB |
実行使用メモリ | 11,008 KB |
最終ジャッジ日時 | 2024-07-20 22:00:06 |
合計ジャッジ時間 | 2,992 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 1 ms
5,376 KB |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 2 ms
5,376 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 2 ms
5,376 KB |
testcase_09 | AC | 1 ms
5,376 KB |
testcase_10 | AC | 14 ms
7,896 KB |
testcase_11 | AC | 19 ms
10,576 KB |
testcase_12 | AC | 12 ms
7,680 KB |
testcase_13 | AC | 8 ms
5,888 KB |
testcase_14 | AC | 10 ms
6,956 KB |
testcase_15 | AC | 8 ms
5,760 KB |
testcase_16 | AC | 16 ms
9,228 KB |
testcase_17 | AC | 10 ms
6,784 KB |
testcase_18 | AC | 18 ms
10,008 KB |
testcase_19 | AC | 18 ms
9,856 KB |
testcase_20 | AC | 13 ms
7,936 KB |
testcase_21 | AC | 20 ms
10,624 KB |
testcase_22 | AC | 7 ms
5,504 KB |
testcase_23 | AC | 18 ms
9,984 KB |
testcase_24 | AC | 13 ms
8,192 KB |
testcase_25 | AC | 13 ms
7,936 KB |
testcase_26 | AC | 20 ms
10,880 KB |
testcase_27 | AC | 16 ms
9,344 KB |
testcase_28 | AC | 13 ms
8,064 KB |
testcase_29 | AC | 16 ms
9,344 KB |
testcase_30 | AC | 11 ms
7,040 KB |
testcase_31 | AC | 15 ms
8,704 KB |
testcase_32 | AC | 7 ms
5,632 KB |
testcase_33 | AC | 20 ms
10,848 KB |
testcase_34 | AC | 12 ms
7,296 KB |
testcase_35 | AC | 15 ms
9,088 KB |
testcase_36 | AC | 14 ms
8,564 KB |
testcase_37 | AC | 13 ms
8,236 KB |
testcase_38 | AC | 14 ms
7,808 KB |
testcase_39 | AC | 19 ms
10,524 KB |
testcase_40 | AC | 19 ms
10,624 KB |
testcase_41 | AC | 15 ms
9,216 KB |
testcase_42 | AC | 19 ms
10,796 KB |
testcase_43 | AC | 12 ms
7,680 KB |
testcase_44 | AC | 18 ms
10,240 KB |
testcase_45 | AC | 20 ms
11,008 KB |
testcase_46 | AC | 12 ms
7,360 KB |
testcase_47 | AC | 20 ms
10,880 KB |
testcase_48 | AC | 10 ms
7,040 KB |
testcase_49 | AC | 19 ms
10,684 KB |
testcase_50 | AC | 12 ms
7,552 KB |
testcase_51 | AC | 7 ms
5,632 KB |
testcase_52 | AC | 20 ms
10,624 KB |
testcase_53 | AC | 10 ms
6,528 KB |
testcase_54 | AC | 19 ms
10,392 KB |
testcase_55 | AC | 6 ms
5,376 KB |
testcase_56 | AC | 10 ms
6,912 KB |
testcase_57 | AC | 17 ms
9,728 KB |
testcase_58 | AC | 13 ms
7,720 KB |
testcase_59 | AC | 15 ms
8,916 KB |
testcase_60 | AC | 20 ms
11,008 KB |
ソースコード
#include <iostream> #include <string> #include <vector> #include <algorithm> #include <utility> #include <tuple> #include <cstdint> #include <cstdio> #include <map> #include <queue> #include <set> #include <stack> #include <deque> #include <unordered_map> #include <unordered_set> #include <bitset> #include <cctype> #include <functional> #include <ctime> #include <fstream> #include <cmath> #include <limits> #include <chrono> #include <numeric> #include <type_traits> #include <iomanip> #include <float.h> #include <math.h> #include <cassert> #pragma warning (disable: 4996) using namespace std; using ll = long long; unsigned euclidean_gcd(unsigned a, unsigned b) { if (a < b) return euclidean_gcd(b, a); unsigned r; while ((r = a % b)) { a = b; b = r; } return b; } ll ll_gcd(ll a, ll b) { if (a < b) return ll_gcd(b, a); ll r; while ((r = a % b)) { a = b; b = r; } return b; } struct UnionFind { vector <ll> par; vector <ll> siz; UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) { for (ll i = 0; i < sz_; ++i) par[i] = i; } void init(ll sz_) { par.resize(sz_); siz.assign(sz_, 1LL); for (ll i = 0; i < sz_; ++i) par[i] = i; } ll root(ll x) { while (par[x] != x) { x = par[x] = par[par[x]]; } return x; } bool merge(ll x, ll y) { x = root(x); y = root(y); if (x == y) return false; if (siz[x] < siz[y]) swap(x, y); siz[x] += siz[y]; par[y] = x; return true; } bool issame(ll x, ll y) { return root(x) == root(y); } ll size(ll x) { return siz[root(x)]; } }; long long modpow(long long a, long long n, long long mod) { if (n < 0)return 0; long long res = 1; while (n > 0) { if (n & 1) res = res * a % mod; a = a * a % mod; n >>= 1; } return res; } long long modinv(long long a, long long mod) { return modpow(a, mod - 2, mod); } ll merge_cnt(vector<ll>& a) { int n = a.size(); if (n <= 1) { return 0; } ll cnt = 0; vector<ll> b(a.begin(), a.begin() + n / 2); vector<ll> c(a.begin() + n / 2, a.end()); cnt += merge_cnt(b); cnt += merge_cnt(c); int ai = 0, bi = 0, ci = 0; while (ai < n) { if (bi < b.size() && (ci == c.size() || b[bi] <= c[ci])) { a[ai++] = b[bi++]; } else { cnt += n / 2 - bi; a[ai++] = c[ci++]; } } return cnt; } struct edge { ll to, cost; }; typedef pair<ll, ll> P; struct graph { ll V; vector<vector<edge> > G; vector<ll> d; graph(ll n) { init(n); } void init(ll n) { V = n; G.resize(V); d.resize(V); for (int i = 0; i < V; i++) { d[i] = 2000000000000000000; } } void add_edge(ll s, ll t, ll cost) { edge e; e.to = t, e.cost = cost; G[s].push_back(e); } void dijkstra(ll s) { for (int i = 0; i < V; i++) { d[i] = 2000000000000000000; } d[s] = 0; priority_queue<P, vector<P>, greater<P> > que; que.push(P(0, s)); while (!que.empty()) { P p = que.top(); que.pop(); ll v = p.second; if (d[v] < p.first) continue; for (auto e : G[v]) { if (d[e.to] > d[v] + e.cost) { d[e.to] = d[v] + e.cost; que.push(P(d[e.to], e.to)); } } } } }; int main() { ll n, k, m; cin >> n >> k >> m; vector<ll> bik(n + 1); bik[0] = 1; for (ll i = 0; i < n; i++) { bik[i + 1] = bik[i] * (i + 1) % 1000000007; } ll ans = 0; for (ll i = 1; i < min(k + 1,n+1); i++) { if (k % i != 0 || i > n)continue; ans += bik[n - 1] * modinv(bik[n - i], 1000000007) % 1000000007 * modpow(n, n - i, 1000000007) % 1000000007; ans %= 1000000007; } ans %= 1000000007; if (m == 1)cout << ans << endl; else cout << (modpow(n, n, 1000000007) - ans + 1000000007) * modinv(n - 1, 1000000007) % 1000000007 << endl; }