제출 #1125658

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1125658		underwaterkillerwhale	Zapina (COCI20_zapina)	C++20	110 / 110	88 ms	1864 KiB

zapina

//#include"holiday.h"
#include <bits/stdc++.h>
#define ll long long
#define rep(i,m,n) for(int i=(m); i<=(n); i++)
#define REB(i,m,n) for(int i=(m); i>=(n); i--)
#define pii pair<int,int>
#define pll pair<ll,ll>
#define MP make_pair
#define fs first
#define se second
#define bit(msk, i) ((msk >> i) & 1)
#define iter(id, v) for(auto id : v)
#define pb push_back
#define SZ(v) (ll)v.size()
#define ALL(v) v.begin(),v.end()

using namespace std;

mt19937_64 rd(chrono :: steady_clock :: now ().time_since_epoch().count());
ll Rand (ll l, ll r) { return uniform_int_distribution<ll> (l, r) (rd); }

const int N = 350 + 7;
const int Mod = 1e9 + 7;///lon
const ll INF = 1e18 + 7;
const ll BASE = 137;
const int szBL = 450;

inline void Add (int &A, int B) {
    A += B;
    if (A >= Mod) A -= Mod;
}

int n;
int dp[N][N][2];
int C[N][N];

void solution () {
    cin >> n;
    rep (i, 0, n) {
        rep (j, 0, i) {
            if (j == 0 || j == i) {
                C[j][i] = 1;
                continue;
            }
            C[j][i] = (C[j][i - 1] + C[j - 1][i - 1]) % Mod;
        }
    }
    dp[0][0][0] = 1;
    rep (i, 1, n) {
        rep (j, 0, n) {
            rep (k, 0, j) {
                Add(dp[i][j][1], 1LL * dp[i - 1][j - k][1] * C[k][n - j + k] % Mod);
                if (k != i) {
                    Add(dp[i][j][0], 1LL * dp[i - 1][j - k][0] * C[k][n - j + k] % Mod);
                }
                else {
                    Add(dp[i][j][1], 1LL * dp[i - 1][j - k][0] * C[k][n - j + k] % Mod);
                }
            }
        }
    }
    cout << dp[n][n][1] <<"\n";
}

#define file(name) freopen(name".inp","r",stdin); \
freopen(name".out","w",stdout);
int main () {
//    file("c");
    ios_base :: sync_with_stdio(false); cin.tie(0); cout.tie(0);
    int num_Test = 1;
//    cin >> num_Test;
    while (num_Test--)
        solution();
}
/*
no bug challenge +31

*/

• Subtask 1: 22 / 22
• Subtask 2: 33 / 33
• Subtask 3: 55 / 55