#include <bits/stdc++.h> // #define MULTIPLE_TESTS // #define ENDLESS_TESTS #define TIME_LIMIT 9 // #define MEMORY_LIMIT 512 // #define DEBUG_LOG #define DEBUG_LOG if constexpr (false) using namespace std; constexpr int SIZE = 610; constexpr int MOD = 1'000'000'000 + 7; void increase(int &val, int by) { val = (val + by) % MOD; } void increase(int &val, int a, int b) { val = (val + 1LL * a * b) % MOD; } using State = array<int, SIZE+1>; struct Forward { int closed; State L, P; }; struct Backward { State L = {0}, P = {0}; }; void write_state(char c, const State &state) { cout << setfill(' ') << setw(4) << c << " |"; for (int i = 0; i < 10; ++i) { if (state[i] > 0) cout << setfill(' ') << setw(4) << state[i]; else cout << " "; if (i % 3 == 0) cout << " |"; } cout << endl; } void write_line() { cout << "------------------" << endl; } Forward forward(const string &s) { int closed = 0; State l = {0}, p = {0}; l[0] = 1; DEBUG_LOG write_state('#', l); DEBUG_LOG write_line(); for (auto &c : s) { State current = {0}; if (c == 'L') { for (int i = 0; i < SIZE; ++i) { current[i+1] = l[i]; } l = {0}; } else { for (int i = 0; i < SIZE; ++i) { current[i] = p[i+1]; } increase(closed, p[0]); p = {0}; } DEBUG_LOG write_state(c, current); for (int i = 0; i < SIZE; ++i) { increase(l[i], current[i]); increase(p[i], current[i]); } } increase(closed, p[0]); p[0] = 0; DEBUG_LOG write_line(); DEBUG_LOG write_state('L', l); DEBUG_LOG write_state('P', p); DEBUG_LOG cout << "closed = " << closed << endl; return {closed, l, p}; } Backward backward(const string &s) { Backward ret; State l = {0}, p = {0}; p[0] = 1; DEBUG_LOG write_state('#', l); DEBUG_LOG write_line(); for (int idx = s.size()-1; idx >= 0; --idx) { const char c = s[idx]; State current = {0}; if (c == 'L') { for (int i = 0; i < SIZE; ++i) { current[i] = l[i+1]; increase(ret.L[i], current[i]); } l = {0}; } else { for (int i = 0; i < SIZE; ++i) { current[i+1] = p[i]; increase(ret.P[i], current[i]); } p = {0}; } DEBUG_LOG write_state(c, current); for (int i = 0; i < SIZE; ++i) { increase(l[i], current[i]); increase(p[i], current[i]); } } DEBUG_LOG write_line(); DEBUG_LOG write_state('L', ret.L); DEBUG_LOG write_state('P', ret.P); return ret; } void test() { int n; cin >> n; vector<Forward> F; vector<Backward> B; F.reserve(n); B.reserve(n); for (int i = 0; i < n; ++i) { string s; cin >> s; F.push_back(forward(s)); DEBUG_LOG write_line(); DEBUG_LOG write_line(); B.push_back(backward(s)); DEBUG_LOG write_line(); DEBUG_LOG write_line(); } for (int i = 0; i < n; ++i) { const auto &f = F[i]; for (int j = 0; j < n; ++j) { const auto &b = B[j]; int answer = f.closed; for (int k = 0; k < SIZE; ++k) { increase(answer, f.L[k], b.L[k]); increase(answer, f.P[k], b.P[k]); } cout << answer << ' '; } cout << '\n'; } } int main() { #ifndef CONTEST_WORKSPACE std::ios_base::sync_with_stdio(false); std::cin.tie(nullptr); #endif #ifdef ENDLESS_TESTS while(!(cin >> std::ws).eof()) test(); #else int T = 0; #ifdef MULTIPLE_TESTS cin >> T; #else T = 1; #endif while (T --> 0) test(); #endif return 0; }
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 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 | #include <bits/stdc++.h> // #define MULTIPLE_TESTS // #define ENDLESS_TESTS #define TIME_LIMIT 9 // #define MEMORY_LIMIT 512 // #define DEBUG_LOG #define DEBUG_LOG if constexpr (false) using namespace std; constexpr int SIZE = 610; constexpr int MOD = 1'000'000'000 + 7; void increase(int &val, int by) { val = (val + by) % MOD; } void increase(int &val, int a, int b) { val = (val + 1LL * a * b) % MOD; } using State = array<int, SIZE+1>; struct Forward { int closed; State L, P; }; struct Backward { State L = {0}, P = {0}; }; void write_state(char c, const State &state) { cout << setfill(' ') << setw(4) << c << " |"; for (int i = 0; i < 10; ++i) { if (state[i] > 0) cout << setfill(' ') << setw(4) << state[i]; else cout << " "; if (i % 3 == 0) cout << " |"; } cout << endl; } void write_line() { cout << "------------------" << endl; } Forward forward(const string &s) { int closed = 0; State l = {0}, p = {0}; l[0] = 1; DEBUG_LOG write_state('#', l); DEBUG_LOG write_line(); for (auto &c : s) { State current = {0}; if (c == 'L') { for (int i = 0; i < SIZE; ++i) { current[i+1] = l[i]; } l = {0}; } else { for (int i = 0; i < SIZE; ++i) { current[i] = p[i+1]; } increase(closed, p[0]); p = {0}; } DEBUG_LOG write_state(c, current); for (int i = 0; i < SIZE; ++i) { increase(l[i], current[i]); increase(p[i], current[i]); } } increase(closed, p[0]); p[0] = 0; DEBUG_LOG write_line(); DEBUG_LOG write_state('L', l); DEBUG_LOG write_state('P', p); DEBUG_LOG cout << "closed = " << closed << endl; return {closed, l, p}; } Backward backward(const string &s) { Backward ret; State l = {0}, p = {0}; p[0] = 1; DEBUG_LOG write_state('#', l); DEBUG_LOG write_line(); for (int idx = s.size()-1; idx >= 0; --idx) { const char c = s[idx]; State current = {0}; if (c == 'L') { for (int i = 0; i < SIZE; ++i) { current[i] = l[i+1]; increase(ret.L[i], current[i]); } l = {0}; } else { for (int i = 0; i < SIZE; ++i) { current[i+1] = p[i]; increase(ret.P[i], current[i]); } p = {0}; } DEBUG_LOG write_state(c, current); for (int i = 0; i < SIZE; ++i) { increase(l[i], current[i]); increase(p[i], current[i]); } } DEBUG_LOG write_line(); DEBUG_LOG write_state('L', ret.L); DEBUG_LOG write_state('P', ret.P); return ret; } void test() { int n; cin >> n; vector<Forward> F; vector<Backward> B; F.reserve(n); B.reserve(n); for (int i = 0; i < n; ++i) { string s; cin >> s; F.push_back(forward(s)); DEBUG_LOG write_line(); DEBUG_LOG write_line(); B.push_back(backward(s)); DEBUG_LOG write_line(); DEBUG_LOG write_line(); } for (int i = 0; i < n; ++i) { const auto &f = F[i]; for (int j = 0; j < n; ++j) { const auto &b = B[j]; int answer = f.closed; for (int k = 0; k < SIZE; ++k) { increase(answer, f.L[k], b.L[k]); increase(answer, f.P[k], b.P[k]); } cout << answer << ' '; } cout << '\n'; } } int main() { #ifndef CONTEST_WORKSPACE std::ios_base::sync_with_stdio(false); std::cin.tie(nullptr); #endif #ifdef ENDLESS_TESTS while(!(cin >> std::ws).eof()) test(); #else int T = 0; #ifdef MULTIPLE_TESTS cin >> T; #else T = 1; #endif while (T --> 0) test(); #endif return 0; } |