結果
問題 | No.1050 Zero (Maximum) |
ユーザー |
![]() |
提出日時 | 2020-05-08 21:45:19 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 17 ms / 2,000 ms |
コード長 | 3,816 bytes |
コンパイル時間 | 1,856 ms |
コンパイル使用メモリ | 175,340 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-07-04 00:22:56 |
合計ジャッジ時間 | 2,705 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 15 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define DEBUG(x) cerr<<#x<<": "<<x<<endl;#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}typedef long long ll;// #define int ll#define vi vector<int>#define vl vector<ll>#define vii vector< vector<int> >#define vll vector< vector<ll> >#define vs vector<string>#define pii pair<int,int>#define pis pair<int,string>#define psi pair<string,int>#define pll pair<ll,ll>template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }#define X first#define Y second#define rep(i,n) for(int i=0;i<(int)(n);i++)#define rep1(i,n) for(int i=1;i<=(int)(n);i++)#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)#define rrep1(i,n) for(int i=(int)(n);i>0;i--)#define REP(i,a,b) for(int i=a;i<b;i++)#define in(x, a, b) (a <= x && x < b)#define all(c) c.begin(),c.end()template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());const ll inf = 1000000001;const ll INF = (ll)1e18 + 1;const long double pi = 3.1415926535897932384626433832795028841971L;#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;//int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};//int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };vi dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };#define fio() cin.tie(0); ios::sync_with_stdio(false);const ll MOD = 1000000007;//const ll MOD = 998244353;// #define mp make_pair//#define endl '\n'struct Modint {ll n;static const ll Mod = 1000000007;Modint(int n = 0) : n(n) {}};Modint operator+(Modint a, Modint b) { return Modint((a.n += b.n) >= MOD ? a.n - a.Mod : a.n); }Modint operator-(Modint a, Modint b) { return Modint((a.n -= b.n) < 0 ? a.n + a.Mod : a.n); }Modint operator*(Modint a, Modint b) { return Modint(1LL * a.n * b.n % a.Mod); }Modint &operator+=(Modint &a, Modint b) { return a = a + b; }Modint &operator-=(Modint &a, Modint b) { return a = a - b; }Modint &operator*=(Modint &a, Modint b) { return a = a * b; }typedef vector<Modint> vec;typedef vector<vec> mat;mat mul(mat &A, mat &B) {mat C(A.size(), vec(B[0].size()));for (int i = 0; i < A.size(); i++) {for (int k = 0; k < B.size(); k++) {for (int j = 0; j < B[0].size(); j++) {C[i][j] = C[i][j] + A[i][k] * B[k][j];}}}return C;}vec mul(mat &A, vec &B) {vec C(A.size());for (int i = 0; i < A.size(); i++) {for (int j = 0; j < B.size(); j++) {C[i] += A[i][j] * B[j];}}return C;}mat pow(mat A, ll n) {mat B(A.size(), vec(A.size()));for (int i = 0; i < A.size(); i++) {B[i][i] = 1;}while (n > 0) {if (n & 1)B = mul(B, A);A = mul(A, A);n >>= 1;}return B;}signed main() {fio();ll p, k;cin >> p >> k;vec b(p);b[0] = 1;mat A(p, vec(p));rep (j, p) {rep (add, p) {int i = (j + add) % p;A[i][j].n++;}rep (mul, p) {int i = (j * mul) % p;A[i][j].n++;}}mat An = pow(A, k);vec x = mul(An, b);cout << x[0].n << endl;}