結果
問題 | No.2514 Twelvefold Way Returns |
ユーザー |
👑 ![]() |
提出日時 | 2023-07-23 19:34:05 |
言語 | C++17(clang) (17.0.6 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 124 ms / 3,000 ms |
コード長 | 4,318 bytes |
コンパイル時間 | 4,357 ms |
コンパイル使用メモリ | 161,072 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-09-20 15:49:54 |
合計ジャッジ時間 | 6,587 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 38 |
ソースコード
#define ATCODER#define _USE_MATH_DEFINES#include<stdio.h>#include<iostream>#include<fstream>#include<algorithm>#include<vector>#include<string>#include <cassert>#include <numeric>#include <unordered_map>#include <unordered_set>#include <queue>#include <math.h>#include <climits>#include <set>#include <map>#include <list>#include <random>#include <iterator>#include <bitset>#include <chrono>using namespace std;using ll = long long;using ld = long double;using pll = pair<ll, ll>;using pdd = pair<ld, ld>;//template<class T> using pq = priority_queue<T, vector<T>, greater<T>>;#define FOR(i, a, b) for(ll i=(a); i<(b);i++)#define REP(i, n) for(ll i=0; i<(n);i++)#define ROF(i, a, b) for(ll i=(b-1); i>=(a);i--)#define PER(i, n) for(ll i=n-1; i>=0;i--)#define REPREP(i,j,a,b) for(ll i=0;i<a;i++)for(ll j=0;j<b;j++)#define VV(type) vector< vector<type> >#define VV2(type,n,m,val) vector< vector<type> > val;val.resize(n);for(ll i;i<n;i++)val[i].resize(m)#define vec(type) vector<type>#define VEC(type,n,val) vector<type> val;val.resize(n)#define VL vector<ll>#define VVL vector< vector<ll> >#define VP vector< pair<ll,ll> >#define SZ size()#define all(i) begin(i),end(i)#define SORT(i) sort(all(i))#define BITI(i) (1<<i)#define BITSET(x,i) x | (ll(1)<<i)#define BITCUT(x,i) x & ~(ll(1)<<i)#define EXISTBIT(x,i) (((x>>i) & 1) != 0)#define ALLBIT(n) (ll(1)<<n-1)#define CHMAX(n,v) n=n<v?v:n#define CHMIN(n,v) n=n>v?v:n#define MP(a,b) make_pair(a,b)#define DET2(x1,y1,x2,y2) x1*y2-x2*y1#define DET3(x1,y1,z1,x2,y2,z2,x3,y3,z3) x1*y2*z3+x2*y3*z1+x3*y1*z2-z1*y2*x3-z2*y3*x1-z3*y1*x2#define INC(a) for(auto& v:a)v++;#define DEC(a) for(auto& v:a)v--;#define SQU(x) (x)*(x)#define L0 ll(0)#ifdef ATCODER#include <atcoder/all>using namespace atcoder;using mint = modint1000000007;using mint2 = modint998244353;#endiftemplate<typename T = ll>vector<T> read(size_t n) {vector<T> ts(n);for (size_t i = 0; i < n; i++) cin >> ts[i];return ts;}template<typename TV, const ll N> void read_tuple_impl(TV&) {}template<typename TV, const ll N, typename Head, typename... Tail>void read_tuple_impl(TV& ts) {get<N>(ts).emplace_back(*(istream_iterator<Head>(cin)));read_tuple_impl<TV, N + 1, Tail...>(ts);}template<typename... Ts> decltype(auto) read_tuple(size_t n) {tuple<vector<Ts>...> ts;for (size_t i = 0; i < n; i++) read_tuple_impl<decltype(ts), 0, Ts...>(ts);return ts;}using val = ll;using func = ll;val op(val a, val b) { return min(a, b); }val e() { return 1e18; }val mp(func f, val a) {if (f == -1)return a;return f;}func comp(func f, func g) {if (f == -1)return g;return f;}func id() { return -1; }ll di[4] = { 1,0,-1,0 };ll dj[4] = { 0,1,0,-1 };//ll di[4] = { -1,-1,1,1 };//ll dj[4] = { -1,1,-1,1 };ll di8[8] = { 0,-1,-1,-1,0,1,1,1 };ll dj8[8] = { -1,-1,0,1,1,1,0,-1 };template<typename T>void Factorical(ll siz, vector<T>& out) {out.resize(siz + 1);out[0] = T(1);for (ll i = 0; i < siz; i++) {out[i + 1] = out[i] * (i + 1);}}template<typename T>T Combi(ll a, ll b, vector<T>& fact) {if (a < 0 || b < 0 || a < b)return 0;return fact[a] / (fact[b] * fact[a - b]);}void solve() {ll n, m;cin >> n >> m;vector<mint2> fact;Factorical(m + 1, fact);vector<mint2> ans(3);REP(w0, m+1) {REP(w1, m + 1) {ll w2 = m - w0 - w1;if (w2 < 0)break;vector<mint2> g(3);ll gw = (w1 * 2 + w2) % 3;g[gw] = fact[m] / (fact[w0] * fact[w1] * fact[w2]);vector<mint2> f(3);f[0] = w0;f[1] = w1;f[2] = w2;ll bn = n;auto mf = f;while (bn) {if (bn % 2) {g = convolution(g, mf);while (g.size() > 3) {g[(g.size() - 1) % 3] += g.back();g.pop_back();}}mf = convolution(mf, mf);while (mf.size() > 3) {mf[(mf.size() - 1) % 3] += mf.back();mf.pop_back();}bn /= 2;}REP(i, 3) {ans[i] += g[i];}}}mint2 div = mint2(1) / 3;div = div.pow(m);cout << ((ans[0] - ans[1]) * div).val();return;}int main() {ll t = 1;//cin >> t;while (t--) {solve();}return 0;}