結果
| 問題 |
No.1500 Super Knight
|
| コンテスト | |
| ユーザー |
 fuppy_kyopro
|
| 提出日時 | 2021-05-08 00:01:06 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 610 ms / 2,000 ms |
| コード長 | 5,859 bytes |
| コンパイル時間 | 2,068 ms |
| コンパイル使用メモリ | 205,936 KB |
| 最終ジャッジ日時 | 2025-01-21 08:59:07 |
|
ジャッジサーバーID （参考情報） |
judge3 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 33 |
ソースコード
/*
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//*/
#include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cerr << #v << ":"; \
for (int iiiiiiii = 0; iiiiiiii < v.size(); iiiiiiii++) \
cerr << " " << v[iiiiiiii]; \
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()
void YES(bool t = true) {
cout << (t ? "YES" : "NO") << endl;
}
void Yes(bool t = true) { cout << (t ? "Yes" : "No") << endl; }
void yes(bool t = true) { cout << (t ? "yes" : "no") << endl; }
void NO(bool t = true) { cout << (t ? "NO" : "YES") << endl; }
void No(bool t = true) { cout << (t ? "No" : "Yes") << endl; }
void no(bool t = true) { cout << (t ? "no" : "yes") << endl; }
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;
int popcount(ll t) { return __builtin_popcountll(t); }
// 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 = {0, 1, 0, -1}, dy = {-1, 0, 1, 0};
// vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };
struct Setup_io {
Setup_io() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cout << fixed << setprecision(25);
}
} setup_io;
const ll MOD = 1000000007;
// const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'
vii solve(vii a, int N) {
vii b(N, vi(N));
rep(i, N) {
rep(j, N) {
if (a[i][j] == 0) continue;
for (int y = -3; y <= 3; y++) {
for (int x = -3; x <= 3; x++) {
if ((abs(x) == 3 or abs(y) == 3) and (x + y) % 2 != 0) {
b[i + y][j + x] = 1;
}
}
}
}
}
return b;
}
vl fact(111111), rfact(111111);
ll mod_pow(ll x, ll p, ll M = MOD) {
ll a = 1;
while (p) {
if (p % 2)
a = a * x % M;
x = x * x % M;
p /= 2;
}
return a;
}
ll mod_inverse(ll a, ll M = MOD) {
return mod_pow(a, M - 2, M);
}
void set_fact(ll n, ll M = MOD) {
fact[0] = fact[1] = rfact[0] = rfact[1] = 1;
for (ll i = 2; i <= n; i++) {
fact[i] = i * fact[i - 1] % M;
rfact[i] = mod_inverse(fact[i], M);
}
}
template <typename T>
T lagrange_polynomial(const vector<T> &y, int64_t t) {
int N = y.size() - 1;
if (t <= N) return y[t];
T ret(0);
vector<T> dp(N + 1, 1), pd(N + 1, 1);
for (int i = 0; i < N; i++)
dp[i + 1] = dp[i] * (t - i) % MOD;
for (int i = N; i > 0; i--)
pd[i - 1] = pd[i] * (t - i) % MOD;
for (int i = 0; i <= N; i++) {
T tmp = y[i] * dp[i] % MOD * pd[i] % MOD * rfact[i] % MOD * rfact[N - i] % MOD;
if ((N - i) & 1)
ret -= tmp;
else
ret += tmp;
ret %= MOD;
}
return (ret + MOD) % MOD;
}
signed main() {
// ll n;
// cin >> n;
// if (n == 0) {
// cout << 1 << endl;
// } else if (n == 1) {
// cout << 12 << endl;
// } else {
// ll m = 3 * n + 1;
// m %= MOD;
// cout << m * m % MOD << endl;
// }
// return 0;
ll nn;
cin >> nn;
set_fact(1000);
const int N = 699;
vii a(N, vi(N));
a[N / 2][N / 2] = 1;
// vl ans;
vl y;
for (int n = 0; n < 100; n++) {
// DEBUG(n);
int s = 0;
rep(i, N) rep(j, N) s += a[i][j];
if (n >= 10) y.push_back(s);
if (n == nn) {
cout << s << endl;
return 0;
}
// DEBUG_MAT(a);
a = solve(a, N);
// ans.push_back(s);
}
ll ans = lagrange_polynomial<ll>(y, nn - 10);
cout << ans << endl;
// ll d = nn - 10;
// ll ans = 1761 + d * 329 % MOD + d * (d + 1) / 2 % MOD * 34 % MOD;
// ans %= MOD;
// cout << ans << endl;
}