#include <bits/stdc++.h> using namespace std; #define sim template <class c #define ris return *this #define dor > debug &operator<< #define eni(x) \ sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<(c i) \ { sim > struct rge { c b, e; }; sim > rge<c> range(c i, c j) { return rge<c>{i, j}; } sim > auto dud(c *x) -> decltype(cerr << *x, 0); sim > char dud(...); struct debug { #ifdef XOX ~debug() { cerr << endl; } eni(!=) cerr << boolalpha << i; ris; } eni(==) ris << range(begin(i), end(i)); } sim, class b dor(pair<b, c> d) { ris << "" << d.first << " --> " << d.second << ""; } sim dor(rge<c> d) { *this << "["; for (auto it = d.b; it != d.e; ++it) *this << ", " + 2 * (it == d.b) << *it; ris << "]"; } #else sim dor(const c &) { ris; } #endif } ; #define imie(...) "" << #__VA_ARGS__ " = " << (__VA_ARGS__) << ", " #define pb push_back #define eb emplace_back #define lb lower_bound #define ub upper_bound #define f first #define s second #define sz(x) (x).size() #define all(x) (x).begin(), (x).end() #define vt vector using ll = long long; using pi = pair<int, int>; using pll = pair<ll, ll>; using vi = vt<int>; using vvi = vt<vi>; using vll = vt<ll>; using vvll = vt<vll>; using vs = vt<string>; using vpi = vt<pi>; using vvpi = vt<vpi>; using vpll = vt<pll>; using vvpll = vt<vpll>; const int mod = 1e9 + 7; const int nax = 1300; const int mmax = 2e6+9; int n, m; string str; string t[nax]; int next_l[nax]; int next_p[nax]; int suf[nax]; int done[nax][nax]; // queue<pi> to_delete; pi to_delete[mmax]; int lng = 0; int fastmod(int a, int b) { int ans = a + b; if (ans > mod) ans -= mod; return ans; } void restart() { for(int i = 0;i<lng;i++) done[to_delete[i].f][to_delete[i].s] = -1; lng = 0; } int solve(int idx, int cnt) { if (idx != -1 && done[idx][cnt] != -1) return done[idx][cnt]; if (cnt != 0 && cnt > suf[idx + 1]) return 0; int ans = 0; if (cnt == 0 && idx != -1) ans = 1; int n_idx; if (idx == -1) { if (str[0] == 'L') n_idx = 0; else n_idx = next_l[0]; } else n_idx = next_l[idx]; if (n_idx < m) ans = fastmod(ans, solve(n_idx, cnt + 1)); if (cnt > 0) { if (idx == -1) { if (str[0] == 'P') n_idx = 0; else n_idx = next_p[0]; } else n_idx = next_p[idx]; if (n_idx < m) ans = fastmod(ans, solve(n_idx, cnt - 1)); } if (idx != -1) { done[idx][cnt] = ans; to_delete[lng] = {idx,cnt}; lng++; } return ans; } int main() { ios_base::sync_with_stdio(0); cin.tie(); cin >> n; for (int i = 0; i < n; i++) cin >> t[i]; for (int i = 0; i < 1300; i++) for (int j = 0; j < 1300; j++) done[i][j] = -1; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { restart(); str = t[i] + t[j]; m = sz(t[i]) + sz(t[j]); int last_l = m; int last_p = m; suf[m] = 0; for (int k = m - 1; k >= 0; k--) { next_l[k] = last_l; next_p[k] = last_p; if (str[k] == 'L') last_l = k; else last_p = k; suf[k] = suf[k + 1] + (str[k] == 'P'); } cout << solve(-1, 0) << " "; } cout << 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 | #include <bits/stdc++.h> using namespace std; #define sim template <class c #define ris return *this #define dor > debug &operator<< #define eni(x) \ sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<(c i) \ { sim > struct rge { c b, e; }; sim > rge<c> range(c i, c j) { return rge<c>{i, j}; } sim > auto dud(c *x) -> decltype(cerr << *x, 0); sim > char dud(...); struct debug { #ifdef XOX ~debug() { cerr << endl; } eni(!=) cerr << boolalpha << i; ris; } eni(==) ris << range(begin(i), end(i)); } sim, class b dor(pair<b, c> d) { ris << "" << d.first << " --> " << d.second << ""; } sim dor(rge<c> d) { *this << "["; for (auto it = d.b; it != d.e; ++it) *this << ", " + 2 * (it == d.b) << *it; ris << "]"; } #else sim dor(const c &) { ris; } #endif } ; #define imie(...) "" << #__VA_ARGS__ " = " << (__VA_ARGS__) << ", " #define pb push_back #define eb emplace_back #define lb lower_bound #define ub upper_bound #define f first #define s second #define sz(x) (x).size() #define all(x) (x).begin(), (x).end() #define vt vector using ll = long long; using pi = pair<int, int>; using pll = pair<ll, ll>; using vi = vt<int>; using vvi = vt<vi>; using vll = vt<ll>; using vvll = vt<vll>; using vs = vt<string>; using vpi = vt<pi>; using vvpi = vt<vpi>; using vpll = vt<pll>; using vvpll = vt<vpll>; const int mod = 1e9 + 7; const int nax = 1300; const int mmax = 2e6+9; int n, m; string str; string t[nax]; int next_l[nax]; int next_p[nax]; int suf[nax]; int done[nax][nax]; // queue<pi> to_delete; pi to_delete[mmax]; int lng = 0; int fastmod(int a, int b) { int ans = a + b; if (ans > mod) ans -= mod; return ans; } void restart() { for(int i = 0;i<lng;i++) done[to_delete[i].f][to_delete[i].s] = -1; lng = 0; } int solve(int idx, int cnt) { if (idx != -1 && done[idx][cnt] != -1) return done[idx][cnt]; if (cnt != 0 && cnt > suf[idx + 1]) return 0; int ans = 0; if (cnt == 0 && idx != -1) ans = 1; int n_idx; if (idx == -1) { if (str[0] == 'L') n_idx = 0; else n_idx = next_l[0]; } else n_idx = next_l[idx]; if (n_idx < m) ans = fastmod(ans, solve(n_idx, cnt + 1)); if (cnt > 0) { if (idx == -1) { if (str[0] == 'P') n_idx = 0; else n_idx = next_p[0]; } else n_idx = next_p[idx]; if (n_idx < m) ans = fastmod(ans, solve(n_idx, cnt - 1)); } if (idx != -1) { done[idx][cnt] = ans; to_delete[lng] = {idx,cnt}; lng++; } return ans; } int main() { ios_base::sync_with_stdio(0); cin.tie(); cin >> n; for (int i = 0; i < n; i++) cin >> t[i]; for (int i = 0; i < 1300; i++) for (int j = 0; j < 1300; j++) done[i][j] = -1; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { restart(); str = t[i] + t[j]; m = sz(t[i]) + sz(t[j]); int last_l = m; int last_p = m; suf[m] = 0; for (int k = m - 1; k >= 0; k--) { next_l[k] = last_l; next_p[k] = last_p; if (str[k] == 'L') last_l = k; else last_p = k; suf[k] = suf[k + 1] + (str[k] == 'P'); } cout << solve(-1, 0) << " "; } cout << endl; } } |