text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
struct str {
int win;
int lose;
};
int main() {
int n, i;
cin >> n;
n--;
std::vector<str> game;
game.reserve(n + 1);
for (i = 0; i <= n; i++) {
cin >> game[i].win;
}
if (game[0].win == 3) {
cout << "NO";
return 0;
}
if (game[0].win == 1) {
game[0].lose = 2;
} else {
game[0].lose = 1;
}
if (game[1].win == game[0].lose) {
cout << "NO";
return 0;
}
if (game[1].win == 3) {
game[1].lose = game[0].win;
} else {
game[1].lose = 3;
}
int k = 0;
for (i = 2; i <= n; i++) {
k = 0;
if (game[i].win == game[i - 2].lose) k = 1;
if (game[i].win == game[i - 1].win) k = 1;
if (k == 0) {
cout << "NO";
return 0;
}
if (game[i].win == game[i - 2].lose) {
game[i].lose = game[i - 1].win;
}
if (game[i].win == game[i - 1].win) {
game[i].lose = game[i - 2].lose;
}
}
cout << "YES";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
map<long long, long long> M;
vector<long long> V;
long long a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w,
x, y, z, pre;
long long A[100005];
string S, T;
int main() {
cin >> n;
pre = 3;
for (i = 1; i <= n; i++) {
cin >> a;
if (a == pre) {
cout << "NO";
return 0;
}
for (j = 1; j <= 3; j++) {
if (j != a && j != pre) {
pre = j;
break;
}
}
}
cout << "YES";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
int a[105];
int win, anext, ok = 1;
int main() {
cin >> n;
for (int i = 0; i < n; ++i) cin >> a[i];
if (a[0] == 3) {
cout << "NO" << endl;
return 0;
} else {
win = a[0];
anext = 3;
}
for (int i = 1; i < n; ++i)
if (a[i] == win || a[i] == anext) {
anext = 6 - (anext + win);
win = a[i];
} else {
ok = 0;
break;
}
if (ok)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<long long> v;
vector<string> str;
string s;
char c;
int dp[1];
long long n, z, k, nab;
int main() {
cin >> n;
nab = 3;
for (int i = 0; i < n; i++) {
cin >> z;
if (z != nab) {
if (nab == 1 && z == 2) {
nab = 3;
} else {
if (nab == 2 && z == 3) {
nab = 1;
} else {
if (nab == 1 && z == 3) {
nab = 2;
} else {
if (nab == 2 && z == 1) {
nab = 3;
} else {
if (nab == 3 && z == 2) {
nab = 1;
} else {
if (nab == 3 && z == 1) {
nab = 2;
}
}
}
}
}
}
} else {
cout << "NO";
return 0;
}
}
cout << "YES";
return 0;
}
|
#include <bits/stdc++.h>
const int MAXN = 100 + 10;
int N;
int A[MAXN];
bool visited[MAXN];
int main() {
register int i;
scanf("%d", &N);
scanf("%d", A + 1);
visited[1] = visited[2] = 1;
visited[1] = !visited[1], visited[2] = !visited[2], visited[3] = !visited[3];
visited[A[1]] = 1;
if (A[1] == 3) return !printf("NO");
for (i = 2; i <= N; ++i) {
scanf("%d", A + i);
if (!visited[A[i]]) return !printf("NO");
visited[1] = !visited[1], visited[2] = !visited[2],
visited[3] = !visited[3];
visited[A[i]] = 1;
}
printf("YES");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5;
const int INF = 1e9 + 7;
const int base = 10;
int n, a[N];
int main() {
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
int c = 3, d = 1, s = 2, p;
for (int i = 1; i <= n; ++i) {
if (a[i] == s) {
p = d;
d = c;
c = p;
}
if (a[i] == d) {
p = s;
s = c;
c = p;
}
if (a[i] == c) {
cout << "NO\n";
return 0;
}
}
cout << "YES\n";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a = 1, b = 2, c = 3, i, j, ck = 1;
cin >> n;
for (i = 0; i < n; i++) {
cin >> j;
if (j == a || j == b) {
if (j == a) {
swap(b, c);
} else {
swap(a, c);
}
} else {
ck = 0;
}
}
if (ck) {
cout << "YES";
} else {
cout << "NO";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int sum, c, t, arr[4] = {0, 1, 2, 3};
bool z = 0;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
while (n--) {
int x;
cin >> x;
if (x == arr[1] || x == arr[2]) {
if (x == arr[1])
swap(arr[2], arr[3]);
else if (x == arr[2])
swap(arr[1], arr[3]);
} else
z = 1;
}
if (z == 1)
cout << "NO";
else
cout << "YES";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, cnt, a;
bool f = true;
cin >> n;
cnt = 3;
for (int i = 0; i < n; i++) {
cin >> a;
if (a != cnt) {
cnt = 6 - (a + cnt);
} else {
f = false;
break;
}
}
if (f) {
cout << "YES";
} else {
cout << "NO";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int t1 = 1, t2 = 2, t3 = 3;
for (int i = 0; i < n; i++) {
int tt;
cin >> tt;
if (tt == t1)
swap(t2, t3);
else if (tt == t2)
swap(t1, t3);
else {
cout << "NO"
<< "\n";
return 0;
}
}
cout << "YES"
<< "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, w, l, e = 3, act = 2;
cin >> n;
while (n--) {
cin >> w;
if (w == e) {
cout << "NO\n";
return 0;
}
l = act / w;
swap(l, e);
act = w * l;
}
cout << "YES\n";
}
|
#include <bits/stdc++.h>
const int mod = 1e9 + 7;
const double eps = 1e-6;
const double pi = acos(-1);
const int inf = 0x7fffffff;
using namespace std;
int a[105];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
if (a[1] == 3) return 0 * printf("NO\n");
int x = 1, y = 2;
for (int i = 1; i <= n; i++) {
if (a[i] == x) {
if (x == 1) {
if (y == 2)
y = 3;
else
y = 2;
} else if (x == 2) {
if (y == 1)
y = 3;
else
y = 1;
} else if (x == 3) {
if (y == 1)
y = 2;
else
y = 1;
}
} else if (a[i] == y) {
if (y == 1) {
if (x == 2)
x = 3;
else
x = 2;
} else if (y == 2) {
if (x == 1)
x = 3;
else
x = 1;
} else if (y == 3) {
if (x == 1)
x = 2;
else
x = 1;
}
} else
return 0 * printf("NO\n");
}
printf("YES\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
short a = 1, b = 2, out = 3;
short n;
cin >> n;
bool works = true;
while (n--) {
short winner;
cin >> winner;
if (winner != a && winner != b)
works = false;
else if (winner == a) {
short old = out;
out = b;
b = old;
} else {
short old = out;
out = a;
a = old;
}
}
cout << (works ? "YES" : "NO");
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
int loser = -1;
for (int i = 0; i < n; ++i) {
int k;
cin >> k;
if (loser == -1) {
if (k == 1) {
loser = 2;
} else if (k == 2) {
loser = 1;
} else {
cout << "NO" << endl;
return 0;
}
} else if (k == loser) {
cout << "NO" << endl;
return 0;
} else if (k != loser) {
if (k == 1) {
if (loser == 3) {
loser = 2;
} else
loser = 3;
} else if (k == 2) {
if (loser == 3) {
loser = 1;
} else
loser = 3;
} else if (k == 3) {
if (loser == 2) {
loser = 1;
} else
loser = 2;
}
}
}
cout << "YES" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, e;
bool a = true, b = true, c = false;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> e;
if (a && b) {
switch (e) {
case 1:
b = false;
c = true;
break;
case 2:
a = false;
c = true;
break;
default:
cout << "NO";
exit(0);
}
} else if (b && c) {
switch (e) {
case 1:
cout << "NO";
exit(0);
case 2:
a = true;
c = false;
break;
default:
a = true;
b = false;
}
} else {
switch (e) {
case 1:
b = true;
c = false;
break;
case 2:
cout << "NO";
exit(0);
default:
a = false;
b = true;
}
}
}
cout << "YES";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n;
cin >> n;
bool valid = true;
int first = 1, second = 2;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a != first && a != second) {
valid = false;
}
if (first == a) {
if (a == 1) {
if (second == 2)
second = 3;
else
second = 2;
} else if (a == 2) {
if (second == 1)
second = 3;
else
second = 1;
} else {
if (second == 1)
second = 2;
else
second = 1;
}
} else {
if (a == 1) {
if (first == 2)
first = 3;
else
first = 2;
} else if (a == 2) {
if (first == 1)
first = 3;
else
first = 1;
} else {
if (first == 1)
first = 2;
else
first = 1;
}
}
}
if (valid)
cout << "YES";
else
cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) cin >> a[i];
int z = 3;
int f = 0;
for (int i = 0; i < n; i++) {
if (a[i] == z) {
f = 1;
break;
} else {
if (a[i] == 1) {
if (z == 2)
z = 3;
else
z = 2;
} else if (a[i] == 2) {
if (z == 1)
z = 3;
else
z = 1;
} else {
if (z == 2)
z = 1;
else
z = 2;
}
}
}
if (f == 1)
cout << "NO" << endl;
else
cout << "YES" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
void dbg(T t) {
cerr << t << endl;
}
template <typename T, typename... Args>
void dbg(T t, Args... args) {
cerr << t << " ";
dbg(args...);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, a, spec = 3;
int t[2] = {1, 2};
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (spec == a) {
cout << "NO" << endl;
return 0;
}
for (int j = 0; j < 2; j++)
if (t[j] != a) swap(t[j], spec);
}
cout << "YES" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
int a;
int x, y;
int main() {
ios::sync_with_stdio(false);
while (scanf("%d", &n) != EOF) {
x = 1;
y = 2;
bool flag = true;
for (int i = 0; i < n; ++i) {
scanf("%d", &a);
if (x == a || y == a) {
if (x == a) {
y = 6 - (x + y);
} else {
x = 6 - (x + y);
}
} else {
flag = false;
}
}
if (flag) {
printf("YES\n");
} else {
printf("NO\n");
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, p1 = 1, p2 = 2;
cin >> n;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (x != p1 and x != p2) {
cout << "NO";
return 0;
}
if (x == p1) {
p2 = (1 + 2 + 3) - (p2 + p1);
} else if (x == p2) {
p1 = (1 + 2 + 3) - (p2 + p1);
;
}
}
cout << "YES";
}
|
#include <bits/stdc++.h>
using namespace std;
signed main() {
long long p1 = 1, p2 = 2, w = 3;
long long n;
cin >> n;
for (long long i = 0; i < n; ++i) {
long long temp;
cin >> temp;
if (temp == p1) {
swap(p2, w);
} else {
if (temp == p2)
swap(p1, w);
else {
cout << "NO";
return 0;
}
}
}
cout << "YES";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int f(int a, int b) {
if (a == 1 && b == 2 || a == 2 && b == 1) return 3;
if (a == 1 && b == 3 || a == 3 && b == 1) return 2;
if (a == 3 && b == 2 || a == 2 && b == 3) return 1;
}
int main() {
int n;
cin >> n;
int p1 = 1, p2 = 2;
int tmp;
bool flag = true;
for (int i = 0; i < n; i++) {
cin >> tmp;
if (p1 == tmp || p2 == tmp) {
if (p1 == tmp) {
p2 = f(p1, p2);
} else {
p1 = f(p1, p2);
}
} else {
flag = false;
}
}
cout << (flag ? "YES" : "NO") << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long zdgys(long long n, long long m) {
if (n < m) {
long long temp = m;
m = n;
n = temp;
}
if (n % m == 0)
return m;
else
return (m, n % m);
}
int main() {
int n;
cin >> n;
int p1 = 1, p2 = 2, s = 3;
for (int i = 0; i < n; ++i) {
int temp;
cin >> temp;
if (temp == s) {
cout << "NO";
return 0;
}
if (temp == p1) {
swap(p2, s);
} else if (temp == p2)
swap(p1, s);
}
cout << "YES";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, x, y, f = 0, d = 3, l, a, b, c;
a = b = c = 0;
cin >> n;
while (n--) {
cin >> x;
if (d == x) f = 1;
if (x == 1) {
if (d == 3)
d = 2;
else
d = 3;
} else if (x == 2) {
if (d == 1)
d = 3;
else
d = 1;
} else {
if (d == 1)
d = 2;
else
d = 1;
}
}
if (f == 1)
cout << "NO";
else
cout << "YES";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int flag = 0;
int arr[] = {1, 2, 3};
int a = 1, b = 2;
for (int i = 0; i < n; i++) {
int k;
cin >> k;
if (k == a) {
if (arr[0] != a && arr[0] != b)
b = arr[0];
else if (arr[1] != a && arr[1] != b)
b = arr[1];
else if (arr[2] != a && arr[2] != b)
b = arr[2];
} else if (k == b) {
if (arr[0] != a && arr[0] != b)
a = arr[0];
else if (arr[1] != a && arr[1] != b)
a = arr[1];
else if (arr[2] != a && arr[2] != b)
a = arr[2];
} else
flag++;
}
if (flag == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a;
cin >> n;
bool f = 0;
int ex = 3;
for (int i = 0; i < n; i++) {
cin >> a;
if (a == ex) {
f = 1;
} else {
if (a == 1 && ex == 2)
ex = 3;
else if (a == 1 && ex == 3)
ex = 2;
else if (a == 2 && ex == 1)
ex = 3;
else if (a == 2 && ex == 3)
ex = 1;
else if (a == 3 && ex == 1)
ex = 2;
else if (a == 3 && ex == 2)
ex = 1;
}
}
if (f)
cout << "NO" << endl;
else
cout << "YES" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, playerA = 1, playerB = 2, rest = 3;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (a != playerA && a != playerB) {
return cout << "NO", 0;
}
if (a == playerA) {
swap(playerB, rest);
} else {
swap(playerA, rest);
}
}
cout << "YES";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct cosa {
int words;
int next[26];
};
struct cost {
double a, b, c;
};
bool operator<(const cost &a, const cost &b) {
if (a.a == b.a) return a.b < b.b;
return a.a < b.a;
}
struct q {
int a, b, c;
};
int alfa, beta;
int tra = 0;
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
string vac;
string nig;
string sr;
string ne;
map<string, int> cosa;
map<string, int> vacio;
string buffer;
int main() {
char prof;
int x = 0, y, z, c, mal = 2000000000, mil = 0, s = 0, d = -2, a1 = 0, b1, c1,
x1, y1;
int a, b;
cin >> a;
b = 1;
c = 2;
d = 3;
for (int i = int(0); i < int(a); i++) {
cin >> x;
if (b == x) {
x = c;
c = d;
d = x;
} else {
if (c == x) {
x = b;
b = d;
d = x;
} else {
cout << "NO";
return 0;
}
}
}
cout << "YES";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int prev_n = 3;
int x;
for (int i = 0; i < n; ++i) {
cin >> x;
if (x == prev_n) {
cout << "NO";
return 0;
}
prev_n = 6 - prev_n - x;
}
cout << "YES";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n;
int main(void) {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
long long a = 3, x;
for (long long(i) = (1); (i) <= (n); (i)++) {
cin >> x;
if (a == x) {
cout << "NO" << endl;
return 0;
}
a = 6 - (a + x);
}
cout << "YES" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[100], now[3], flag;
while (cin >> n) {
flag = 0;
now[1] = 1;
now[2] = 2;
now[0] = 3;
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < n; i++) {
if (a[i] == now[0]) {
flag = 1;
break;
} else if (a[i] == now[1])
swap(now[2], now[0]);
else if (a[i] == now[2])
swap(now[1], now[0]);
}
if (!flag)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, x;
int p[10];
int main() {
int flag = 1;
p[1] = p[2] = 1;
p[3] = -1;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &x);
if (p[x] == -1) flag = 0;
if (x == 1) {
p[2] = -p[2];
p[3] = -p[3];
} else if (x == 2) {
p[1] = -p[1];
p[3] = -p[3];
} else if (x == 3) {
p[1] = -p[1];
p[2] = -p[2];
}
}
if (flag)
puts("YES");
else
puts("NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int arr[105];
int getLost(int A, int C) {
if (A == 1 && C == 2 || A == 2 && C == 1) return 3;
if (A == 3 && C == 2 || A == 2 && C == 3) return 1;
if (A == 1 && C == 3 || A == 3 && C == 1) return 2;
}
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) cin >> arr[i];
int flag = 1;
int A, B, C = 3;
for (int i = 0; i < n; i++) {
if (arr[i] == C) {
flag = 0;
break;
}
A = arr[i];
B = getLost(A, C);
C = B;
}
if (flag)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x = 1, y = 2, z = 3, a, count = 0;
cin >> n;
cin >> a;
if (a == x) {
x = x;
swap(y, z);
count++;
for (int i = 0; i < n - 1; i++) {
cin >> a;
if (a == x) {
x = x;
swap(y, z);
count++;
} else if (a == y) {
y = y;
swap(x, z);
count++;
} else if (a == z) {
cout << "NO\n";
return 0;
}
}
} else if (a == y) {
y = y;
swap(x, z);
count++;
for (int i = 0; i < n - 1; i++) {
cin >> a;
if (a == x) {
x = x;
swap(y, z);
count++;
} else if (a == y) {
y = y;
swap(x, z);
count++;
} else if (a == z) {
cout << "NO\n";
return 0;
}
}
} else {
cout << "NO\n";
return 0;
}
if (count == n) cout << "YES\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long n;
long a[101];
bool played[101][4];
long i;
cin >> n;
for (i = 0; i < n; i++) {
played[i][1] = false;
played[i][2] = false;
played[i][3] = false;
}
played[0][1] = true;
played[0][2] = true;
played[0][3] = false;
for (i = 0; i < n; i++) {
cin >> a[i];
if (!played[i][a[i]]) {
cout << "NO";
return 0;
}
played[i + 1][a[i]] = true;
switch (a[i]) {
case 1:
if (played[i][2])
played[i + 1][3] = true;
else
played[i + 1][2] = true;
break;
case 2:
if (played[i][1])
played[i + 1][3] = true;
else
played[i + 1][1] = true;
break;
case 3:
if (played[i][1])
played[i + 1][2] = true;
else
played[i + 1][1] = true;
break;
}
}
if (n == 1 && a[0] == 3) {
cout << "NO";
return 0;
}
cout << "YES";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, l, w;
scanf("%lld", &n);
long long ar[n + 1];
for (long long i = 0; i < n; i++) scanf("%lld", &ar[i]);
l = 2, w = 1;
long long p1 = 1, p2 = 2;
if (ar[0] == 3) {
cout << "NO";
return 0;
}
if (ar[0] == 2) {
w = 2, l = 1;
}
for (long long i = 1; i < n; i++) {
if (ar[i] == l) {
cout << "NO";
return 0;
}
if (p1 == 1 and p2 == 2 || (p1 == 2 and p2 == 1)) {
l = 3;
if (ar[i] == 3) l = w;
p1 = ar[i], p2 = l;
} else if (p1 == 1 and p2 == 3 || (p1 == 3 and p2 == 1)) {
l = 2;
if (ar[i] == 2) l = w;
p1 = ar[i], p2 = l;
} else if (p1 == 2 and p2 == 3 || (p1 == 3 and p2 == 2)) {
l = 1;
if (ar[i] == 1) l = w;
p1 = ar[i], p2 = l;
}
w = ar[i];
}
cout << "YES";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
int n, cur = 3, a;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a;
if (a == cur) {
cout << "NO";
exit(0);
}
for (int j = 1; j < 4; j++) {
if (j != a && j != cur) {
cur = j;
break;
}
}
}
cout << "YES";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5, MOD = 1e9 + 7;
int main() {
int n, win, p1 = 1, p2 = 2, nex = 3;
cin >> n;
while (n--) {
cin >> win;
if (p1 != win && p2 != win) {
cout << "NO\n";
return 0;
}
if (p1 == win) {
swap(nex, p2);
} else {
swap(p1, nex);
}
}
cout << "YES\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using Long = long long;
using ULong = unsigned long long;
vector<int> readIntVec(int size) {
vector<int> result(size, 0);
for (int i = 0; i < size; ++i) {
cin >> result[i];
}
return result;
}
int main() {
const int A = 1, B = 2, C = 3;
int n = 0;
cin >> n;
auto vec = readIntVec(n);
if (vec[0] == C) {
cout << "NO";
return 0;
}
int winner = vec[0];
int loser = vec[0] == A ? B : A;
int spec = C;
for (int i = 1; i < vec.size(); ++i) {
if (vec[i] == loser) {
cout << "NO";
return 0;
}
spec = loser;
winner = vec[i];
loser = A + B + C - spec - winner;
}
cout << "YES";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int x;
cin >> x;
int restr = 1;
if (n == 1) {
if (x == 3) {
cout << "NO";
return 0;
}
cout << "YES";
return 0;
}
if (x == 3) {
cout << "NO";
return 0;
} else if (x == 1) {
restr = 2;
}
for (int i = 1; i < n; ++i) {
cin >> x;
if (restr == x) {
cout << "NO";
return 0;
}
if (x == 1) {
if (restr == 2)
restr = 3;
else
restr = 2;
} else if (x == 2) {
if (restr == 1)
restr = 3;
else
restr = 1;
} else if (x == 3) {
if (restr == 1)
restr = 2;
else
restr = 1;
}
}
cout << "YES";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n) {
int a[n];
for (int i = 0; i < n; i++) cin >> a[i];
int c = 3, flag = 0;
for (int i = 0; i < n; i++) {
if (a[i] == c) {
flag = 1;
break;
} else {
c = 6 - c - a[i];
}
}
if (flag == 0)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int mod = 1e9 + 7;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int a = 1, b = 2, c = 3;
bool poss = true;
for (int i = (int)(0); i < (int)(n); i++) {
int t;
cin >> t;
if (t != a && t != b) {
poss = false;
}
if (t == a) {
swap(b, c);
} else {
swap(a, c);
}
}
cout << (poss ? "YES" : "NO") << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
int a = 1, b = 2, c = 3;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (x == a)
swap(b, c);
else if (x == b)
swap(a, c);
else {
cout << "NO";
return 0;
}
}
cout << "YES";
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
int s = 3;
int w;
int ans = 0;
for (int i = 1; i <= n; i++) {
cin >> w;
if (w == s) ans = 1;
s = 6 - s - w;
}
if (ans == 0)
cout << "YES\n";
else
cout << "NO\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int a = 1, b = 2;
while (n--) {
int x;
scanf("%d", &x);
if (x == a) {
b = 6 - a - b;
} else if (x == b) {
a = 6 - b - a;
} else {
printf("NO\n");
return 0;
}
}
printf("YES\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, cur;
cin >> n;
bool play[4];
play[1] = true;
play[2] = true;
play[3] = false;
for (int i = 0; i < n; i++) {
cin >> cur;
if (!play[cur]) {
cout << "NO";
return 0;
}
for (int a = 1; a <= 3; a++) {
if (a != cur) {
if (play[a])
play[a] = false;
else
play[a] = true;
}
}
}
cout << "YES";
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxN = 1000005;
const int mod = (int)1e9 + 7;
const int inf = (int)1e9;
int main() {
int n;
cin >> n;
int x = 1, y = 2;
for (int i = 0; i < n; ++i) {
int w;
cin >> w;
if (w != x && w != y) {
cout << "NO" << endl;
return 0;
}
int nuevo;
for (nuevo = 1; nuevo <= 3; nuevo++) {
if (nuevo != x && nuevo != y) {
break;
}
}
x = w;
y = nuevo;
}
cout << "YES" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, U b) {
if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, U b) {
if (a < b) a = b;
}
template <class T>
inline void gn(T &first) {
char c, sg = 0;
while (c = getchar(), (c > '9' || c < '0') && c != '-')
;
for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
c = getchar())
first = (first << 1) + (first << 3) + c - '0';
if (sg) first = -first;
}
template <class T1, class T2>
inline void gn(T1 &x1, T2 &x2) {
gn(x1), gn(x2);
}
template <class T1, class T2, class T3>
inline void gn(T1 &x1, T2 &x2, T3 &x3) {
gn(x1), gn(x2), gn(x3);
}
template <class T1, class T2, class T3, class T4>
inline void gn(T1 &x1, T2 &x2, T3 &x3, T4 &x4) {
gn(x1), gn(x2), gn(x3), gn(x4);
}
template <class T>
inline void print(T first) {
if (first < 0) {
putchar('-');
return print(-first);
}
if (first < 10) {
putchar('0' + first);
return;
}
print(first / 10);
putchar(first % 10 + '0');
}
template <class T>
inline void printsp(T first) {
print(first);
putchar(' ');
}
template <class T>
inline void println(T first) {
print(first);
putchar('\n');
}
template <class T1, class T2>
inline void print(T1 x1, T2 x2) {
printsp(x1), println(x2);
}
template <class T1, class T2, class T3>
inline void print(T1 x1, T2 x2, T3 x3) {
printsp(x1), printsp(x2), println(x3);
}
int power(int a, int b, int m, int ans = 1) {
for (; b; b >>= 1, a = 1LL * a * a % m)
if (b & 1) ans = 1LL * ans * a % m;
return ans;
}
int a[110];
int b[5];
int main() {
int n;
gn(n);
for (int i = 0; i < n; i++) gn(a[i]);
b[1] = b[2] = 1;
for (int i = 0; i < n; i++) {
int ok = 0;
if (b[a[i]]) {
for (int j = 1; j < 4; j++)
if (j != a[i]) {
b[j] = 1 - b[j];
}
} else
return puts("NO"), 0;
}
puts("YES");
return 0;
}
|
#include <bits/stdc++.h>
long long int i, j;
using namespace std;
int main() {
int n, x, y, a, b, z, ar[101], flag = 0, c;
cin >> n;
a = 1, b = 2, c = 3;
x = a;
y = b;
for (i = 0; i < n; i++) cin >> ar[i];
for (i = 0; i < n; i++) {
if (ar[i] == x || ar[i] == y) {
if (ar[i] == x) {
if (y == b) {
if (x == a)
y = c;
else if (x == c)
y = a;
} else if (y == c) {
if (x == a)
y = b;
else if (x == b)
y = a;
} else if (y == a) {
if (x == b)
y = c;
else if (x == c)
y = b;
}
}
if (ar[i] == y) {
if (x == b) {
if (y == a) x = c;
if (y == c) x = a;
} else if (x == c) {
if (y == a) x = b;
if (y == b) x = a;
} else if (x == a) {
if (y == b) x = c;
if (y == c) x = b;
}
}
} else {
flag++;
cout << "NO\n";
break;
}
}
if (flag == 0) cout << "YES\n";
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
inline int read() {
int x = 0, f = 1;
char c = getchar();
for (; c < '0' || c > '9'; c = getchar())
if (c == '-') f = -1;
for (; c >= '0' && c <= '9'; c = getchar()) x = x * 10 + c - 48;
return x * f;
}
inline void write(int x) {
if (x < 0) putchar('-'), x = -x;
if (x >= 10) write(x / 10);
putchar((x % 10) + '0');
}
inline void writeln(int x) {
write(x);
puts("");
}
const int oo = 0x3f3f3f3f;
const int inf = oo;
bitset<100005> f[26], ans;
char s[100005], ch[100005];
int n, Q;
int main() {
scanf("%s", s + 1);
n = strlen(s + 1);
for (int i = 1; i <= n; i++) s[i] -= 'a', f[s[i]][i] = 1;
Q = read();
while (Q--) {
int op = read();
if (op == 1) {
int pos = read(), ch = getchar();
f[s[pos]][pos] = 0;
s[pos] = ch - 'a';
f[s[pos]][pos] = 1;
} else {
int l = read(), r = read();
scanf("%s", ch);
int len = strlen(ch);
if (r - l + 1 < len) {
puts("0");
continue;
}
ans.set();
ans <<= (l - 1);
ans ^= (ans << (r - l + 2 - len));
for (int i = 0; i < len; i++) ans = (ans << 1) & f[ch[i] - 'a'];
writeln(ans.count());
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline void read(T &a) {
T x = 0, f = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') f = 0;
ch = getchar();
}
while (isdigit(ch)) {
x = (x << 1) + (x << 3) + (ch ^ '0');
ch = getchar();
}
a = f ? x : -x;
}
char s[1000010], t[1000010];
int q, opt, ls, lt, l, r;
bitset<100010> n[26];
bitset<100010> ans;
signed main() {
scanf("%s", s);
read(q);
ls = strlen(s);
for (int i = 0; i < ls; i++) {
n[s[i] - 'a'][i] = 1;
}
while (q--) {
read(opt);
if (opt == 1) {
int pos;
read(pos);
pos--;
char ch = getchar();
n[s[pos] - 'a'][pos] = 0;
s[pos] = ch;
n[s[pos] - 'a'][pos] = 1;
} else {
read(l), read(r);
scanf("%s", t);
l--;
lt = strlen(t);
ans.set();
for (int i = 0; i < lt; i++) {
ans &= (n[t[i] - 'a'] << lt - i - 1);
}
printf("%d\n",
max(0, int((ans >> l + lt - 1).count() - (ans >> r).count())));
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int block_size = 320;
const long long mod = 1e9 + 7;
const long long inf = 1e9 + 7;
const long double eps = 1e-9;
const double PI = atan(1) * 4;
template <typename T>
inline int sign(const T &a) {
if (a < 0) return -1;
if (a > 0) return 1;
return 0;
}
template <typename T>
inline void in(T &x) {
x = 0;
T f = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') f = -1;
ch = getchar();
}
while (isdigit(ch)) {
x = x * 10 + ch - '0';
ch = getchar();
}
x *= f;
}
long long twop(int x) { return 1LL << x; }
template <typename A, typename B>
inline void in(A &x, B &y) {
in(x);
in(y);
}
template <typename A, typename B, typename C>
inline void in(A &x, B &y, C &z) {
in(x);
in(y);
in(z);
}
template <typename A, typename B, typename C, typename D>
inline void in(A &x, B &y, C &z, D &d) {
in(x);
in(y);
in(z);
in(d);
}
template <class T>
void upd(T &a, T b) {
a = max(a, b);
}
const int maxn = 100010;
bitset<maxn> occ[26], ans;
char s[maxn], q[maxn];
int main() {
scanf("%s", s);
int len = strlen(s);
for (long long i = 0; i < len; i++) s[i] -= 'a';
for (long long i = 0; i < len; i++) occ[s[i]][i] = 1;
int _;
in(_);
while (_--) {
int op;
in(op);
if (op == 1) {
int pos;
char c;
in(pos);
c = getchar() - 'a';
pos--;
occ[s[pos]][pos] = 0;
s[pos] = c;
occ[s[pos]][pos] = 1;
} else {
int l, r;
in(l, r);
scanf("%s", q);
int qlen = strlen(q);
if (qlen > r - l + 1) {
puts("0");
} else {
l--;
r--;
r -= qlen;
r++;
ans.set();
ans <<= maxn - 1 - r;
ans >>= maxn - 1 - r + l;
ans <<= l;
for (int i = 0; i < qlen; i++) {
ans &= occ[q[i] - 'a'] >> i;
}
printf("%lld\n", (long long)ans.count());
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline int readint() {
int x = 0;
bool f = 0;
char c = getchar();
while (!isdigit(c) && c != '-') c = getchar();
if (c == '-') {
f = 1;
c = getchar();
}
while (isdigit(c)) {
x = x * 10 + c - '0';
c = getchar();
}
return f ? -x : x;
}
const int maxn = 1e5 + 5, maxs = 70, maxb = 1620;
int n, q;
char s[maxn];
int S, B, L[maxb], R[maxb], pos[maxn];
struct SAM {
int sz, last, len[maxs * 2], link[maxs * 2], nxt[maxs * 2][26], cnt[maxs * 2];
vector<int> ch[maxs * 2];
void init() {
sz = 1;
last = 0;
link[0] = -1;
memset(nxt[0], 0, sizeof(nxt[0]));
cnt[0] = 1;
}
void extend(int c) {
int cur = sz++;
len[cur] = len[last] + 1;
memset(nxt[cur], 0, sizeof(nxt[0]));
cnt[cur] = 1;
int p = last;
while (p >= 0 && !nxt[p][c]) {
nxt[p][c] = cur;
p = link[p];
}
if (p < 0)
link[cur] = 0;
else {
int q = nxt[p][c];
if (len[p] + 1 == len[q])
link[cur] = q;
else {
int clone = sz++;
link[clone] = link[q];
memcpy(nxt[clone], nxt[q], sizeof(nxt[0]));
len[clone] = len[p] + 1;
cnt[clone] = 0;
while (p >= 0 && nxt[p][c] == q) {
nxt[p][c] = clone;
p = link[p];
}
link[cur] = link[q] = clone;
}
}
last = cur;
}
void dfs(int u) {
for (int v : ch[u]) {
dfs(v);
cnt[u] += cnt[v];
}
}
} t[maxb];
char y[maxn];
int nxt[maxn];
void get_nxt(char* s, int n) {
int u = 0;
for (int i = 2; i <= n; i++) {
while (u && s[i] != s[u + 1]) u = nxt[u];
if (s[i] == s[u + 1]) u++;
nxt[i] = u;
}
}
int find(char* s, int n, char* t, int m) {
int u = 0, cnt = 0;
for (int i = 1; i <= m; i++) {
while (u && t[i] != s[u + 1]) u = nxt[u];
if (t[i] == s[u + 1]) u++;
if (u == n) {
cnt++;
u = nxt[u];
}
}
return cnt;
}
int main() {
scanf("%s", s + 1);
n = strlen(s + 1);
S = max((int)sqrt(n / 26), 1);
B = (n - 1) / S + 1;
for (int i = 1; i <= B; i++) {
L[i] = (i - 1) * S + 1;
R[i] = min(n, i * S);
t[i].init();
for (int j = L[i]; j <= R[i]; j++) {
pos[j] = i;
t[i].extend(s[j] - 'a');
}
for (int j = 1; j < t[i].sz; j++) t[i].ch[t[i].link[j]].push_back(j);
t[i].dfs(0);
}
q = readint();
while (q--) {
int opt = readint();
if (opt == 1) {
int x = readint();
scanf("%s", y);
s[x] = y[0];
t[pos[x]].init();
for (int i = L[pos[x]]; i <= R[pos[x]]; i++) t[pos[x]].extend(s[i] - 'a');
for (int i = 0; i < t[pos[x]].sz; i++)
vector<int>().swap(t[pos[x]].ch[i]);
for (int i = 1; i < t[pos[x]].sz; i++)
t[pos[x]].ch[t[pos[x]].link[i]].push_back(i);
t[pos[x]].dfs(0);
} else {
int l, r;
l = readint();
r = readint();
scanf("%s", y + 1);
int m = strlen(y + 1);
get_nxt(y, m);
if (m > S || pos[l] == pos[r]) {
printf("%d\n", find(y, m, s + l - 1, r - l + 1));
continue;
}
int ans = find(y, m, s + l - 1, R[pos[l]] - l + 1);
for (int i = pos[l] + 1; i < pos[r]; i++) {
int u = 0;
bool ok = 1;
for (int j = 1; j <= m; j++) {
if (!t[i].nxt[u][y[j] - 'a']) {
ok = 0;
break;
}
u = t[i].nxt[u][y[j] - 'a'];
}
if (ok) ans += t[i].cnt[u];
}
ans += find(y, m, s + L[pos[r]] - 1, r - L[pos[r]] + 1);
if (pos[r] == pos[l] + 1)
ans +=
find(y, m, s + max(l, R[pos[l]] - m + 2) - 1,
min(R[pos[l]] - l + 1, m - 1) + min(r - L[pos[r]] + 1, m - 1));
else {
ans += find(y, m, s + max(l, R[pos[l]] - m + 2) - 1,
min(R[pos[l]] - l + 1, m - 1) + m - 1);
for (int i = pos[l] + 1; i < pos[r] - 1; i++)
ans += find(y, m, s + R[i] - m + 1, m * 2 - 2);
ans += find(y, m, s + R[pos[r] - 1] - m + 1,
min(r - L[pos[r]] + 1, m - 1) + m - 1);
}
printf("%d\n", ans);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
char s[maxn];
bitset<maxn> a[26], b;
int main() {
int T;
scanf("%s%d", s, &T);
int ls = strlen(s);
for (int i = 0; i < ls; i++) a[s[i] - 'a'][i] = 1;
while (T--) {
int op;
scanf("%d", &op);
if (op == 1) {
int pos;
char ch;
cin >> pos >> ch;
a[s[pos - 1] - 'a'][pos - 1] = 0;
a[ch - 'a'][pos - 1] = 1;
s[pos - 1] = ch;
} else {
int l, r;
char ss[maxn];
scanf("%d%d%s", &l, &r, ss);
b.set();
int lss = strlen(ss);
for (int i = 0; i < lss; i++) b &= a[ss[i] - 'a'] >> i;
int ans = 0;
int ln = (b >> l - 1).count();
int rn = (b >> r - lss + 1).count();
ans = ln - rn;
if (ans < 0) ans = 0;
cout << ans << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bitset<100001> f[26], ans;
int q[300001], h, t;
char tem[300001], str[100001];
int n, m;
int main() {
scanf("%s", str + 1);
n = strlen(str + 1);
for (int i = 1; i <= n; i++) f[str[i] - 'a'].set(i);
int q;
scanf("%d", &q);
int opt, j, c, l, r;
ans.set();
for (int i = 1; i <= q; i++) {
scanf("%d", &opt);
if (opt == 1) {
scanf("%d", &j);
char ch = getchar();
while (ch < 'a' || ch > 'z') ch = getchar();
f[str[j] - 'a'][j] = 0;
f[ch - 'a'][j] = 1;
str[j] = ch;
} else {
scanf("%d%d%s", &l, &r, tem + 1);
int len = strlen(tem + 1);
ans.set();
for (int j = 1; j <= len; j++) ans &= (f[tem[j] - 'a'] >> (j - 1));
printf(
"%d\n",
max(int((ans >> (l)).count() - (ans >> (r - len + 2)).count()), 0));
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int dr[]{-1, -1, 0, 1, 1, 1, 0, -1};
const int dc[]{0, 1, 1, 1, 0, -1, -1, -1};
void run() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
const int sqrtQ = 250;
class suffix_array {
const static int alpha = 128;
int getOrder(int a) const { return (a < (int)order.size() ? order[a] : 0); }
public:
int n;
string s;
vector<int> suf, order, lcp;
suffix_array() {}
suffix_array(const string &s) : n(s.size() + 1), s(s) {
suf = order = lcp = vector<int>(n);
vector<int> bucket_idx(n), newOrder(n), newsuff(n);
{
vector<int> prev(n), head(alpha, -1);
for (int i = 0; i < n; i++) {
prev[i] = head[s[i]];
head[s[i]] = i;
}
int buc = -1, idx = 0;
for (int i = 0; i < alpha; i++) {
if (head[i] == -1) continue;
bucket_idx[++buc] = idx;
for (int j = head[i]; ~j; j = prev[j]) suf[idx++] = j, order[j] = buc;
}
}
int len = 1;
do {
auto cmp = [&](int a, int b) {
if (order[a] != order[b]) return order[a] < order[b];
return getOrder(a + len) < getOrder(b + len);
};
for (int i = 0; i < n; i++) {
int j = suf[i] - len;
if (j < 0) continue;
newsuff[bucket_idx[order[j]]++] = j;
}
for (int i = 1; i < n; i++) {
suf[i] = newsuff[i];
bool cmpres = cmp(suf[i - 1], suf[i]);
newOrder[suf[i]] = newOrder[suf[i - 1]] + cmpres;
if (cmpres) bucket_idx[newOrder[suf[i]]] = i;
}
order = newOrder;
len <<= 1;
} while (order[suf[n - 1]] != n - 1);
}
int count(const string &x) {
int st = 0, ed = n;
for (int i = 0; i < (int)(x.size()) && st < ed; i++) {
auto cmp = [&](int a, int b) {
if (a == -1) return x[i] < s[b + i];
return s[a + i] < x[i];
};
st = lower_bound(suf.begin() + st, suf.begin() + ed, -1, cmp) -
suf.begin();
ed = upper_bound(suf.begin() + st, suf.begin() + ed, -1, cmp) -
suf.begin();
}
return max(0, ed - st);
}
} SA[(int)1e4];
string y;
vector<int> longestPrefix;
vector<int> Fail[26];
int fail(int k, char nxt) {
int &rt = Fail[nxt - 'a'][k];
if (~rt) return rt;
while (k > 0 && y[k] != nxt) k = longestPrefix[k - 1];
if (nxt == y[k]) k++;
return rt = k;
}
void failure_function() {
int n = y.size();
longestPrefix = vector<int>(n);
for (int i = 0; i < 26; i++) Fail[i] = vector<int>(n + 1, -1);
for (int i = 1, k = 0; i < n; i++) longestPrefix[i] = k = fail(k, y[i]);
}
int main() {
run();
string s;
int q;
cin >> s >> q;
for (int i = 0; i < (int)(s.size()); i += sqrtQ)
SA[i / sqrtQ] = suffix_array(s.substr(i, sqrtQ));
auto solve = [&](int l, int r) {
int match = 0, cnt = 0;
for (int i = l; i <= r; i++) {
match = fail(match, s[i]);
if (match == (int)(y.size())) {
cnt++;
match = longestPrefix[match - 1];
}
}
return cnt;
};
while (q--) {
int t;
cin >> t;
if (t == 1) {
int idx;
char ch;
cin >> idx >> ch;
idx--;
s[idx] = ch;
SA[idx / sqrtQ] = suffix_array(s.substr(idx / sqrtQ * sqrtQ, sqrtQ));
} else {
int l, r;
cin >> l >> r >> y;
l--, r--;
failure_function();
if ((int)(y.size()) >= sqrtQ || r - l <= 2 * sqrtQ) {
cout << solve(l, r) << "\n";
continue;
}
int ans = 0, len = (int)(y.size());
int st = l / sqrtQ, ed = r / sqrtQ;
ans += solve(l, (st + 1) * sqrtQ + len - 2);
ans += solve(ed * sqrtQ - len + 1, r);
for (int i = st + 1; i < ed; i++) ans += SA[i].count(y);
for (int i = st + 2; i < ed; i++)
ans += solve(i * sqrtQ - len + 1, i * sqrtQ + len - 2);
cout << ans << "\n";
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 50;
bitset<maxn> nxt[30], ans;
char s[maxn], str[maxn];
int main() {
scanf("%s", s + 1);
int n = strlen(s + 1);
for (int i = 1; i <= n; i++) nxt[s[i] - 'a'][i] = 1;
int q;
scanf("%d", &q);
while (q--) {
int op;
scanf("%d", &op);
if (op == 1) {
int x;
char c;
scanf("%d %c", &x, &c);
nxt[s[x] - 'a'][x] = 0;
nxt[c - 'a'][x] = 1;
s[x] = c;
} else {
int l, r;
scanf("%d%d%s", &l, &r, str + 1);
int len = strlen(str + 1);
if (r - l + 1 < len) {
puts("0");
continue;
}
ans.set();
for (int j = 1; j <= len; j++) ans &= (nxt[str[j] - 'a'] >> j);
printf("%d\n", (int)(ans >> (l - 1)).count() -
(int)(ans >> (r - len + 1)).count());
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[100005], t[100005];
bitset<100005> p[27], ini, ans;
inline int read() {
int x = 0;
char c = getchar();
while (c < '0' || c > '9') c = getchar();
while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
return x;
}
int main() {
int n, q, i, j, opt, l, r, len;
scanf("%s", s + 1);
n = strlen(s + 1);
for (i = 1; i <= n; i++) {
p[s[i] - 'a'][i] = 1;
ini[i] = 1;
}
q = read();
while (q--) {
opt = read();
if (opt == 1) {
l = read();
scanf("%s", t + 1);
p[s[l] - 'a'][l] = 0;
s[l] = t[1];
p[s[l] - 'a'][l] = 1;
continue;
}
l = read();
r = read();
scanf("%s", t + 1);
len = strlen(t + 1);
if (r - l + 1 < len) {
puts("0");
continue;
}
ans = ini;
int res = 0;
for (i = 1; i <= len; i++) {
ans &= (p[t[i] - 'a'] >> (i - 1));
}
r -= (len - 1);
if (r - l + 1 <= 66) {
for (j = l; j <= r; j++) res += ans[j];
printf("%d\n", res);
continue;
}
unsigned int *o = (unsigned int *)&ans;
while (l & 31) res += ans[l++];
while (r & 31) res += ans[r--];
res += ans[r];
l >>= 5;
r >>= 5;
for (j = l; j < r; j++) {
res += __builtin_popcount(o[j]);
}
printf("%d\n", res);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void mswap(int &x, int &y) { x ^= y ^= x ^= y; }
void read(int &x) {
x = 0;
char ch = getchar();
int pd = 1;
while (ch < '0' || ch > '9') {
if (ch == '-') {
pd = -pd;
}
ch = getchar();
}
while (ch <= '9' && ch >= '0') {
x = x * 10 + ch - '0';
ch = getchar();
}
x *= pd;
}
void write(const int &x) {
char f[100001];
int s = 0;
int tmp = x;
if (tmp == 0) {
putchar('0');
return;
}
if (tmp < 0) {
tmp = -tmp;
putchar('-');
}
while (tmp > 0) {
f[s++] = tmp % 10 + '0';
tmp /= 10;
}
while (s > 0) {
putchar(f[--s]);
}
}
const int N = 1e5 + 10;
char s[N], ss[N];
bitset<N> a[30], now;
int main() {
gets(s + 1);
int st = strlen(s + 1);
for (register int i = 1; i <= st; ++i) {
a[s[i] - 'a'][i] = 1;
}
int n;
read(n);
for (register int i = 1; i <= n; ++i) {
int aa;
read(aa);
if (aa == 1) {
int l;
read(l);
char ch = getchar();
while (ch < 'a' || ch > 'z') {
ch = getchar();
}
a[s[l] - 'a'][l] = 0;
a[ch - 'a'][l] = 1;
s[l] = ch;
} else {
int l, r;
read(l);
read(r);
scanf("%s", ss + 1);
int len = strlen(ss + 1);
now.set();
for (register int j = 1; j <= len; ++j) {
now &= (a[ss[j] - 'a'] >> j);
}
int ll = (now >> (l - 1)).count();
int rr = (now >> (r - len + 1)).count();
ll = (ll > rr ? ll : rr);
write(ll - rr);
puts("");
}
}
}
|
#include <bits/stdc++.h>
const int N = 200005;
std::bitset<N> an, f[27];
int q, opt, l, r, pos;
char st[N], s[N], c;
int main() {
scanf("%s", st + 1);
int n = strlen(st + 1);
for (int i = 1; i <= n; i++) f[st[i] - 'a'][i] = 1;
scanf("%d", &q);
for (int i = 1; i <= q; i++) {
scanf("%d", &opt);
if (opt == 1) {
scanf("%d %c", &pos, &c);
f[st[pos] - 'a'][pos] = 0;
f[c - 'a'][pos] = 1;
st[pos] = c;
} else {
scanf("%d%d%s", &l, &r, s + 1);
an.set();
int len = strlen(s + 1);
for (int j = 1; j <= len; j++) an &= f[s[j] - 'a'] >> (j - 1);
int anl = (an >> l).count(), anr = (an >> (r - len + 2)).count();
if (anl < anr) anl = anr;
printf("%d\n", anl - anr);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long INFF = 0x3f3f3f3f3f3f3f3fll;
const long long M = 1e9 + 7;
const long long maxn = 1e5 + 7;
const double eps = 0.00000001;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
template <typename T>
inline T abs(T a) {
return a > 0 ? a : -a;
}
template <typename T>
inline T powMM(T a, T b) {
T ret = 1;
for (; b; b >>= 1ll, a = 1ll * a * a % M)
if (b & 1) ret = 1ll * ret * a % M;
return ret;
}
int n, q;
bitset<maxn> T[26], now;
char a[maxn], b[maxn];
int i;
int main() {
scanf("%s", a);
n = strlen(a);
for (i = 0; i < n; i++) T[a[i] - 'a'].set(i);
scanf("%d", &q);
while (q--) {
int op;
scanf("%d", &op);
if (op == 1) {
int pos;
char c;
scanf("%d%*c%c", &pos, &c);
pos--;
T[a[pos] - 'a'][pos] = 0;
a[pos] = c;
T[a[pos] - 'a'][pos] = 1;
} else {
int l, r;
scanf("%d%d%s", &l, &r, b);
int len = strlen(b);
if (len > r - l + 1)
puts("0");
else {
now.set();
now = (now >> (l - 1)) << (l - 1);
now = (now << (maxn - (r - len + 1))) >> (maxn - (r - len + 1));
for (i = 0; i < len; i++) now &= (T[b[i] - 'a'] >> i);
printf("%d\n", (int)now.count());
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
template <class t>
inline t read(t &x) {
x = 0;
char c = getchar();
bool f = 0;
while (!isdigit(c)) f |= c == '-', c = getchar();
while (isdigit(c)) x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
if (f) x = -x;
return x;
}
template <class t>
inline void write(t x) {
if (x < 0) {
putchar('-'), write(-x);
} else {
if (x > 9) write(x / 10);
putchar('0' + x % 10);
}
}
const int N = 1e5 + 5;
bitset<N> a[30], ans;
char s[N], ss[N];
int q;
signed main() {
scanf("%s", s);
for (int i = 0; s[i]; i++) a[s[i] - 'a'][i] = 1;
read(q);
while (q--) {
int op;
read(op);
if (op == 1) {
int id;
char c;
read(id);
scanf(" %c", &c);
id--;
a[s[id] - 'a'][id] = 0;
a[c - 'a'][id] = 1;
s[id] = c;
} else {
int l, r;
read(l);
l--;
read(r);
r--;
scanf("%s", ss);
ans.set();
for (int i = 0; ss[i]; i++) ans &= a[ss[i] - 'a'] >> i;
int rn = (ans >> l).count(),
ln = (ans >> (r - (strlen(ss) - 1) + 1)).count();
write(max(0, rn - ln));
puts("");
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
void mswap(int &x, int &y) { x ^= y ^= x ^= y; }
void read(int &x) {
x = 0;
char ch = getchar();
int pd = 1;
while (ch < '0' || ch > '9') {
if (ch == '-') {
pd = -pd;
}
ch = getchar();
}
while (ch <= '9' && ch >= '0') {
x = x * 10 + ch - '0';
ch = getchar();
}
x *= pd;
}
void write(const int &x) {
char f[100001];
int s = 0;
int tmp = x;
if (tmp == 0) {
putchar('0');
return;
}
if (tmp < 0) {
tmp = -tmp;
putchar('-');
}
while (tmp > 0) {
f[s++] = tmp % 10 + '0';
tmp /= 10;
}
while (s > 0) {
putchar(f[--s]);
}
}
const int N = 1e5 + 10;
char s[N], ss[N];
bitset<N> a[30], now;
int main() {
gets(s + 1);
int st = strlen(s + 1);
for (register int i = 1; i <= st; ++i) {
a[s[i] - 'a'][i] = 1;
}
int n;
read(n);
for (register int i = 1; i <= n; ++i) {
int aa;
read(aa);
if (aa == 1) {
int l;
read(l);
char ch = getchar();
while (ch < 'a' || ch > 'z') {
ch = getchar();
}
a[s[l] - 'a'][l] = 0;
a[ch - 'a'][l] = 1;
s[l] = ch;
} else {
int l, r;
read(l);
read(r);
scanf("%s", ss + 1);
int len = strlen(ss + 1);
now.set();
for (register int j = 1; j <= len; ++j) {
now &= (a[ss[j] - 'a'] >> j);
}
int ll = (now >> (l - 1)).count();
int rr = (now >> (r - len + 1)).count();
ll = (ll > rr ? ll : rr);
write(ll - rr);
puts("");
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 1;
char c;
int n, m, t, x, y, l;
string s;
bitset<N> a[26], C, A;
int main() {
cin >> s >> m, n = s.size();
for (int i = 0; i < n; i++) a[s[i] - 'a'][i] = 1, C[i] = 1;
while (m-- && cin >> t >> x)
if (t == 1 && cin >> c)
for (int i = 0; i < 26; i++) a[i][x - 1] = (c - 'a' == i);
else {
cin >> y >> s, l = s.size(), A = (C >> (n - y + x + l - 2)) << (x - 1);
for (int i = 0; i < l; i++) A &= a[s[i] - 'a'], A <<= 1;
cout << A.count() << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = (int)1e5;
string s;
int len;
int q;
bitset<N> pos[26];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> s >> q;
len = (int)s.size();
for (int i = 0; i < len; i++) {
pos[s[i] - 'a'][i] = 1;
}
while (q--) {
int type;
cin >> type;
if (type == 1) {
int i;
string t;
cin >> i >> t;
i--;
if (s[i] != t[0]) {
pos[s[i] - 'a'][i] = 0;
pos[t[0] - 'a'][i] = 1;
s[i] = t[0];
}
} else {
int l, r, sz;
string t;
cin >> l >> r >> t;
sz = (int)t.size();
l--;
r--;
r = r - sz + 1;
if (l > r) {
cout << "0\n";
continue;
}
bitset<N> good;
good.reset();
good = ~good;
for (int i = 0; i < sz; i++) {
good &= (pos[t[i] - 'a'] >> i);
}
int ans = 0;
good >>= l;
ans = good.count();
good >>= (r - l + 1);
ans -= good.count();
cout << ans << "\n";
}
}
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
char s[100005], t[100005];
bitset<100005> p[27], ini, ans;
inline int read() {
int x = 0;
char c = getchar();
while (c < '0' || c > '9') c = getchar();
while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
return x;
}
int main() {
int n, q, i, j, opt, l, r, len;
scanf("%s", s + 1);
n = strlen(s + 1);
for (i = 1; i <= n; i++) {
p[s[i] - 'a'][i] = 1;
ini[i] = 1;
}
q = read();
while (q--) {
opt = read();
if (opt == 1) {
l = read();
scanf("%s", t + 1);
p[s[l] - 'a'][l] = 0;
s[l] = t[1];
p[s[l] - 'a'][l] = 1;
continue;
}
l = read();
r = read();
scanf("%s", t + 1);
len = strlen(t + 1);
if (r - l + 1 < len) {
puts("0");
continue;
}
ans = ini;
int res = 0;
for (i = 1; i <= len; i++) {
ans &= (p[t[i] - 'a'] >> (i - 1));
}
r -= (len - 1);
if (r - l + 1 <= 66) {
for (j = l; j <= r; j++) res += ans[j];
printf("%d\n", res);
continue;
}
int *o = (int *)&ans;
while (l & 31) res += ans[l++];
while (r & 31) res += ans[r--];
res += ans[r];
l >>= 5;
r >>= 5;
for (j = l; j < r; j++) {
res += __builtin_popcount(o[j]);
}
printf("%d\n", res);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double g = 10.0, eps = 1e-12;
const int N = 100000 + 10, maxn = 400000 + 10, inf = 0x3f3f3f3f;
bitset<N> one, s[30], ans;
char ss[N], te[N];
int main() {
scanf("%s", ss + 1);
int len = strlen(ss + 1);
for (int i = 1; i <= len; i++) s[ss[i] - 'a'][i] = one[i] = 1;
int q;
scanf("%d", &q);
while (q--) {
int op;
scanf("%d", &op);
if (op == 1) {
int id;
scanf("%d %s", &id, te);
s[ss[id] - 'a'][id] = 0;
s[te[0] - 'a'][id] = 1;
ss[id] = te[0];
} else {
int l, r;
scanf("%d %d %s", &l, &r, te + 1);
int telen = strlen(te + 1);
if (r - l + 1 < telen) {
puts("0");
continue;
}
ans = one;
for (int i = 1; i <= telen; i++) {
ans &= (s[te[i] - 'a'] >> (i - 1));
}
printf("%d\n", (ans >> (l)).count() - (ans >> (r - telen + 2)).count());
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[100005], t[100005];
bitset<100005> p[27], ini, ans;
inline int read() {
int x = 0;
char c = getchar();
while (c < '0' || c > '9') c = getchar();
while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
return x;
}
int main() {
int n, q, i, j, opt, l, r, len;
scanf("%s", s + 1);
n = strlen(s + 1);
for (i = 1; i <= n; i++) {
p[s[i] - 'a'][i] = 1;
ini[i] = 1;
}
q = read();
while (q--) {
opt = read();
if (opt == 1) {
l = read();
scanf("%s", t + 1);
p[s[l] - 'a'][l] = 0;
s[l] = t[1];
p[s[l] - 'a'][l] = 1;
continue;
}
l = read();
r = read();
scanf("%s", t + 1);
len = strlen(t + 1);
if (r - l + 1 < len) {
puts("0");
continue;
}
ans = ini;
int res = 0;
for (i = 1; i <= len; i++) {
ans &= (p[t[i] - 'a'] >> (i - 1));
}
r -= (len - 1);
if (r - l + 1 <= 66) {
for (j = l; j <= r; j++) res += ans[j];
printf("%d\n", res);
continue;
}
unsigned long *o = (unsigned long *)&ans;
while (l & 31) res += ans[l++];
while (r & 31) res += ans[r--];
res += ans[r];
l >>= 5;
r >>= 5;
for (j = l; j < r; j++) {
res += __builtin_popcount(o[j]);
}
printf("%d\n", res);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bitset<100005> mask[26];
void computeMask(string &text) {
for (int i = 0; i < (int)text.size(); ++i) {
int c = text[i] - 'a';
mask[c].set(i);
}
}
int StringMatchingInRange(string &pattern, string &text, long long l,
long long r) {
if ((int)pattern.size() > (r - l + 1)) return 0;
bitset<100005> startMask;
startMask.set();
for (int i = 0; i < (int)pattern.size(); ++i) {
int c = pattern[i] - 'a';
startMask &= (mask[c] >> i);
}
return (startMask >> (l)).count() -
(startMask >> (r - (int)pattern.size() + 2)).count();
}
int StringMatching(string &pattern, string &text) {
if ((int)pattern.size() > (int)text.size()) return 0;
bitset<100005> startMask;
startMask.set();
for (int i = 0; i < (int)pattern.size(); ++i) {
int c = pattern[i] - 'a';
startMask &= (mask[c] >> i);
}
return startMask.count();
}
void update(int idx, char ch, string &text) {
char old = text[idx];
mask[old - 'a'][idx] = 0;
text[idx] = ch;
mask[ch - 'a'][idx] = 1;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s, t;
cin >> t;
computeMask(t);
int q, ty, l, r, x;
char ch;
cin >> q;
while (q--) {
cin >> ty;
if (ty == 2) {
cin >> l >> r >> s;
l--, r--;
cout << StringMatchingInRange(s, t, l, r) << endl;
} else {
cin >> x >> ch;
x--;
update(x, ch, t);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxr = 10000000;
char rd[maxr], prt[maxr];
int rpos, ppos, mmx;
inline char readc() {
if (!rpos) mmx = fread(rd, 1, maxr, stdin);
char c = rd[rpos++];
if (rpos == maxr) rpos = 0;
if (rpos > mmx) return 0;
return c;
}
template <typename T>
inline void read(T &x) {
x = 0;
register int flag = 1, c;
while (((c = readc()) < '0' || c > '9') && c != '-')
;
if (c == '-')
flag = -1;
else
x = c - '0';
while ((c = readc()) >= '0' && c <= '9') x = x * 10 + c - '0';
x *= flag;
}
inline int reads(char *s) {
register int len = 0, c;
while (isspace(c = readc()) || !c)
;
s[len++] = c;
while (!isspace(c = readc()) && c) s[len++] = c;
s[len] = 0;
return len;
}
inline void printc(char c) {
prt[ppos++] = c;
if (ppos == maxr) fwrite(prt, 1, ppos, stdout), ppos = 0;
}
inline void prints(char *s) {
for (int i = 0; s[i]; i++) printc(s[i]);
}
template <typename T>
inline void print(T x, char c = '\n') {
if (x < 0) printc('-'), x = -x;
if (x) {
static char sta[20];
register int tp = 0;
for (; x; x /= 10) sta[tp++] = x % 10 + '0';
while (tp > 0) printc(sta[--tp]);
} else
printc('0');
printc(c);
}
const int MAXN = 100005, B = 100;
int nxt[MAXN], n, m;
char str[MAXN], ttr[MAXN];
struct SAM {
int son[205][26], par[205], cnt[205], len[205], buc[205], ord[205], tot, lst;
void extend(int c) {
int p = lst, np = ++tot;
len[np] = len[p] + 1;
for (; p && !son[p][c]; p = par[p]) son[p][c] = np;
if (p > 0) {
int q = son[p][c];
if (len[q] != len[p] + 1) {
int nq = ++tot;
len[nq] = len[p] + 1;
memcpy(son[nq], son[q], sizeof(son[nq]));
par[nq] = par[q], par[q] = par[np] = nq;
for (; son[p][c] == q; p = par[p]) son[p][c] = nq;
} else
par[np] = q;
} else
par[np] = 1;
cnt[lst = np] = 1;
}
void build(char *s, int n) {
memset(son, 0, sizeof(son));
memset(par, 0, sizeof(par));
memset(cnt, 0, sizeof(cnt));
memset(len, 0, sizeof(len));
memset(buc, 0, sizeof(buc));
tot = lst = 1;
for (int i = 0; i < n; i++) extend(s[i] - 'a');
for (int i = 1; i <= tot; i++) ++buc[len[i]];
for (int i = 1; i <= n; i++) buc[i] += buc[i - 1];
for (int i = 1; i <= tot; i++) ord[buc[len[i]]--] = i;
for (int i = tot; i > 1; i--) cnt[par[ord[i]]] += cnt[ord[i]];
}
int query(char *s, int n) {
int k = 1;
for (int i = 0; i < n && k; i++) k = son[k][s[i] - 'a'];
return cnt[k];
}
} sam[1005];
int main() {
n = reads(str);
for (int i = 0; i < n; i += B) {
int j = min(n, i + B);
sam[i / B].build(str + i, j - i);
}
read(m);
while (m--) {
int a, b, c;
read(a), read(b);
if (a == 1) {
reads(ttr);
str[--b] = ttr[0];
b = b / B * B;
sam[b / B].build(str + b, min(n, b + B) - b);
} else {
read(c);
--b, --c;
int l = reads(ttr), res = 0;
nxt[0] = -1;
for (int i = 1, j = 0; i < l; i++) {
while (~j && ttr[j] != ttr[i]) j = nxt[j];
nxt[i + 1] = ++j;
}
if (l > B || c / B - 1 <= b / B) {
for (int i = b, j = 0; i <= c; i++) {
while (~j && ttr[j] != str[i]) j = nxt[j];
if (++j == l) ++res, j = nxt[j];
}
} else {
int lb = b / B, rb = c / B;
for (int i = b, j = 0; i < (lb + 1) * B + l - 1; i++) {
while (~j && ttr[j] != str[i]) j = nxt[j];
if (++j == l) ++res, j = nxt[j];
}
for (int i = rb * B - l + 1, j = 0; i <= c; i++) {
while (~j && ttr[j] != str[i]) j = nxt[j];
if (++j == l) ++res, j = nxt[j];
}
for (int i = lb + 1; i < rb; i++) res += sam[i].query(ttr, l);
for (int t = lb + 2; t < rb; t++) {
for (int i = t * B - l + 1, j = 0; i < t * B + l - 1; i++) {
while (~j && ttr[j] != str[i]) j = nxt[j];
if (++j == l) ++res, j = nxt[j];
}
}
}
print(res);
}
}
fwrite(prt, 1, ppos, stdout);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long inf = 1000 * 1000 * 1000 + 7;
long long inf64 = inf * inf;
long long mod = 228228227;
long long math_mod = 998244353;
float START_TIME;
mt19937 gen(time(0));
bitset<100005> a[27], one, ans;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cerr << fixed << setprecision(15);
cout << fixed << setprecision(15);
srand(time(0));
START_TIME = clock();
string s;
cin >> s;
for (int i = 0; i < s.size(); ++i) one[i] = 1;
for (int i = 0; i < s.size(); ++i) a[s[i] - 'a'][i] = 1;
int m;
cin >> m;
for (int i = 0; i < m; ++i) {
int k;
cin >> k;
if (k == 1) {
int pos;
char c;
cin >> pos >> c;
a[s[pos - 1] - 'a'][pos - 1] = 0;
a[c - 'a'][pos - 1] = 1;
s[pos - 1] = c;
} else {
int l, r;
cin >> l >> r;
string st;
cin >> st;
int len = st.size();
if (len > r - l + 1) {
cout << 0 << endl;
continue;
} else {
ans = one;
for (int i = 0; i < len; ++i) ans &= (a[st[i] - 'a'] >> i);
int res = (ans >> (l - 1)).count() - (ans >> (r - len + 1)).count();
cout << res << endl;
}
}
}
cerr << endl << (clock() - START_TIME) / CLOCKS_PER_SEC << " sec." << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxr = 10000000;
char rd[maxr], prt[maxr];
int rpos, ppos, mmx;
inline char readc() {
if (!rpos) mmx = fread(rd, 1, maxr, stdin);
char c = rd[rpos++];
if (rpos == maxr) rpos = 0;
if (rpos > mmx) return 0;
return c;
}
template <typename T>
inline void read(T &x) {
x = 0;
register int flag = 1, c;
while (((c = readc()) < '0' || c > '9') && c != '-')
;
if (c == '-')
flag = -1;
else
x = c - '0';
while ((c = readc()) >= '0' && c <= '9') x = x * 10 + c - '0';
x *= flag;
}
inline int reads(char *s) {
register int len = 0, c;
while (isspace(c = readc()) || !c)
;
s[len++] = c;
while (!isspace(c = readc()) && c) s[len++] = c;
s[len] = 0;
return len;
}
inline void printc(char c) {
prt[ppos++] = c;
if (ppos == maxr) fwrite(prt, 1, ppos, stdout), ppos = 0;
}
inline void prints(char *s) {
for (int i = 0; s[i]; i++) printc(s[i]);
}
template <typename T>
inline void print(T x, char c = '\n') {
if (x < 0) printc('-'), x = -x;
if (x) {
static char sta[20];
register int tp = 0;
for (; x; x /= 10) sta[tp++] = x % 10 + '0';
while (tp > 0) printc(sta[--tp]);
} else
printc('0');
printc(c);
}
const int MAXN = 100005, B = 200;
int nxt[MAXN], n, m;
char str[MAXN], ttr[MAXN];
struct SAM {
int son[505][26], par[505], cnt[505], len[505], buc[505], ord[505], tot, lst;
void extend(int c) {
int p = lst, np = ++tot;
len[np] = len[p] + 1;
for (; p && !son[p][c]; p = par[p]) son[p][c] = np;
if (p > 0) {
int q = son[p][c];
if (len[q] != len[p] + 1) {
int nq = ++tot;
len[nq] = len[p] + 1;
memcpy(son[nq], son[q], sizeof(son[nq]));
par[nq] = par[q], par[q] = par[np] = nq;
for (; son[p][c] == q; p = par[p]) son[p][c] = nq;
} else
par[np] = q;
} else
par[np] = 1;
cnt[lst = np] = 1;
}
void build(char *s, int n) {
memset(son, 0, sizeof(son));
memset(par, 0, sizeof(par));
memset(cnt, 0, sizeof(cnt));
memset(len, 0, sizeof(len));
memset(buc, 0, sizeof(buc));
tot = lst = 1;
for (int i = 0; i < n; i++) extend(s[i] - 'a');
for (int i = 1; i <= tot; i++) ++buc[len[i]];
for (int i = 1; i <= n; i++) buc[i] += buc[i - 1];
for (int i = 1; i <= tot; i++) ord[buc[len[i]]--] = i;
for (int i = tot; i > 1; i--) cnt[par[ord[i]]] += cnt[ord[i]];
}
int query(char *s, int n) {
int k = 1;
for (int i = 0; i < n && k; i++) k = son[k][s[i] - 'a'];
return cnt[k];
}
} sam[505];
int main() {
n = reads(str);
for (int i = 0; i < n; i += B) {
int j = min(n, i + B);
sam[i / B].build(str + i, j - i);
}
read(m);
while (m--) {
int a, b, c;
read(a), read(b);
if (a == 1) {
reads(ttr);
str[--b] = ttr[0];
b = b / B * B;
sam[b / B].build(str + b, min(n, b + B) - b);
} else {
read(c);
--b, --c;
int l = reads(ttr), res = 0;
nxt[0] = -1;
for (int i = 1, j = 0; i < l; i++) {
while (~j && ttr[j] != ttr[i]) j = nxt[j];
nxt[i + 1] = ++j;
}
if (l > B || c / B - 1 <= b / B) {
for (int i = b, j = 0; i <= c; i++) {
while (~j && ttr[j] != str[i]) j = nxt[j];
if (++j == l) ++res, j = nxt[j];
}
} else {
int lb = b / B, rb = c / B;
for (int i = b, j = 0; i < (lb + 1) * B + l - 1; i++) {
while (~j && ttr[j] != str[i]) j = nxt[j];
if (++j == l) ++res, j = nxt[j];
}
for (int i = rb * B - l + 1, j = 0; i <= c; i++) {
while (~j && ttr[j] != str[i]) j = nxt[j];
if (++j == l) ++res, j = nxt[j];
}
for (int i = lb + 1; i < rb; i++) res += sam[i].query(ttr, l);
for (int t = lb + 2; t < rb; t++) {
for (int i = t * B - l + 1, j = 0; i < t * B + l - 1; i++) {
while (~j && ttr[j] != str[i]) j = nxt[j];
if (++j == l) ++res, j = nxt[j];
}
}
}
print(res);
}
}
fwrite(prt, 1, ppos, stdout);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bitset<100005> B[27], ans, ones;
char s[100005], s2[100005];
int main(int nargs, char **args) {
scanf("%s", s + 1);
int len, q, t, l, r, len2;
len = strlen(s + 1);
for (int i = 1; i <= len; i++) {
B[s[i] - 'a'][i] = 1;
}
ones = ~ones;
scanf("%d", &q);
while (q--) {
scanf("%d", &t);
if (t == 1) {
scanf("%d%s", &l, s2);
B[s[l] - 'a'][l] = 0;
s[l] = s2[0];
B[s2[0] - 'a'][l] = 1;
} else {
scanf("%d%d%s", &l, &r, s2);
len2 = strlen(s2);
if (r - l + 1 < len2) {
puts("0");
continue;
}
ans = ones;
for (int i = 0; i < len2; i++) {
ans &= (B[s2[i] - 'a'] >> i);
}
ans >>= l;
cout << ans.count() - (ans >> (r - l - len2 + 2)).count() << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
using namespace std;
const long long N = 100001;
const long long MOD = 1000000007;
const long long INF = LLONG_MAX;
bitset<N> bs[26], all, ans;
int main() {
ios::sync_with_stdio(false), cin.tie(NULL);
int t = 1, cs = 0;
while (t--) {
int n, q, type, id, i, l, r;
string s, p;
char ch;
cin >> s >> q;
n = s.size();
for (i = 0; i < n; i++) {
all[i] = 1;
bs[s[i] - 'a'][i] = 1;
}
while (q--) {
cin >> type;
if (type == 1) {
cin >> id >> ch;
id--;
bs[s[id] - 'a'][id] = 0;
bs[ch - 'a'][id] = 1;
s[id] = ch;
} else {
cin >> l >> r >> p;
if (p.size() > r - l + 1) {
cout << 0 << endl;
continue;
}
ans = all;
for (i = 0; i < p.size(); i++) ans &= (bs[p[i] - 'a'] >> i);
cout << (ans >> (l - 1)).count() - (ans >> (r - p.size() + 1)).count()
<< endl;
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int dy[] = {1, -1, 0, 0, -1, 1, 1, -1};
int dx[] = {0, 0, 1, -1, 1, -1, 1, -1};
void file() {}
void fast() {
std::ios_base::sync_with_stdio(0);
cin.tie(NULL);
}
const int N = 1e5 + 9;
char s[N], y[N];
class SuffixAutomaton {
private:
class SNode {
public:
int len, link, firstpos, is_clone;
vector<int> next;
int endpos;
vector<int> inv_next;
SNode() {
len = 0, link = firstpos = -1;
endpos = 1;
is_clone = 0;
next = vector<int>(26, -2);
}
SNode(const SNode& other) {
len = other.len;
link = other.link;
next = other.next;
firstpos = other.firstpos;
endpos = other.endpos;
is_clone = other.is_clone;
}
};
public:
int last, cur, n;
vector<SNode> nodes;
vector<long long> dist_substr;
vector<int> sz_link_tree;
SuffixAutomaton() {}
SuffixAutomaton(int l, int r) {
n = r - l + 1;
nodes.resize(2 * n);
dist_substr = vector<long long>(2 * n, -1);
sz_link_tree = vector<int>(2 * n);
last = 0, cur = 1;
for (int i = l; i <= r; i++) add_char(s[i]);
build_inv_next();
dfs_linktree(0);
}
inline void add_char(char ch) {
int newNode = cur++;
nodes[newNode].len = nodes[last].len + 1;
nodes[newNode].firstpos = nodes[newNode].len - 1;
int p = last;
last = newNode;
for (; p != -1 && nodes[p].next[ch - 'a'] == -2; p = nodes[p].link)
nodes[p].next[ch - 'a'] = newNode;
if (p == -1) {
nodes[newNode].link = 0;
return;
}
int q = nodes[p].next[ch - 'a'];
if (nodes[p].len + 1 == nodes[q].len) {
nodes[newNode].link = q;
return;
}
int clone = cur++;
nodes[clone] = SNode(nodes[q]);
nodes[clone].len = nodes[p].len + 1;
nodes[clone].endpos = 0;
nodes[clone].is_clone = true;
nodes[q].link = clone;
nodes[newNode].link = clone;
for (; p != -1 && nodes[p].next[ch - 'a'] != -2 &&
nodes[p].next[ch - 'a'] == q;
p = nodes[p].link)
nodes[p].next[ch - 'a'] = clone;
}
inline void build_inv_next() {
for (int i = 1; i < cur; i++) nodes[nodes[i].link].inv_next.push_back(i);
}
inline void dfs_linktree(int u) {
sz_link_tree[u] = !nodes[u].is_clone;
for (auto& v : nodes[u].inv_next) {
dfs_linktree(v);
sz_link_tree[u] += sz_link_tree[v];
}
}
inline int match() {
int u = 0, idx = 0;
while (y[idx] != '\0' && nodes[u].next[y[idx] - 'a'] != -2)
u = nodes[u].next[y[idx] - 'a'], idx++;
if (y[idx] != '\0') return 0;
return u;
}
inline int get_cnt_occurrences_of_pattern() {
int u = match();
if (!u) return 0;
return sz_link_tree[u];
}
};
int szy;
SuffixAutomaton sa[(int)1e5 + 9];
vector<int> f;
inline vector<int> failure() {
f = vector<int>(szy);
for (int i = 1; y[i] != '\0'; i++) {
int p = f[i - 1];
char ch = y[p];
while (p && ch != y[i]) p = f[p - 1], ch = y[p];
if (ch == y[i]) p++;
f[i] = p;
}
return f;
}
inline int kmp(int l, int r) {
int ret = 0;
int idx = 0;
for (int i = l; i <= r; i++) {
if (s[i] == y[idx]) {
idx++;
if (y[idx] == '\0') {
ret++;
idx = f[idx - 1];
}
continue;
}
if (!idx) continue;
idx = f[idx - 1];
i--;
}
return ret;
}
const int sq = 100;
int main() {
file();
scanf(" %s", s);
int n = strlen(s);
int q;
scanf("%d", &q);
for (int i = 0; i * sq < n; i++)
sa[i] = SuffixAutomaton(i * sq, min(n - 1, (i + 1) * sq - 1));
while (q--) {
int t;
scanf("%d", &t);
if (t == 1) {
int i;
char ch;
scanf("%d %c", &i, &ch);
i--;
s[i] = ch;
int bk = i / sq;
sa[bk] = SuffixAutomaton(bk * sq, min(n - 1, (bk + 1) * sq - 1));
continue;
}
int l, r;
scanf("%d%d", &l, &r);
l--, r--;
scanf(" %s", y);
szy = strlen(y);
f = failure();
if (szy >= sq || r - l + 1 <= 2 * sq) {
printf("%d\n", kmp(l, r));
continue;
}
int lbk = l / sq;
int rbk = r / sq;
int ans = kmp(l, (lbk + 1) * sq + szy - 2);
ans += kmp(rbk * sq - szy + 1, r);
for (int i = lbk + 1; i < rbk; i++)
ans += sa[i].get_cnt_occurrences_of_pattern();
for (int i = lbk + 1; i < rbk - 1; i++)
ans += kmp((i + 1) * sq - szy + 1, (i + 1) * sq + szy - 2);
printf("%d\n", ans);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bitset<100015> a[27], ans;
char s[100005], ch[100005];
int main() {
scanf("%s", s + 1);
int n = strlen(s + 1);
for (int i = 1; i <= n; ++i) a[s[i] - 'a'].set(i);
int m;
scanf("%d", &m);
int kind, l, r, x;
char y;
for (int i = 1; i <= m; ++i) {
scanf("%d", &kind);
switch (kind) {
case 1:
scanf("%d %c", &x, &y);
a[s[x] - 'a'].reset(x);
s[x] = y;
a[s[x] - 'a'].set(x);
break;
case 2:
scanf("%d%d%s", &l, &r, ch + 1);
ans.set();
int len = strlen(ch + 1);
if (r - l + 1 < len) {
puts("0");
continue;
}
for (int i = 1; i <= len; ++i) {
ans &= a[ch[i] - 'a'] >> i;
}
printf("%d\n",
(ans >> (l - 1)).count() - (ans >> (r - len + 1)).count());
break;
}
}
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
char s[100005], t[100005];
bitset<100005> p[27], ini, ans;
inline int read() {
int x = 0;
char c = getchar();
while (c < '0' || c > '9') c = getchar();
while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
return x;
}
int main() {
int n, q, i, j, opt, l, r, len;
scanf("%s", s + 1);
n = strlen(s + 1);
for (i = 1; i <= n; i++) {
p[s[i] - 'a'][i] = 1;
ini[i] = 1;
}
q = read();
while (q--) {
opt = read();
if (opt == 1) {
l = read();
scanf("%s", t + 1);
p[s[l] - 'a'][l] = 0;
s[l] = t[1];
p[s[l] - 'a'][l] = 1;
continue;
}
l = read();
r = read();
scanf("%s", t + 1);
len = strlen(t + 1);
if (r - l + 1 < len) {
puts("0");
continue;
}
ans = ini;
int res = 0;
for (i = 1; i <= len; i++) {
ans &= (p[t[i] - 'a'] >> (i - 1));
}
r -= (len - 1);
if (r - l + 1 <= 233) {
for (j = l; j <= r; j++) res += ans[j];
printf("%d\n", res);
continue;
}
int *o = (int *)&ans;
while (l & 31) res += ans[l++];
while (r & 31) res += ans[r--];
res += ans[r];
l >>= 5;
r >>= 5;
for (j = l; j < r; j++) {
res += __builtin_popcount(o[j]);
}
printf("%d\n", res);
}
return 0;
}
|
#include <bits/stdc++.h>
const int B = 2;
const int C = 26;
const int N = 100005;
char v[B];
char s[N], now[N];
int n, q, x, y, o;
std::bitset<N> a;
std::bitset<N> se[C];
int main() {
std::ios::sync_with_stdio(0);
std::cin.tie(0), std::cout.tie(0);
std::cin >> s + 1, n = strlen(s + 1);
for (int i = 1; i <= n; ++i) se[s[i] - 'a'].set(i, 1);
std::cin >> q;
for (int i = 1; i <= q; ++i) {
std::cin >> o;
if (o == 1) {
std::cin >> x >> v;
se[s[x] - 'a'].set(x, 0), se[v[0] - 'a'].set(x, 1);
s[x] = v[0];
} else {
std::cin >> x >> y >> now + 1;
a.set();
int l = strlen(now + 1);
for (int i = 1; i <= l; ++i) a &= (se[now[i] - 'a'] >> (i - 1));
int la = (a >> x).count(), lb = (a >> (y - l + 2)).count();
std::cout << ((la - lb < 0) ? 0 : la - lb) << '\n';
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int dr[]{-1, -1, 0, 1, 1, 1, 0, -1};
const int dc[]{0, 1, 1, 1, 0, -1, -1, -1};
void run() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
const int sqrtQ = 400;
class suffix_array {
const static int alpha = 128;
int getOrder(int a) const { return (a < (int)order.size() ? order[a] : 0); }
public:
int n;
string s;
vector<int> suf, order, lcp;
suffix_array() {}
suffix_array(const string &s) : n(s.size() + 1), s(s) {
suf = order = lcp = vector<int>(n);
vector<int> bucket_idx(n), newOrder(n), newsuff(n);
{
vector<int> prev(n), head(alpha, -1);
for (int i = 0; i < n; i++) {
prev[i] = head[s[i]];
head[s[i]] = i;
}
int buc = -1, idx = 0;
for (int i = 0; i < alpha; i++) {
if (head[i] == -1) continue;
bucket_idx[++buc] = idx;
for (int j = head[i]; ~j; j = prev[j]) suf[idx++] = j, order[j] = buc;
}
}
int len = 1;
do {
auto cmp = [&](int a, int b) {
if (order[a] != order[b]) return order[a] < order[b];
return getOrder(a + len) < getOrder(b + len);
};
for (int i = 0; i < n; i++) {
int j = suf[i] - len;
if (j < 0) continue;
newsuff[bucket_idx[order[j]]++] = j;
}
for (int i = 1; i < n; i++) {
suf[i] = newsuff[i];
bool cmpres = cmp(suf[i - 1], suf[i]);
newOrder[suf[i]] = newOrder[suf[i - 1]] + cmpres;
if (cmpres) bucket_idx[newOrder[suf[i]]] = i;
}
order = newOrder;
len <<= 1;
} while (order[suf[n - 1]] != n - 1);
}
int count(const string &x) {
int st = 0, ed = n;
for (int i = 0; i < (int)(x.size()) && st < ed; i++) {
auto cmp = [&](int a, int b) {
if (a == -1) return x[i] < s[b + i];
return s[a + i] < x[i];
};
st = lower_bound(suf.begin() + st, suf.begin() + ed, -1, cmp) -
suf.begin();
ed = upper_bound(suf.begin() + st, suf.begin() + ed, -1, cmp) -
suf.begin();
}
return max(0, ed - st);
}
} SA[(int)1e4];
string y;
vector<int> longestPrefix;
vector<int> Fail[26];
int fail(int k, char nxt) {
int &rt = Fail[nxt - 'a'][k];
if (~rt) return rt;
while (k > 0 && y[k] != nxt) k = longestPrefix[k - 1];
if (nxt == y[k]) k++;
return rt = k;
}
void failure_function() {
int n = y.size();
longestPrefix = vector<int>(n);
for (int i = 0; i < 26; i++) Fail[i] = vector<int>(n + 1, -1);
for (int i = 1, k = 0; i < n; i++) longestPrefix[i] = k = fail(k, y[i]);
}
int main() {
run();
string s;
int q;
cin >> s >> q;
for (int i = 0; i < (int)(s.size()); i += sqrtQ)
SA[i / sqrtQ] = suffix_array(s.substr(i, sqrtQ));
auto solve = [&](int l, int r) {
int match = 0, cnt = 0;
for (int i = l; i <= r; i++) {
match = fail(match, s[i]);
if (match == (int)(y.size())) {
cnt++;
match = longestPrefix[match - 1];
}
}
return cnt;
};
while (q--) {
int t;
cin >> t;
if (t == 1) {
int idx;
char ch;
cin >> idx >> ch;
idx--;
s[idx] = ch;
SA[idx / sqrtQ] = suffix_array(s.substr(idx / sqrtQ * sqrtQ, sqrtQ));
} else {
int l, r;
cin >> l >> r >> y;
l--, r--;
failure_function();
if ((int)(y.size()) >= sqrtQ || r - l <= 2 * sqrtQ) {
cout << solve(l, r) << "\n";
continue;
}
int ans = 0, len = (int)(y.size());
int st = l / sqrtQ, ed = r / sqrtQ;
ans += solve(l, (st + 1) * sqrtQ + len - 2);
ans += solve(ed * sqrtQ - len + 1, r);
for (int i = st + 1; i < ed; i++) ans += SA[i].count(y);
for (int i = st + 2; i < ed; i++)
ans += solve(i * sqrtQ - len + 1, i * sqrtQ + len - 2);
cout << ans << "\n";
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
char s[100010];
char que[100010];
bitset<100010> b[26];
int main() {
scanf("%s", s);
int n = strlen(s), m;
int op, l, r;
for (int i = 0; i < n; i++) {
b[(s[i] - 'a')].set(i);
}
int Q;
scanf("%d", &Q);
for (int q = 1; q <= Q; q++) {
scanf("%d", &op);
if (op == 1) {
scanf("%d%s", &l, que);
for (int i = 0; i < 26; i++) b[i].reset(l - 1);
b[(que[0] - 'a')].set(l - 1);
} else {
scanf("%d%d%s", &l, &r, que);
m = strlen(que);
if (m > r - l + 1) {
puts("0");
continue;
}
bitset<100010> cnt = b[(que[0] - 'a')];
for (int i = 1; i < m; i++) cnt &= b[(que[i] - 'a')] >> (i);
int ans = 0;
printf("%d\n", (cnt >> l - 1).count() - (cnt >> r - m + 1).count());
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
char s[N], t[N];
bitset<N> bs[26], cur;
int main() {
scanf("%s", s + 1);
int n = strlen(s + 1);
for (int i = 1; i <= n; i++) bs[s[i] - 'a'][i] = 1;
int q;
cin >> q;
while (q--) {
int type;
scanf("%d", &type);
if (type == 1) {
int idx;
scanf("%d", &idx);
scanf("%s", t);
bs[s[idx] - 'a'][idx] = 0;
s[idx] = t[0];
bs[s[idx] - 'a'][idx] = 1;
} else {
int l, r;
scanf("%d %d %s", &l, &r, t + 1);
int m = strlen(t + 1);
if (r - l + 1 < m) {
printf("0\n");
continue;
}
cur.set();
for (int i = 1; i <= m; i++) {
cur &= (bs[t[i] - 'a'] >> (i - 1));
}
cur >>= l;
int ans = cur.count();
cur >>= (r - l - m + 2);
ans -= cur.count();
printf("%d\n", ans);
}
}
}
|
#include <bits/stdc++.h>
#pragma GCC optimize(3)
#pragma GCC target("avx,sse2,sse3,sse4,mmx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("inline-functions-called-once")
using namespace std;
int q;
char s[100005] = {0};
bitset<100005> m[27], ans;
int main() {
scanf("%s", s);
int len = strlen(s);
for (int i = 0; i < len; i++) {
if (s[i] >= 'a' && s[i] <= 'z') {
m[s[i] - 'a'][i + 1] = 1;
}
}
scanf("%d", &q);
for (int i = 1; i <= q; i++) {
int op;
scanf("%d", &op);
if (op == 1) {
int pos;
char ne;
scanf("%d %c", &pos, &ne);
m[s[pos - 1] - 'a'][pos] = 0;
m[ne - 'a'][pos] = 1;
s[pos - 1] = ne;
} else if (op == 2) {
int tl, tr;
char s2[100005] = {0};
scanf("%d %d %s", &tl, &tr, s2);
ans.set();
int lens2 = strlen(s2);
for (int j = 0; j < lens2; j++) {
ans &= (m[s2[j] - 'a'] >> j);
}
int leftN = (ans >> (tl)).count();
int rigthN = (ans >> (tr - lens2 + 2)).count();
if (leftN - rigthN < 0) leftN = rigthN;
printf("%d\n", leftN - rigthN);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 100500;
bitset<N> used[26];
int main() {
ios_base::sync_with_stdio(false);
string s;
int q;
cin >> s >> q;
for (int i = 0; i < s.size(); i++) used[s[i] - 'a'][i] = true;
while (q--) {
int type;
cin >> type;
if (type == 1) {
int ind;
char c;
cin >> ind >> c;
ind--;
used[s[ind] - 'a'][ind] = false;
used[c - 'a'][ind] = true;
s[ind] = c;
} else {
int l, r;
string s;
cin >> l >> r >> s;
l--, r--;
if (r - l + 1 < s.size())
cout << 0 << endl;
else {
bitset<N> ans;
ans.set();
for (int i = 0; i < s.size(); i++) ans &= used[s[i] - 'a'] >> i;
cout << (ans >> l).count() - (ans >> (r - s.size() + 2)).count()
<< endl;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bitset<100000> w[26];
bitset<100000> tmp;
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
string s;
int q;
cin >> s >> q;
for (int i = 0; i < s.size(); ++i) w[s[i] - 'a'].set(i);
for (int test = 0; test < q; ++test) {
int type;
cin >> type;
if (type == 1) {
int i;
string c;
cin >> i >> c;
--i;
w[s[i] - 'a'].reset(i);
s[i] = c[0];
w[s[i] - 'a'].set(i);
} else {
int l, r;
string y;
cin >> l >> r >> y;
--l;
r -= y.size();
if (l > r) {
cout << 0 << endl;
continue;
}
tmp.set();
for (int i = 0; i < y.size(); ++i) {
tmp &= w[y[i] - 'a'] >> i;
}
tmp >>= l;
tmp <<= l + 100000 - r - 1;
int res = tmp.count();
cout << res << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize(2)
const int MAXN = 1e5 + 19;
std::bitset<MAXN> myBit[26], ans;
int q, len;
char str[MAXN], s[MAXN];
int opt, x, l, r;
inline int up(int x) { return x > 0 ? x : 0; }
int main() {
std::scanf("%s%d", str + 1, &q);
len = std::strlen(str + 1);
for (int i = 1; i <= len; ++i) myBit[str[i] - 'a'][i] = 1;
while (q--) {
std::scanf("%d", &opt);
if (opt == 1) {
std::scanf("%d%s", &x, s + 1);
myBit[str[x] - 'a'][x] = 0;
str[x] = s[1];
myBit[str[x] - 'a'][x] = 1;
} else if (opt == 2) {
std::scanf("%d%d%s", &l, &r, s + 1);
len = std::strlen(s + 1);
ans.set();
for (int i = 1; i <= len; ++i) ans &= myBit[s[i] - 'a'] >> (i - 1);
r = r - len + 1;
std::printf("%d\n", up(((ans >> l).count() - (ans >> (r + 1)).count())));
}
}
return 0;
}
|
#include <bits/stdc++.h>
using pii = std::pair<int, int>;
using pll = std::pair<long long, long long>;
const int maxn = 1e5 + 10;
std::bitset<maxn> mask[26];
int main() {
std::ios::sync_with_stdio(false);
std::string in;
std::cin >> in;
for (size_t i = 0; i < in.length(); i++) mask[in[i] - 'a'][i] = 1;
int q;
std::cin >> q;
while (q--) {
int c;
std::cin >> c;
if (c == 1) {
int x;
char ch;
std::cin >> x >> ch;
--x;
mask[in[x] - 'a'][x] = 0;
in[x] = ch;
mask[ch - 'a'][x] = 1;
} else {
int l, r;
std::string pat;
std::cin >> l >> r >> pat;
--l;
if (r - l < (int)pat.length()) {
std::cout << "0\n";
continue;
}
auto test = std::bitset<maxn>{}.set();
for (size_t i = 0; i < pat.length(); i++) test &= mask[pat[i] - 'a'] >> i;
int ans = (test >> l).count() - (test >> (r - pat.length() + 1)).count();
std::cout << ans << "\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
namespace Primary {
const int maxn = 1e5 + 10;
char s[maxn], t[maxn];
int q;
bitset<maxn> help[26], ans;
void main() {
scanf("%s%d", s, &q);
int len = strlen(s);
for (int i = 0; i < len; ++i) help[s[i] - 'a'].set(i);
int opt, ql, qr;
while (q--) {
scanf("%d", &opt);
if (opt == 1) {
scanf("%d%s", &ql, t), --ql;
help[s[ql] - 'a'].set(ql, 0);
help[t[0] - 'a'].set(ql);
s[ql] = t[0];
} else {
scanf("%d%d%s", &ql, &qr, t);
len = strlen(t);
if (len > qr - ql + 1) {
puts("0");
continue;
}
ans.set();
for (int i = 0; i < len; ++i) ans &= (help[t[i] - 'a'] >> i);
int ans_l = (ans >> (ql - 1)).count();
int ans_r = (ans >> (qr - len + 1)).count();
printf("%d\n", ans_l - ans_r);
}
}
}
} // namespace Primary
int main() {
Primary::main();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline int read() {
char c = getchar();
int x = 0, f = 1;
while (c < '0' || c > '9') {
if (c == '-') f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
return x * f;
}
inline char readchar() {
char c = getchar();
while (c < 'a' || c > 'z') c = getchar();
return c;
}
const int N = 100005;
int n;
char str[N], nowstr[N];
bitset<N> v[26], ans;
int main() {
scanf("%s", str + 1);
n = strlen(str + 1);
for (int i = 1; i <= n; i++) v[str[i] - 'a'].set(i, 1);
int T = read();
while (T--) {
int opt = read();
if (opt == 1) {
int x = read();
char nc = readchar();
if (str[x] != nc)
v[nc - 'a'].set(x, 1), v[str[x] - 'a'].set(x, 0), str[x] = nc;
} else {
int l = read(), r = read();
scanf("%s", nowstr + 1);
int sl = strlen(nowstr + 1);
ans.set();
for (int i = 1; i <= sl; i++) ans &= (v[nowstr[i] - 'a'] >> (i - 1));
int lc = (ans >> l).count(), rc = (ans >> (r - sl + 2)).count();
if (lc < rc)
printf("0\n");
else
printf("%d\n", lc - rc);
}
}
return 0;
}
|
#include <bits/stdc++.h>
const int MAXN = 1e5 + 19;
std::bitset<MAXN> myBit[26], ans;
int q, len;
char str[MAXN], s[MAXN];
int opt, x, l, r;
inline int up(int x) { return x > 0 ? x : 0; }
int main() {
std::scanf("%s%d", str + 1, &q);
len = std::strlen(str + 1);
for (int i = 1; i <= len; ++i) myBit[str[i] - 'a'][i] = 1;
while (q--) {
std::scanf("%d", &opt);
if (opt == 1) {
std::scanf("%d%s", &x, s + 1);
myBit[str[x] - 'a'][x] = 0;
str[x] = s[1];
myBit[str[x] - 'a'][x] = 1;
} else if (opt == 2) {
std::scanf("%d%d%s", &l, &r, s + 1);
len = std::strlen(s + 1);
ans.set();
for (int i = 1; i <= len; ++i) ans &= myBit[s[i] - 'a'] >> (i - 1);
r = r - len + 1;
std::printf("%d\n", up(((ans >> l).count() - (ans >> (r + 1)).count())));
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e+5 + 400;
const int maxs = 700 + 10;
int n, m, s, qq;
char str[maxn], a[maxn];
int nxt[maxn];
struct SAM {
int ch[maxs][26], mx[maxs], pr[maxs];
int rd[maxs], Rsiz[maxs], last, tot;
void clear() {
tot = Rsiz[0] = 1;
pr[0] = -1;
last = mx[0] = rd[0] = 0;
memset(ch, -1, sizeof(ch));
}
void extend(char c) {
int p = last, np = last = tot++;
mx[np] = mx[p] + 1;
Rsiz[np] = 1;
rd[np] = 0;
for (; p != -1 && ch[p][c - 'a'] == -1; p = pr[p]) ch[p][c - 'a'] = np;
if (p == -1) {
pr[np] = 0;
rd[0]++;
return;
}
int q = ch[p][c - 'a'];
if (mx[q] == mx[p] + 1) {
pr[np] = q;
rd[q]++;
return;
}
int nq = tot++;
rd[nq] = 2;
Rsiz[nq] = 0;
mx[nq] = mx[p] + 1;
pr[nq] = pr[q];
pr[q] = pr[np] = nq;
for (int i = 0; i < 26; i++) ch[nq][i] = ch[q][i];
for (; p != -1 && ch[p][c - 'a'] == q; p = pr[p]) ch[p][c - 'a'] = nq;
}
void calRsiz() {
queue<int> q;
int i, u;
for (i = 0; i < tot; i++)
if (!rd[i]) q.push(i);
while (!q.empty()) {
u = q.front();
q.pop();
Rsiz[pr[u]] += Rsiz[u];
rd[pr[u]]--;
if (!rd[pr[u]]) q.push(pr[u]);
}
}
int find(char *s, int n) {
int i, u = 0;
for (i = 0; i < n; i++) {
u = ch[u][s[i] - 'a'];
if (u == -1) return 0;
}
return Rsiz[u];
}
inline void rebuilt(char *s, int n) {
clear();
for (int i = 0; i < n; i++) extend(s[i]);
calRsiz();
}
} S[330];
void input() {
int i;
scanf("%s%d", str, &qq);
n = strlen(str);
s = sqrt(n);
for (i = 0; i <= n / s; i++) S[i].rebuilt(str + i * s, min(n - i * s, s));
}
void kmp_pre(char *s, int n) {
int i, j;
nxt[0] = nxt[1] = 0;
for (i = 1; i < n; i++) {
for (j = nxt[i]; s[i] != s[j] && j; j = nxt[j])
;
nxt[i + 1] = j + (s[i] == s[j]);
}
}
int kmp(char *s, char *t, int n, int m) {
int i, j = 0, ans = 0;
for (i = 0; i < n; i++) {
for (; s[i] != t[j] && j; j = nxt[j])
;
if (s[i] == t[j]) j++;
if (j == m) ans++, j = nxt[j];
}
return ans;
}
void solve() {
int op, l, r, i;
scanf("%d", &op);
if (op == 1) {
scanf("%d%s", &l, a);
l--;
str[l] = a[0];
S[l / s].rebuilt(str + l / s * s, min(n - l / s * s, s));
} else {
scanf("%d%d%s", &l, &r, a);
l--;
r--;
m = strlen(a);
kmp_pre(a, m);
if (l / s == r / s || l / s + 1 == r / s || m >= s) {
printf("%d\n", kmp(str + l, a, r - l + 1, m));
return;
}
int ans = kmp(str + l, a, (l / s + 1) * s + m - 1 - l, m) +
kmp(str + r / s * s - m + 1, a, r - r / s * s + m, m);
for (i = l / s + 1; i < r / s; i++)
ans += S[i].find(a, m) +
(i != l / s + 1 ? kmp(str + i * s - m + 1, a, m - 1 << 1, m) : 0);
cout << ans << endl;
}
}
int main() {
input();
while (qq--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int readint() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
int n, m, q, opt, x, y;
char s[100005], t[100005];
bitset<100005> b[30], now;
int main() {
scanf("%s", s + 1);
n = strlen(s + 1);
for (int i = 1; i <= n; i++) b[s[i] - 'a' + 1][i] = 1;
q = readint();
char ch;
while (q--) {
opt = readint();
x = readint();
if (opt == 1) {
scanf("%c", &ch);
b[s[x] - 'a' + 1][x] = 0, b[ch - 'a' + 1][x] = 1;
s[x] = ch;
} else {
y = readint();
scanf("%s", t + 1);
m = strlen(t + 1);
now = b[t[1] - 'a' + 1] << (100005 - y - 1);
for (int i = 2; i <= m; i++)
now &= (b[t[i] - 'a' + 1] << (100005 - y - 1) >> (i - 1));
printf("%d\n", (now >> (100005 - y - 1 + x)).count());
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s, r;
bitset<100010> inf;
bitset<100010> ans;
bitset<100010> a[26];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> s;
n = s.size();
for (int i = 0; i < n; ++i) {
inf[i] = 1;
a[s[i] - 'a'][i] = 1;
}
int q;
cin >> q;
r = s;
while (q--) {
int t;
char c;
cin >> t;
if (t == 1) {
int p;
cin >> p >> c;
--p;
a[r[p] - 'a'][p] = 0;
r[p] = c;
a[c - 'a'][p] = 1;
continue;
}
int l, r;
cin >> l >> r >> s;
if (s.size() > r - l + 1) {
cout << 0 << '\n';
continue;
}
--l;
--r;
ans = inf;
for (int i = 0; i < s.size(); ++i) {
ans &= (a[s[i] - 'a'] >> (l + i));
}
cout << ans.count() - (ans >> (r - l - s.size() + 2)).count() << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
bitset<maxn> rec[30], ans;
char s1[maxn], s2[maxn];
int idx(char c) { return c - 'a'; }
int main() {
scanf("%s", s1 + 1);
int n = strlen(s1 + 1);
for (int i = 1; i <= n; ++i) rec[idx(s1[i])][i] = 1;
int Q;
scanf("%d", &Q);
while (Q--) {
int op;
scanf("%d", &op);
if (op == 1) {
int pos;
char ch;
scanf("%d %c", &pos, &ch);
rec[idx(s1[pos])][pos] = 0;
rec[idx(ch)][pos] = 1;
s1[pos] = ch;
} else {
int l, r;
scanf("%d%d%s", &l, &r, s2);
int m = strlen(s2);
ans.set();
for (int i = 0; i < m; ++i) ans &= (rec[idx(s2[i])] >> i);
int cntl = (ans >> l).count();
int cntr = (ans >> (r - m + 2)).count();
if (cntl < cntr)
puts("0");
else
printf("%d\n", cntl - cntr);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxN = 1e5 + 10;
int q;
int a[maxN + 1];
char s[maxN + 1];
bitset<maxN> b[26], res;
int main() {
scanf("%s", s + 1);
int len = strlen(s + 1);
for (int i = 1; i <= len; i++) b[a[i] = s[i] - 'a'].flip(i);
scanf("%d", &q);
while (q--) {
int op, x, y;
scanf("%d", &op);
if (op == 1) {
scanf("%d %s", &x, s + 1);
int c = s[1] - 'a';
b[a[x]].flip(x);
b[a[x] = c].flip(x);
} else {
scanf("%d %d %s", &x, &y, s + 1);
len = strlen(s + 1);
if (y - x + 1 < len) {
puts("0");
continue;
}
res.set();
for (int i = len; i >= 1; i--) {
res = res & b[s[i] - 'a'];
if (i > 1) res >>= 1;
}
printf("%d\n",
(int)(res >> x).count() - (int)(res >> (y - len + 2)).count());
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline int read() {
char ch = getchar();
bool f = 0;
int x = 0;
for (; !isdigit(ch); ch = getchar())
if (ch == '-') f = 1;
for (; isdigit(ch); ch = getchar()) x = (x << 1) + (x << 3) + (ch ^ 48);
if (f == 1) x = -x;
return x;
}
int len, num, opt, l, r, x, n, ans1, ans2, len1;
bitset<100005> a[27], b;
char s[100005], c;
int main() {
scanf("%s", s);
len1 = strlen(s);
for (int i = 0; i < len1; i++) {
a[s[i] - 'a'][i + 1] = 1;
}
n = read();
for (int i = 1; i <= n; i++) {
opt = read();
if (opt == 1) {
scanf("%d %c", &x, &c);
a[s[x - 1] - 'a'][x] = 0;
a[c - 'a'][x] = 1;
s[x - 1] = c;
} else {
l = read(), r = read();
char s2[100005] = {0};
scanf("%s", s2);
len = strlen(s2);
b.set();
for (int j = 0; j < len; j++) {
b = b & (a[s2[j] - 'a'] >> j);
}
ans1 = (b >> l).count(), ans2 = (b >> (r - len + 2)).count();
if (ans1 - ans2 < 0) ans1 = ans2;
printf("%d\n", ans1 - ans2);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int sa = 2 * 150 + 10;
const int LEN = 100010;
char s[LEN], sq[LEN], zstring[2 * LEN];
int z[2 * LEN];
string temps;
struct SuffixAutomaton {
int edges[26][sa], link[sa], length[sa], isTerminal[sa], dp1[sa], last;
int sz;
SuffixAutomaton() {
last = 0;
sz = 0;
}
void set(int k) {
for (int i = 0; i < 26; ++i) edges[i][k] = -1;
}
void build(string &s) {
link[0] = -1;
length[0] = 0;
last = 0;
sz = 1;
set(0);
for (int i = 0; i < s.size(); i++) {
set(sz);
length[sz] = i + 1;
link[sz] = 0;
int r = sz;
++sz;
int p = last;
while (p >= 0 && edges[s[i] - 'a'][p] == -1) {
edges[s[i] - 'a'][p] = r;
p = link[p];
}
if (p != -1) {
int q = edges[s[i] - 'a'][p];
if (length[p] + 1 == length[q]) {
link[r] = q;
} else {
for (int i = 0; i < 26; ++i) {
edges[i][sz] = edges[i][q];
}
length[sz] = length[p] + 1;
link[sz] = link[q];
int qq = sz;
++sz;
link[q] = qq;
link[r] = qq;
while (p >= 0 && edges[s[i] - 'a'][p] == q) {
edges[s[i] - 'a'][p] = qq;
p = link[p];
}
}
}
last = r;
}
for (int i = 0; i < sz; ++i) isTerminal[i] = 0, dp1[i] = -1;
int p = last;
while (p > 0) {
isTerminal[p] = 1;
p = link[p];
}
}
int solve(int pos) {
if (dp1[pos] != -1) return dp1[pos];
dp1[pos] = isTerminal[pos];
for (int i = 0; i < 26; ++i) {
if (edges[i][pos] != -1) dp1[pos] += solve(edges[i][pos]);
}
return dp1[pos];
}
int run() {
int cur = 0;
for (int i = 1; sq[i] != '\0'; ++i) {
auto it = edges[sq[i] - 'a'][cur];
if (it == -1)
return 0;
else
cur = it;
}
return solve(cur);
}
} SA[800];
void computeZ() {
int l, r;
z[0] = 0;
l = r = -1;
for (int i = 1; zstring[i] != '\0'; ++i) {
z[i] = 0;
if (r > i) {
z[i] = min(z[i - l], r - i + 1);
}
while (zstring[i + z[i]] == zstring[z[i]]) ++z[i];
if (i + z[i] - 1 > r) {
r = i + z[i] - 1;
l = i;
}
}
}
int computeBrute(int l, int r, int sqlen) {
int zslen = 0, ans = 0;
for (int i = 1; i <= sqlen; ++i) {
zstring[zslen++] = sq[i];
}
zstring[zslen++] = '$';
for (int i = l; i <= r; ++i) {
zstring[zslen++] = s[i];
}
zstring[zslen] = '\0';
computeZ();
for (int i = 1; i < zslen; ++i) {
if (z[i] >= sqlen) {
++ans;
}
}
return ans;
}
int main() {
int q, typ, l, r, slen;
char ch;
scanf(" %s", &s[1]);
slen = strlen(&s[1]);
scanf("%d", &q);
for (int i = 0; i <= slen; i += 150) {
temps = "";
int tempr = min(i + 150 - 1, slen);
for (int j = max(1, i); j <= tempr; ++j) {
temps += s[j];
}
SA[i / 150].build(temps);
}
while (q--) {
scanf("%d", &typ);
if (typ == 1) {
scanf("%d %c", &l, &ch);
s[l] = ch;
temps = "";
int bkt = l / 150;
int tempr = min(slen, (bkt + 1) * 150 - 1);
for (int i = max(1, bkt * 150); i <= tempr; ++i) {
temps += s[i];
}
SA[bkt].build(temps);
} else {
scanf("%d %d %s", &l, &r, &sq[1]);
int sqlen = strlen(&sq[1]);
if (sqlen >= 150 || r - l <= 2 * 150) {
printf("%d\n", computeBrute(l, r, sqlen));
} else {
int lbkt = l / 150, rbkt = r / 150, ans = 0;
for (int i = lbkt + 1; i < rbkt; ++i) {
ans += SA[i].run();
}
ans += computeBrute(l, (lbkt + 1) * 150 - 1, sqlen);
ans += computeBrute(rbkt * 150, r, sqlen);
for (int i = lbkt + 1; i <= rbkt; ++i) {
ans += computeBrute(max(l, i * 150 - sqlen + 1),
min(r, i * 150 + sqlen - 2), sqlen);
}
printf("%d\n", ans);
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char str[100005];
bitset<100005> temp[26], ans;
int main() {
int n;
scanf("%s", str);
scanf("%d", &n);
for (int i = 0; str[i]; ++i) {
if (str[i] >= 'a' && str[i] <= 'z') {
temp[str[i] - 'a'][i + 1] = 1;
}
}
for (int i = 0; i < n; ++i) {
int op;
scanf("%d", &op);
switch (op) {
case 1:
int pos;
char v;
scanf("%d %c", &pos, &v);
temp[str[pos - 1] - 'a'][pos] = 0;
temp[v - 'a'][pos] = 1;
str[pos - 1] = v;
break;
case 2:
int tl, tr;
char str2[100005] = {0};
scanf("%d %d %s", &tl, &tr, str2);
ans.set();
int j;
for (j = 0; str2[j]; ++j) {
ans &= (temp[str2[j] - 'a'] >> j);
}
int left = (ans >> (tl)).count();
int right = (ans >> (tr - j + 2)).count();
if (left - right < 0) {
left = right;
}
printf("%d\n", left - right);
break;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 0x3f3f3f3f;
const int maxn = 1e5 + 5;
const int mod = 1e9 + 7;
const int N = 1565;
using ull = unsigned long long;
struct Bitset {
ull b[N];
Bitset() { reset(); }
void set() { memset(b, 0xff, sizeof b); }
void set(int k) { b[k >> 6] |= 1LL << (k & 63); }
void reset() { memset(b, 0, sizeof b); }
void reset(int k) { b[k >> 6] &= ~(1LL << (k & 63)); }
bool get(int k) { return (b[k >> 6] >> (k & 63)) & 1; }
Bitset operator<<(int k) {
if (k == 0) return *this;
Bitset ret;
int pos = (k + 63) >> 6, s = (k & 63), t = (64 - s) & 63;
for (int i = 0; pos <= N; i++, pos++) {
if (pos < N) ret.b[i] = b[pos] << t;
if (s) ret.b[i] |= (b[pos - 1]) >> s;
}
return ret;
}
void operator&=(const Bitset& o) {
for (int i = 0; i < N; i++) b[i] &= o.b[i];
}
int count(int l, int r) {
int pl = l >> 6, pr = r >> 6;
if (pl == pr) {
int s = l & 63, d = r - l + 1;
return __builtin_popcountll((b[pl] >> s) & (((ull)1 << d) - 1));
}
int s = l & 63, t = r & 63;
int ans = __builtin_popcountll((b[pl] >> s));
for (int i = pl + 1; i < pr; i++) ans += __builtin_popcountll(b[i]);
if (t == 63) return ans + __builtin_popcountll(b[pr] & UINT64_MAX);
return ans + __builtin_popcountll(b[pr] & (((ull)1 << (t + 1)) - 1));
}
void output(int k) {
for (int i = 0; i < k; i++) cout << get(i);
cout << "\n";
}
} b[26], ans;
string s, t;
int main() {
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> s;
int n = s.size(), q;
for (int i = 0; i <= n - 1; i++) {
b[s[i] - 'a'].set(i);
}
cin >> q;
while (q--) {
int op, l, r, pos;
char c;
cin >> op;
if (op == 1) {
cin >> pos >> c;
pos--;
b[s[pos] - 'a'].reset(pos);
s[pos] = c;
b[c - 'a'].set(pos);
} else {
cin >> l >> r >> t;
int m = t.size();
if (r - l + 1 < m) {
cout << 0 << "\n";
continue;
}
l--;
r--;
ans = b[t[0] - 'a'];
for (int i = 1; i < m; i++) {
ans &= (b[t[i] - 'a'] << i);
}
cout << ans.count(l, r - m + 1) << "\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100010, inf = 1e9;
int n, ty, l, r, x;
bitset<maxn> v[26], ans;
char s[maxn], s2[maxn], c;
inline void read(int &k) {
int f = 1;
k = 0;
char c = getchar();
while (c < '0' || c > '9') c == '-' && (f = -1), c = getchar();
while (c <= '9' && c >= '0') k = k * 10 + c - '0', c = getchar();
k *= f;
}
int main() {
scanf("%s", s + 1);
int len = strlen(s + 1);
for (int i = 1; i <= len; i++) v[s[i] - 'a'][i] = 1;
read(n);
for (int i = 1; i <= n; i++) {
read(ty);
if (ty == 1) {
read(x);
scanf("%c", &c);
v[s[x] - 'a'][x] = 0;
v[(s[x] = c) - 'a'][x] = 1;
} else {
read(l);
read(r);
scanf("%s", s2);
int m = strlen(s2);
if (r - l + 1 < m) {
puts("0");
continue;
}
ans.set();
for (int j = 0; j < m; j++) ans &= (v[s2[j] - 'a'] >> j);
printf("%d\n",
(int)(ans >> (l)).count() - (int)(ans >> (r - m + 2)).count());
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 100010;
int n;
char s[N], t[N];
bitset<N> c[30], ans;
int main() {
scanf("%s%d", s + 1, &n);
for (int i = 1, _ = strlen(s + 1); i <= _; i++) c[s[i] - 'a'][i] = 1;
int op, x, y;
while (n--) {
scanf("%d", &op);
if (op == 1) {
scanf("%d%s", &x, t + 1);
c[s[x] - 'a'].reset(x);
s[x] = t[1];
c[s[x] - 'a'].set(x);
} else {
scanf("%d%d%s", &x, &y, t + 1);
int len = strlen(t + 1);
ans.set();
y = y - len + 1;
for (int i = 1; i <= len; i++) ans &= c[t[i] - 'a'] >> (i - 1);
printf("%d\n",
max(0, (int)((ans >> x).count() - (ans >> (y + 1)).count())));
}
}
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.