#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <math.h>
#include <vector>
#include <cstring>
#include <ctime>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <ctime>
#define fr first
#define sc second
#define MP make_pair
#define PB push_back
#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define lli long long int
#define y1 arayikhalatyan
using namespace std;
lli gcd(lli a, lli b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
lli cg(lli n) {
return n ^ (n >> 1);
}
lli SUM(lli a)
{
return (a * (a + 1) / 2);
}
bool CAN(int x, int y, int n, int m)
{
if (x >= 0 && y >= 0 && x < n && y < m)
{
return true;
}
return false;
}
double her(double x1, double y1, double x2, double y2)
{
return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
string strsum(string a, string b)
{
int p = 0;
string c;
reverse(a.begin(), a.end());
reverse(b.begin(), b.end());
if (b.length() < a.length())
{
for (int i = b.length(); i < a.length(); i++)
{
b += "0";
}
}
else
{
for (int i = a.length(); i < b.length(); i++)
{
a += "0";
}
}
a += "0", b += "0";
for (int i = 0; i < a.length(); i++)
{
c += (a[i] - '0' + b[i] - '0' + p) % 10 + '0';
p = (a[i] + b[i] - '0' - '0' + p) / 10;
}
if (c[c.length() - 1] == '0') c.erase(c.length() - 1, 1);
reverse(c.begin(), c.end());
return c;
}
string strmin(string a, string b)
{
if (a.length() > b.length()) return b;
if (b.length() > a.length()) return a;
for (int i = 0; i < a.length(); i++)
{
if (a[i] > b[i]) return b;
if (b[i] > a[i]) return a;
}
return a;
}
char vow[] = { 'a', 'e', 'i', 'o', 'u' };
int dx[] = { 1, -1, 0, 0 };
int dy[] = { 0, 0, 1, -1 };
const int N = 1e6 + 30;
const lli mod = 1000000007;
int n, k;
lli pat;
string s, A, B, t;
lli dp[1010][1010][2][2], dpq[1010][1010][2][2];
lli dm()
{
dp[0][0][0][1] = 1;
dp[0][0][1][1] = 1;
dpq[0][0][0][1] = 1;
dpq[0][0][1][1] = 1;
for (int i = 0; i < n - 1; i++)
{
for (int j = 0; j <= k; j++)
{
for (int k = 0; k < 2; k++)
{
//cout << k << " " << s[i] << endl;
if ((k == 0 && s[i] == 'R') || (k == 1 && s[i] == 'L'))
{
if (t[i + 1] == '0')
{
dp[i + 1][j + 1][k ^ 1][1] += dp[i][j][k][1] * 2;
dp[i + 1][j + 1][k ^ 1][1] %= mod;
dpq[i + 1][j + 1][k ^ 1][1] += dpq[i][j][k][1];
dpq[i + 1][j + 1][k ^ 1][1] %= mod;
}
else
{
dp[i + 1][j][k][1] += (dp[i][j][k][1] * 2 + dpq[i][j][k][1]);
dp[i + 1][j][k][1] %= mod;
//cout << dp[i + 1][j][k][1] << endl;
dpq[i + 1][j][k][1] += dpq[i][j][k][1];
dpq[i + 1][j][k][1] %= mod;
dp[i + 1][j + 1][k ^ 1][0] += dp[i][j][k][1] * 2;
dp[i + 1][j + 1][k ^ 1][0] %= mod;
dpq[i + 1][j + 1][k ^ 1][0] += dpq[i][j][k][1];
dpq[i + 1][j + 1][k ^ 1][0] %= mod;
}
dp[i + 1][j][k][0] += (dp[i][j][k][0] * 2 + dpq[i][j][k][0]);
dp[i + 1][j][k][0] %= mod;
dpq[i + 1][j][k][0] += dp[i][j][k][0];
dpq[i + 1][j][k][0] %= mod;
dp[i + 1][j + 1][k ^ 1][0] += dp[i][j][k][0] * 2;
dp[i + 1][j + 1][k ^ 1][0] %= mod;
dpq[i + 1][j + 1][k ^ 1][0] += dpq[i][j][k][0];
dpq[i + 1][j + 1][k ^ 1][0] %= mod;
}
else
{
if (t[i + 1] == '0')
{
dp[i + 1][j][k][1] += dp[i][j][k][1] * 2;
dp[i + 1][j][k][1] %= mod;
dpq[i + 1][j][k][1] += dpq[i][j][k][1];
dpq[i + 1][j][k][1] %= mod;
}
else
{
dp[i + 1][j][k][0] += dp[i][j][k][1] * 2;
dp[i + 1][j][k][0] %= mod;
dpq[i + 1][j][k][0] += dpq[i][j][k][1];
dpq[i + 1][j][k][0] %= mod;
dp[i + 1][j + 1][k ^ 1][1] += (dp[i][j][k][1] * 2 + dpq[i][j][k][1]);
dp[i + 1][j + 1][k ^ 1][1] %= mod;
dpq[i + 1][j + 1][k ^ 1][1] += dpq[i][j][k][1];
dpq[i + 1][j + 1][k ^ 1][1] %= mod;
}
dp[i + 1][j][k][0] += dp[i][j][k][0] * 2;
dp[i + 1][j][k][0] %= mod;
dpq[i + 1][j][k][0] += dpq[i][j][k][0];
dpq[i + 1][j][k][0] %= mod;
dp[i + 1][j + 1][k ^ 1][0] += (dp[i][j][k][0] * 2 + dpq[i][j][k][0]);
dp[i + 1][j + 1][k ^ 1][0] %= mod;
dpq[i + 1][j + 1][k ^ 1][0] += dpq[i][j][k][0];
dpq[i + 1][j + 1][k ^ 1][0] %= mod;
}
}
}
}
lli sm = (dp[n - 1][k][0][0] + dp[n - 1][k][0][1] + dp[n - 1][k][1][0] + dp[n - 1][k][1][1]) % mod;
for (int i = 0; i < n; i++)
{
for (int j = 0; j <= k; j++)
{
for (int k = 0; k < 2; k++)
{
dp[i][j][k][0] = 0;
dp[i][j][k][1] = 0;
dpq[i][j][k][0] = 0;
dpq[i][j][k][1] = 0;
}
}
}
return sm;
}
int main()
{
fastio;
cin >> n >> k;
cin >> s >> A >> B;
t = B;
pat = dm();
//cout << pat << endl;
for (int i = 1; i < A.length(); i++)
{
if (A[i] == '1')
{
for (int i = A.length() - 1; i >= 0; i--)
{
if (A[i] == '0')
A[i] = '1';
else
{
A[i] = '0';
break;
}
}
t = A;
pat -= dm();
if (pat < 0) pat += mod;
cout << pat;
return 0;
}
}
//cout << t << endl;
//cout << dm() << endl;
cout << pat;
return 0;
}
Compilation message
ljetopica.cpp: In function 'std::__cxx11::string strsum(std::__cxx11::string, std::__cxx11::string)':
ljetopica.cpp:57:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = b.length(); i < a.length(); i++)
~~^~~~~~~~~~~~
ljetopica.cpp:64:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = a.length(); i < b.length(); i++)
~~^~~~~~~~~~~~
ljetopica.cpp:71:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < a.length(); i++)
~~^~~~~~~~~~~~
ljetopica.cpp: In function 'std::__cxx11::string strmin(std::__cxx11::string, std::__cxx11::string)':
ljetopica.cpp:84:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < a.length(); i++)
~~^~~~~~~~~~~~
ljetopica.cpp: In function 'int main()':
ljetopica.cpp:206:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 1; i < A.length(); i++)
~~^~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
12 ms |
8568 KB |
Output is correct |
| 2 |
Correct |
11 ms |
8184 KB |
Output is correct |
| 3 |
Correct |
11 ms |
7800 KB |
Output is correct |
| 4 |
Correct |
10 ms |
7288 KB |
Output is correct |
| 5 |
Correct |
10 ms |
6904 KB |
Output is correct |
| 6 |
Correct |
9 ms |
6520 KB |
Output is correct |
| 7 |
Incorrect |
9 ms |
6136 KB |
Output isn't correct |
| 8 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
636 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
103 ms |
44424 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
12 ms |
8568 KB |
Output is correct |
| 2 |
Correct |
11 ms |
8184 KB |
Output is correct |
| 3 |
Correct |
11 ms |
7800 KB |
Output is correct |
| 4 |
Correct |
10 ms |
7288 KB |
Output is correct |
| 5 |
Correct |
10 ms |
6904 KB |
Output is correct |
| 6 |
Correct |
9 ms |
6520 KB |
Output is correct |
| 7 |
Incorrect |
9 ms |
6136 KB |
Output isn't correct |
| 8 |
Halted |
0 ms |
0 KB |
- |
