Submission #637452

#	Time	Username	Problem	Language	Result	Execution time	Memory
637452		vovamr	Zapina (COCI20_zapina)	C++17	110 / 110	154 ms	1908 KiB

zapina

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fi first
#define se second
#define ll long long
#define ld long double
#define sz(x) ((int)(x).size())
#define all(x) 	(x).begin(), (x).end()
#define pb push_back
#define mpp make_pair
#define ve vector
using namespace std;
using namespace __gnu_pbds;
template<class T> using oset = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
const ll inf = 1e18; const int iinf = 1e9;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T> inline bool chmin(T& a, T b) { return (a > b ? a = b, 1 : 0); }
template <typename T> inline bool chmax(T& a, T b) { return (a < b ? a = b, 1 : 0); }

constexpr int md = 1e9 + 7; constexpr int iv2 = (md + 1) / 2;
inline int add(int a, int b) { if((a+=b)>=md)a-=md; return a; }
inline int sub(int a, int b) { if((a-=b)<0)a+=md; return a; }
inline int mul(int a, int b) { return 1ll*a*b%md; }
inline int bp(int a, int n) { int res = 1;
	for (; n; n >>= 1, a = mul(a, a)) {
		if (n & 1) res = mul(res, a);
	} return res;
}
inline int inv(int a) { return bp(a, md - 2); }

const int N = 353;
int dp[N][N][2];
int c[N][N];

inline void solve() {
	int n;
	cin >> n;

	for (int i = 0; i <= n; ++i) {
		c[i][0] = 1;
		for (int j = 1; j <= i; ++j) {
			c[i][j] = add(c[i - 1][j], c[i - 1][j - 1]);
		}
	}

	dp[0][0][0] = 1;
	for (int i = 0; i < n; ++i) {
		for (int have = 0; have <= n; ++have) {
			for (int fl : {0, 1}) {
				if (!dp[i][have][fl]) continue;
				for (int take = 0; have + take <= n; ++take) {
					int &f = dp[i + 1][have + take][fl | (i + 1 == take)];
					f = add(f, mul(dp[i][have][fl], c[n - have][take]));
				}
			}
		}
	}

	cout << dp[n][n][1];
}

signed main() {
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	int q = 1; // cin >> q;
	while (q--) solve();
	cerr << fixed << setprecision(3) << "Time execution: " << (double)clock() / CLOCKS_PER_SEC << endl;
}

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