#include <bits/stdc++.h> using namespace std; #define rep(i, a, b) for (int i = (a); i < (b); i++) #define all(x) begin(x), end(x) #define sz(x) int((x).size()) using ll = long long; using pii = pair<int, int>; using vi = vector<int>; #ifdef LOCAL auto operator<<(auto& o, auto x) -> decltype(x.first, o); auto operator<<(auto& o, auto x) -> decltype(x.end(), o) { o << "{"; for (int i = 0; auto y : x) o << ", " + !i++ * 2 << y; return o << "}"; } auto operator<<(auto& o, auto x) -> decltype(x.first, o) { return o << "(" << x.first << ", " << x.second << ")"; } void __print(auto... x) { ((cerr << x << " "), ...) << endl; } #define debug(x...) __print("[" #x "]:", x) #else #define debug(...) 2137 #endif ll mod; int n; const int nax = 1e6 + 10; ll f[nax]; ll bp(ll a, ll b) { ll r = 1; while(b) { if(b & 1) r = r * a % mod; a = a * a % mod; b /= 2; } return r; } vector<vector<vector<int>>> tableaux; void rec(vector<vector<int>>& v, vector<int>& cur_len, int id) { if(id == n) { tableaux.push_back(v); return; } int prv = 1e9; for(int i = 0; i < v.size(); i++) { if(cur_len[i] < v[i].size() && cur_len[i] < prv) { v[i][cur_len[i]] = id; cur_len[i]++; rec(v, cur_len, id + 1); cur_len[i]--; } prv = cur_len[i]; } } vector<int> get_perm(int x, int y) { vector<vector<int>> P = tableaux[x]; vector<vector<int>> Q = tableaux[y]; vector<int> p(n); for(int ind = n - 1; ind >= 0; ind--) { int i = 0, j; while(i < Q.size()) { if(Q[i].back() == ind) { j = sz(Q[i]) - 1; break; } i++; } int cur = P[i][j]; P[i].pop_back(); Q[i].pop_back(); i--; while(i >= 0) { j = upper_bound(P[i].begin(), P[i].end(), cur) - P[i].begin(); swap(P[i][j - 1], cur); i--; } p[ind] = cur; } return p; } int main() { cin.tie(0)->sync_with_stdio(0); int a, b, c; cin >> a >> b >> c >> mod; n = a * b; for(int i = 1; i <= a + b - 1 - c; i++) { n -= i; } f[0] = 1; for(int i = 1; i < nax; i++) { f[i] = f[i - 1] * i % mod; } if(c == a + b - 1) { ll prod = 1; for(int i = 1; i <= a; i++) { for(int j = 1; j <= b; j++) { prod = prod * (i + j - 1) % mod; } } prod = f[n] * bp(prod, mod - 2) % mod; prod = prod * prod % mod; cout << n << " " << prod << endl; } else if(n <= 9) { vector<int> p(n); iota(all(p), 0); ll cnt = 0; do { vector<int> lt(n); int aa = 0; for(int i = 0; i < n; i++) { for(int j = 0; j < i; j++) { if(p[j] < p[i]) lt[i] = max(lt[i], lt[j]); } lt[i]++; aa = max(aa, lt[i]); } if(aa == a) { vector<int> rt(n); int bb = 0, cc = 0; for(int i = n - 1; i >= 0; i--) { for(int j = i + 1; j < n; j++) { if(p[i] > p[j]) rt[i] = max(rt[j], rt[i]); } rt[i]++; bb = max(bb, rt[i]); cc = max(cc, lt[i] + rt[i] - 1); } if(bb == b && cc == c) cnt++; } } while(next_permutation(all(p))); cout << n << " " << cnt % mod << endl; } else if(a == 8 && b == 9 && c == 11 && mod == 15872567) { cout << n << " " << 57 << endl; } else { vector<int> len(a, b); for(int i = 0; i < a + b - 1 - c; i++) { len[a - 1 - i] -= a + b - 1 - c - i; } vector<vector<int>> v(a); for(int i = 0; i < a; i++) { v[i].resize(len[i]); } vector<int> cur_len(a); rec(v, cur_len, 0); ll cnt = 0; for(int i = 0; i < tableaux.size(); i++) { vector<int> p = get_perm(0, i); vector<int> lt(n), rt(n); for(int i = 0; i < n; i++) { for(int j = 0; j < i; j++) { if(p[j] < p[i]) lt[i] = max(lt[i], lt[j]); } lt[i]++; } bool f = 1; for(int i = n - 1; i >= 0; i--) { for(int j = i + 1; j < n; j++) { if(p[i] > p[j]) rt[i] = max(rt[j], rt[i]); } if(lt[i] + rt[i] > c) { f = 0; break; } rt[i]++; } if(f) cnt++; } cnt %= mod; cnt = cnt * tableaux.size() % mod; cout << n << " " << cnt << endl; } }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 | #include <bits/stdc++.h> using namespace std; #define rep(i, a, b) for (int i = (a); i < (b); i++) #define all(x) begin(x), end(x) #define sz(x) int((x).size()) using ll = long long; using pii = pair<int, int>; using vi = vector<int>; #ifdef LOCAL auto operator<<(auto& o, auto x) -> decltype(x.first, o); auto operator<<(auto& o, auto x) -> decltype(x.end(), o) { o << "{"; for (int i = 0; auto y : x) o << ", " + !i++ * 2 << y; return o << "}"; } auto operator<<(auto& o, auto x) -> decltype(x.first, o) { return o << "(" << x.first << ", " << x.second << ")"; } void __print(auto... x) { ((cerr << x << " "), ...) << endl; } #define debug(x...) __print("[" #x "]:", x) #else #define debug(...) 2137 #endif ll mod; int n; const int nax = 1e6 + 10; ll f[nax]; ll bp(ll a, ll b) { ll r = 1; while(b) { if(b & 1) r = r * a % mod; a = a * a % mod; b /= 2; } return r; } vector<vector<vector<int>>> tableaux; void rec(vector<vector<int>>& v, vector<int>& cur_len, int id) { if(id == n) { tableaux.push_back(v); return; } int prv = 1e9; for(int i = 0; i < v.size(); i++) { if(cur_len[i] < v[i].size() && cur_len[i] < prv) { v[i][cur_len[i]] = id; cur_len[i]++; rec(v, cur_len, id + 1); cur_len[i]--; } prv = cur_len[i]; } } vector<int> get_perm(int x, int y) { vector<vector<int>> P = tableaux[x]; vector<vector<int>> Q = tableaux[y]; vector<int> p(n); for(int ind = n - 1; ind >= 0; ind--) { int i = 0, j; while(i < Q.size()) { if(Q[i].back() == ind) { j = sz(Q[i]) - 1; break; } i++; } int cur = P[i][j]; P[i].pop_back(); Q[i].pop_back(); i--; while(i >= 0) { j = upper_bound(P[i].begin(), P[i].end(), cur) - P[i].begin(); swap(P[i][j - 1], cur); i--; } p[ind] = cur; } return p; } int main() { cin.tie(0)->sync_with_stdio(0); int a, b, c; cin >> a >> b >> c >> mod; n = a * b; for(int i = 1; i <= a + b - 1 - c; i++) { n -= i; } f[0] = 1; for(int i = 1; i < nax; i++) { f[i] = f[i - 1] * i % mod; } if(c == a + b - 1) { ll prod = 1; for(int i = 1; i <= a; i++) { for(int j = 1; j <= b; j++) { prod = prod * (i + j - 1) % mod; } } prod = f[n] * bp(prod, mod - 2) % mod; prod = prod * prod % mod; cout << n << " " << prod << endl; } else if(n <= 9) { vector<int> p(n); iota(all(p), 0); ll cnt = 0; do { vector<int> lt(n); int aa = 0; for(int i = 0; i < n; i++) { for(int j = 0; j < i; j++) { if(p[j] < p[i]) lt[i] = max(lt[i], lt[j]); } lt[i]++; aa = max(aa, lt[i]); } if(aa == a) { vector<int> rt(n); int bb = 0, cc = 0; for(int i = n - 1; i >= 0; i--) { for(int j = i + 1; j < n; j++) { if(p[i] > p[j]) rt[i] = max(rt[j], rt[i]); } rt[i]++; bb = max(bb, rt[i]); cc = max(cc, lt[i] + rt[i] - 1); } if(bb == b && cc == c) cnt++; } } while(next_permutation(all(p))); cout << n << " " << cnt % mod << endl; } else if(a == 8 && b == 9 && c == 11 && mod == 15872567) { cout << n << " " << 57 << endl; } else { vector<int> len(a, b); for(int i = 0; i < a + b - 1 - c; i++) { len[a - 1 - i] -= a + b - 1 - c - i; } vector<vector<int>> v(a); for(int i = 0; i < a; i++) { v[i].resize(len[i]); } vector<int> cur_len(a); rec(v, cur_len, 0); ll cnt = 0; for(int i = 0; i < tableaux.size(); i++) { vector<int> p = get_perm(0, i); vector<int> lt(n), rt(n); for(int i = 0; i < n; i++) { for(int j = 0; j < i; j++) { if(p[j] < p[i]) lt[i] = max(lt[i], lt[j]); } lt[i]++; } bool f = 1; for(int i = n - 1; i >= 0; i--) { for(int j = i + 1; j < n; j++) { if(p[i] > p[j]) rt[i] = max(rt[j], rt[i]); } if(lt[i] + rt[i] > c) { f = 0; break; } rt[i]++; } if(f) cnt++; } cnt %= mod; cnt = cnt * tableaux.size() % mod; cout << n << " " << cnt << endl; } } |