codeforces 580 E. Kefa and Watch (字符串hash + 线段树)
2015-10-01 16:04
501 查看
E. Kefa and Watch
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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.
Input
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).
Output
For each check on a single line print "YES" if the watch passed it, otherwise print "NO".
Sample test(s)
input
output
input
output
字符串hash + 线段树
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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.
Input
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).
Output
For each check on a single line print "YES" if the watch passed it, otherwise print "NO".
Sample test(s)
input
3 1 2 112 2 2 3 1 1 1 3 8 2 1 2 1
output
NO YES
input
6 2 3 334934 2 2 5 2 1 4 4 3 2 1 6 3 1 2 3 8 2 3 6 1
output
NO YESNO
字符串hash + 线段树
#include <iostream> #include <cstdio> using namespace std; #define LL unsigned long long #define LS n * 2 #define RS n * 2 + 1 const int N = 1e5 + 5; const int B = 233; const LL MOD = 1234567899; LL B_pow ; LL h_val[10] ; char str ; 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 .val = (seg[LS].val * mul % MOD + seg[RS].val) % MOD; } void build(int l, int r, int n) { seg .l = l; seg .r = r; seg .flag = -1; if(l == r) { seg .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 .flag != -1) { int d = seg .flag; seg .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 .l == l && seg .r == r) { int len = r - l + 1; seg .val = h_val[d][len]; seg .flag = d; return ; } down(n); int mid = (seg .l + seg .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 .l == l && seg .r == r) { return seg .val; } down(n); int mid = (seg .l + seg .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; }
相关文章推荐
- web前端,jquery实现瀑布流总结4,数组
- SCU 4438 Censor(KMP / HASH)
- 美团+百度+网易+去哪儿+58面试总结
- web前端,jquery实现瀑布流总结3,Math.floor()对数进行下舍入
- 如何实现背景透明,文字不透明,兼容所有浏览器?
- 中间固定两侧自适应三栏布局
- web前端,jquery实现瀑布流总结2,each遍历
- QT中异形窗口的绘制(winEvent处理WM_NCHITTEST消息)
- 对话框:消息对话框
- zw版【转发·台湾nvp系列Delphi例程】HALCON ConvolImage
- zw版【转发·台湾nvp系列Delphi例程】HALCON SetComprise2
- 显示器 RUIGE瑞鸽高清显示器TL-S1700HD
- Maven安装与使用入门
- web前端,jquery实现瀑布流总结1,eq()函数的用法
- 信息安全系统设计基础第三周学习总结
- oracle序列详解
- zw版【转发·台湾nvp系列Delphi例程】HALCON SetComprise1
- SQL Server 维护计划实现数据库备份(策略实战)
- Qt学习之路【4】:qmake:syntax expecting ")")
- linux watch命令