# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
145508 | saken03 | Ljetopica (COI19_ljetopica) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
using namespace std;
//template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ll;
using namespace __gnu_pbds;
const int MOD = (int)1e9 + 7;
int n, k;
string s;
vector<string> v;
void solve() {
cin >> n >> k;
cin >> s;
string a1, b1;
cin >> a1 >> b1;
ll sum = 0, pt = 1;
string t = "1";
for (i = 0; i < n; i++) {
if (s[i] == 'L') {
t += '0';
}
else t += '1';
}
v.pb(t);
t = "1";
for (i = 0; i < n; i++) {
if (s[i] == 'L') {
t += '1';
}
else t += '0';
}
for (int i = 0; i < n; i++) {
if (s[i] == 'L') {
pt *= 2;
}
if (s[i] == 'R') {
pt = pt * 2 + 1;
}
if (pt >= a && pt <= b) {
sum = (sum + pt) % MOD;
}
}
pt = 1;
for (int i = 0; i < n; i++) {
if (s[i] == 'L') {
pt = pt * 2 + 1;
}
else {
pt = pt * 2;
}
if (pt >= a && pt <= b) {
sum = (sum + pt) % MOD;
}
}
cout << sum % MOD << '\n';
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int tt = 1;
while (tt--) {
solve();
}
return 0;
}