#921664 (C++14) No.2514 Twelvefold Way Returns

提出ソース

結果

問題	No.2514 Twelvefold Way Returns
ユーザー	woodywoody
提出日時	2023-10-21 06:39:06
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	1,601 ms / 3,000 ms
コード長	6,824 bytes
コンパイル時間	4,647 ms
コンパイル使用メモリ	249,276 KB
実行使用メモリ	81,196 KB
最終ジャッジ日時	2023-10-21 06:39:49
合計ジャッジ時間	42,997 ms
ジャッジサーバーID （参考情報）	judge11 / judge15

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	114 ms 81,196 KB
testcase_01	AC	153 ms 81,196 KB
testcase_02	AC	355 ms 81,196 KB
testcase_03	AC	181 ms 81,196 KB
testcase_04	AC	1,323 ms 81,196 KB
testcase_05	AC	1,145 ms 81,196 KB
testcase_06	AC	981 ms 81,196 KB
testcase_07	AC	117 ms 81,196 KB
testcase_08	AC	749 ms 81,196 KB
testcase_09	AC	765 ms 81,196 KB
testcase_10	AC	1,418 ms 81,196 KB
testcase_11	AC	174 ms 81,196 KB
testcase_12	AC	444 ms 81,196 KB
testcase_13	AC	128 ms 81,196 KB
testcase_14	AC	343 ms 81,196 KB
testcase_15	AC	637 ms 81,196 KB
testcase_16	AC	1,404 ms 81,196 KB
testcase_17	AC	873 ms 81,196 KB
testcase_18	AC	1,479 ms 81,196 KB
testcase_19	AC	1,504 ms 81,196 KB
testcase_20	AC	1,533 ms 81,196 KB
testcase_21	AC	1,542 ms 81,196 KB
testcase_22	AC	1,555 ms 81,196 KB
testcase_23	AC	682 ms 81,196 KB
testcase_24	AC	1,485 ms 81,196 KB
testcase_25	AC	800 ms 81,196 KB
testcase_26	AC	115 ms 81,196 KB
testcase_27	AC	1,543 ms 81,196 KB
testcase_28	AC	1,387 ms 81,196 KB
testcase_29	AC	1,131 ms 81,196 KB
testcase_30	AC	1,335 ms 81,196 KB
testcase_31	AC	1,448 ms 81,196 KB
testcase_32	AC	712 ms 81,196 KB
testcase_33	AC	116 ms 81,196 KB
testcase_34	AC	340 ms 81,196 KB
testcase_35	AC	1,302 ms 81,196 KB
testcase_36	AC	114 ms 81,196 KB
testcase_37	AC	115 ms 81,196 KB
testcase_38	AC	1,557 ms 81,196 KB
testcase_39	AC	1,581 ms 81,196 KB
testcase_40	AC	1,601 ms 81,196 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define rrepx(i,x,b) for(int i=b-1;i>=x;i--)
#define fore(i,a) for(auto& i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second
#define pcnt __builtin_popcountll

using namespace std;
using namespace atcoder;

using ll = long long;
using ld = long double;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return true;} else {cout << "No" << endl; return false;}}
#define retval(x) {cout << #x << endl; return;}
#define cout2(x,y) cout << x << " " << y << endl;
#define coutp(p) cout << p.fi << " " << p.se << endl;
#define out cout << ans << endl;
#define outd cout << fixed << setprecision(20) << ans << endl;
#define outm cout << ans.val() << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define outdv fore(yans , ans) cout << yans.val() << "\n";
#define assertmle(x) if (!(x)) {vi v(3e8);}
#define asserttle(x) if (!(x)) {while(1){}}
#define coutv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define coutv2(v) fore(vy , v) cout << vy << "\n";
#define coutvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define coutvm2(v) fore(vy , v) cout << vy.val() << "\n";
using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;using pii = pair<int,int>;using pdd = pair<ld,ld>;
using vi = vector<int>;using vd = vector<ld>;using vl = vector<ll>;using vs = vector<string>;using vb = vector<bool>;
using vpii = vector<pii>;using vpli = vector<pli>;using vpll = vector<pll>;using vpil = vector<pil>;
using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvs = vector<vector<string>>;using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;using vvpli = vector<vector<pli>>;using vvpll = vector<vpll>;using vvpil = vector<vpil>;
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = dynamic_modint<0>;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
#define yes {cout <<"Yes"<<endl;}
#define no {cout <<"No"<<endl;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#ifdef MY_LOCAL_DEBUG
#include "./debug/localDebug.cpp"
#define showp(p) cerr<<#p<<" = "<<p.fi<<" : "<<p.se<<endl
#define show1(a) cerr<<#a<<" = "<<a<<endl
#define show2(a,b) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<endl
#define show3(a,b,c) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<endl
#define show4(a,b,c,d) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<" : "<<#d<<" = "<<d<<endl
#define show5(a,b,c,d,e) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<" : "<<#d<<" = "<<d<<" : "<<#e<<" = "<<e<<endl
#define DEBUG_LINE cout << "DEBUG_LINE : " << __LINE__ << endl
#define showv(v) {cout<<#v<<" : "; fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) {cout<<#v<<endl; fore(vy , v) cout << vy << "\n";}
#define showvm(v) {cout<<#v<<" : "; fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define showvm2(v) {cout<<#v<<endl; fore(vy , v) cout << vy.val() << "\n";}
#define showmat(v) {cout<<#v<<endl; fore(row , v) { fore(seg , row) cout << seg << " "; cout << endl;}}
#define showmatm(v) {cout<<#v<<endl; fore(row , v) { fore(seg , row) cout << seg.val() << " "; cout << endl;}}
#else
#define showp(p)
#define show1(a)
#define show2(a,b)
#define show3(a,b,c)
#define show4(a,b,c,d)
#define show5(a,b,c,d,e)
#define DEBUG_LINE
#define showv(v)
#define showv2(v)
#define showvm(v)
#define showvm2(v)
#define showmat(v)
#define showmatm(v)
#endif
#define overload5(a,b,c,d,e,f, ...) f
#define show(...) overload5(__VA_ARGS__, show5, show4, show3, show2, show1)(__VA_ARGS__)

struct matexp{
    int n;
    const int logmax = 64;
    vector<vvm> exp;

    matexp(int n) : n(n){
        exp.resize(logmax,vvm(n,vm(n)));
    }
    matexp(vvm a){
        n = sz(a);
        exp.resize(logmax,vvm(n,vm(n)));
        init(a);
    }

    vvm mat_product(vvm& a,vvm& b){
        int n1 = sz(a);
        int m1 = sz(a[0]);
        int n2 = sz(b);
        int m2 = sz(b[0]);
        assert(m1 == n2);
        vvm ret(n1,vm(m2));
        rep(i,n1) rep(j,m2) rep(k,m1) ret[i][j] += a[i][k]*b[k][j];
        return ret;
    }

    void init(vvm a){
        exp[0] = a;
        rep1(i,logmax) exp[i] = mat_product(exp[i-1],exp[i-1]);
    }

    vvm getexp_k(ll k){
        vvm ret(n,vm(n));
        rep(i,n) ret[i][i] = 1;
        rep(i,logmax) if ((k >> i & 1) == 1) ret = mat_product(ret,exp[i]);
        return ret;
    }
};

// A^k (Aは行列)を計算

// matexp(n) : n(行列の次元)を初期化
// mat_product(a,b) : 行列積a*bを返す 
// init(a) : 行列Aを初期化
// getexp_k : A^kを返す 

struct combination {
  vector<mint> fact, ifact;
  combination(int n):fact(n+1),ifact(n+1) {
    fact[0] = 1;
    for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;
    ifact[n] = fact[n].inv();
    for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;
  }
  mint operator()(int n, int k) {
    if (k < 0 || k > n) return 0;
    return fact[n]*ifact[k]*ifact[n-k];
  }
} com(10000005);

void solve(){
    int n,m; cin>>n>>m;

    mint p = 0;
    mint q = 0;
    mint r = 0;
    rep(i,m+1) rep(j,m+1){
        int k = m-i-j;
        if (k < 0) continue;
        vvm a(3,vm(3));
        a[0] = vm{i,k,j};
        a[1] = vm{j,i,k};
        a[2] = vm{k,j,i};
        matexp v(a);
        vvm t = v.getexp_k(n);
        mint pt = t[0][0];
        mint qt = t[1][0];
        mint rt = t[2][0];
        mint coef = com.fact[m]*com.ifact[i]*com.ifact[j]*com.ifact[k];
        if ((j*2+k)%3==0){
            p += pt * coef;
            q += qt * coef;
            r += rt * coef;
        }else if((j*2+k)%3==1){
            p += rt * coef;
            q += pt * coef;
            r += qt * coef;
        }else{
            p += qt * coef;
            q += rt * coef;
            r += pt * coef;
        }
    }
    mint ans = p-q;
    ans /= mint(3).pow(m);
    outm;

    return;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    //cin>>t;

    rep(i,t){
        solve();
    }

    return 0;
}

yukicoder

結果

テストケース

ソースコード