codeforces 580 E. Kefa and Watch (字符串hash + 线段树)
来源:互联网 发布:人工智能 智慧城市 编辑:程序博客网 时间:2024/05/18 03:36
One day Kefa the parrot was walking down the street as he was on the way home from the restaurant when he saw something glittering by the road. As he came nearer he understood that it was a watch. He decided to take it to the pawnbroker to earn some money.
The pawnbroker said that each watch contains a serial number represented by a string of digits from 0 to 9, and the more quality checks this number passes, the higher is the value of the watch. The check is defined by three positive integers l, r and d. The watches pass a check if a substring of the serial number from l to r has period d. Sometimes the pawnbroker gets distracted and Kefa changes in some substring of the serial number all digits to c in order to increase profit from the watch.
The seller has a lot of things to do to begin with and with Kefa messing about, he gave you a task: to write a program that determines the value of the watch.
Let us remind you that number x is called a period of string s (1 ≤ x ≤ |s|), if si = si + x for all i from 1 to |s| - x.
The first line of the input contains three positive integers n, m and k (1 ≤ n ≤ 105, 1 ≤ m + k ≤ 105) — the length of the serial number, the number of change made by Kefa and the number of quality checks.
The second line contains a serial number consisting of n digits.
Then m + k lines follow, containing either checks or changes.
The changes are given as 1 l r с (1 ≤ l ≤ r ≤ n, 0 ≤ c ≤ 9). That means that Kefa changed all the digits from the l-th to the r-th to be c.
The checks are given as 2 l r d (1 ≤ l ≤ r ≤ n, 1 ≤ d ≤ r - l + 1).
For each check on a single line print "YES" if the watch passed it, otherwise print "NO".
3 1 21122 2 3 11 1 3 82 1 2 1
NOYES
6 2 33349342 2 5 21 4 4 32 1 6 31 2 3 82 3 6 1
NOYESNO
字符串hash + 线段树
#include <iostream>#include <cstdio>using namespace std;#define LL unsigned long long#define LS n * 2#define RS n * 2 + 1const int N = 1e5 + 5;const int B = 233;const LL MOD = 1234567899;LL B_pow[N];LL h_val[10][N];char str[N];struct Seg {int l, r, flag;LL val;}seg[N * 4];void up(int n) {int r_len = seg[RS].r - seg[RS].l + 1;LL mul = B_pow[r_len];seg[n].val = (seg[LS].val * mul % MOD + seg[RS].val) % MOD;}void build(int l, int r, int n) {seg[n].l = l; seg[n].r = r; seg[n].flag = -1;if(l == r) {seg[n].val = str[l] - '0';return ;}int mid = (l + r) >> 1;build(l, mid, LS);build(mid + 1, r, RS);up(n);}void down(int n) {if(seg[n].flag != -1) {int d = seg[n].flag;seg[n].flag = -1;seg[LS].flag = seg[RS].flag = d;int len = seg[LS].r - seg[LS].l + 1;seg[LS].val = h_val[d][len];len = seg[RS].r - seg[RS].l + 1;seg[RS].val = h_val[d][len];}}void update(int l, int r, int d, int n) {if(seg[n].l == l && seg[n].r == r) {int len = r - l + 1;seg[n].val = h_val[d][len];seg[n].flag = d;return ;}down(n);int mid = (seg[n].l + seg[n].r) >> 1;if(r <= mid) update(l, r, d, LS);else if(l > mid) update(l, r, d, RS);else {update(l, mid, d, LS);update(mid + 1, r, d, RS);}up(n);}LL query(int l, int r, int n) {if(seg[n].l == l && seg[n].r == r) {return seg[n].val;}down(n);int mid = (seg[n].l + seg[n].r) >> 1;if(r <= mid) return query(l, r, LS);else if(l > mid) return query(l, r, RS);else {int r_len = r - mid;LL mul = B_pow[r_len];return (query(l, mid, LS) * mul % MOD + query(mid + 1, r, RS)) % MOD;}}void predo() {B_pow[0] = 1;for(int i = 1; i < N; ++i) {B_pow[i] = B_pow[i - 1] * B % MOD;}for(int i = 0; i < 10; ++i) {h_val[i][0] = 0;}for(int i = 0; i < 10; ++i) {for(int j = 1; j < N; ++j) {h_val[i][j] = (h_val[i][j - 1] * B % MOD + i) % MOD;}}}void print(int n) {for(int i = 1; i <= n; ++i) {cout<<query(i, i, 1)<<' ';}cout<<endl;}int main() {predo();int n, m, k;cin>>n>>m>>k;cin>>str + 1;build(1, n, 1);for(int i = 0; i < m + k; ++i) {int op, l, r, d;cin>>op>>l>>r>>d;if(op == 1) {update(l, r, d, 1);//print(n);} else {if(r - l + 1 == d) {puts("YES");continue;}LL x = query(l, r - d, 1);LL y = query(l + d, r, 1);//cout<<x<<' '<<y<<endl;if(x == y) puts("YES");else puts("NO");}}return 0;}
- codeforces 580 E. Kefa and Watch (字符串hash + 线段树)
- codeforces 321# E. Kefa and Watch (线段树+字符串hash)
- Codeforces 580E Kefa and Watch 线段树+双值Hash
- codeforces 580 E. Kefa and Watch(hash+线段树)
- CodeForces 580 E.Kefa and Watch(hash+线段树)
- Codeforces 580E Kefa and Watch 线段树
- Codeforces Round #321 (Div. 2) E - Kefa and Watch(hash + 线段树)
- CODEFORCES ROUND #321 (DIV. 2) E.Kefa and Watch(线段树+hash)
- Codeforces #321 E. Kefa and Watch (线段树、哈希)
- 字符串hash+线段树 Codeforces580E Kefa and Watch
- CODEFORCES 580E Kefa and Watch
- 查询[l,r]区间数字串是不是周期为d的串 线段树区间修改+双重hash Codeforces #321 E. Kefa and Watch
- CF#321-DIV2-E. Kefa and Watch-线段树+字符串哈希
- Codeforces Round #321 Kefa and Watch(字符串哈希+线段树)
- 【Code Forces 321E】【线段树+字符串哈希】Kefa and Watch 字符串修改 循环节判定
- 【线段树+字符串hash】 codeforces 213E Two Permutations
- Codeforces Round #321 (Div. 2)E 线段树+字符串hash
- codeforces580E. Kefa and Watch
- Maven安装与使用入门
- oracle序列详解
- SCU 4438 Censor(KMP / HASH)
- web前端,jquery实现瀑布流总结1,eq()函数的用法
- web前端,jquery实现瀑布流总结2,each遍历
- codeforces 580 E. Kefa and Watch (字符串hash + 线段树)
- 对话框:消息对话框
- Beef
- web前端,jquery实现瀑布流总结3,Math.floor()对数进行下舍入
- web前端,jquery实现瀑布流总结4,数组
- 协程Coroutine——用同步的方式编写异步的逻辑
- Java模拟简易ATM机运行(无界面、无数据库)
- web前端,jquery实现瀑布流总结5,jQuery CSS 操作 - css() 方法
- iOS 之 (闭包)block传值