AC日记——Milking Grid poj 2185
2024-09-06 22:38:55
Milking Grid
Time Limit: 3000MS | Memory Limit: 65536K | |
Total Submissions: 8314 | Accepted: 3586 |
Description
Every morning when they are milked, the Farmer John's cows form a rectangular grid that is R (1 <= R <= 10,000) rows by C (1 <= C <= 75) columns. As we all know, Farmer John is quite the expert on cow behavior, and is currently writing a book about feeding behavior in cows. He notices that if each cow is labeled with an uppercase letter indicating its breed, the two-dimensional pattern formed by his cows during milking sometimes seems to be made from smaller repeating rectangular patterns.
Help FJ find the rectangular unit of smallest area that can be repetitively tiled to make up the entire milking grid. Note that the dimensions of the small rectangular unit do not necessarily need to divide evenly the dimensions of the entire milking grid, as indicated in the sample input below.
Input
* Line 1: Two space-separated integers: R and C
* Lines 2..R+1: The grid that the cows form, with an uppercase letter denoting each cow's breed. Each of the R input lines has C characters with no space or other intervening character.
Output
* Line 1: The area of the smallest unit from which the grid is formed
Sample Input
2 5
ABABA
ABABA
Sample Output
2
Hint
The entire milking grid can be constructed from repetitions of the pattern 'AB'.
Source
思路:
每一列都给hash成一个值,然后横着kmp,找到最小循环节长度l1;
每一行都给hash成一个值,然后竖着kmp,找到最小循环节长度l2;
然后输出l1*l2;
劳资re十多次,才发现题目里面是多组数据;
然后又re十多次,看discuss才知道r和c的范围弄反了;
气人简直、、、
来,上代码:
#include <cstdio>
#include <cstring>
#include <iostream> #define che 39
#define mod 100000009LL
#define mod1 100000007LL
#define mod2 13000007LL using namespace std; int next[],next_[],r,c,ans; long long t[],p[]; char ch[]; int main()
{
while(scanf("%d%d",&r,&c)==)
{
memset(t,,sizeof(t));
memset(p,,sizeof(p));
memset(next,,sizeof(next));
memset(next_,,sizeof(next_));
for(int i=;i<=r;i++)
{
cin>>ch;
for(int j=;j<c;j++)
{
t[j+]=((t[j+]*che)%mod+((ch[j]-'')*che))%mod1;
p[i]=((p[i]*che)%mod+((ch[j]-'')*che))%mod2;
}
}
int i=,j=;next[]=-;
while(j<=c)
{
if(i==||t[i]==t[j]) next[j++]=i++;
else i=next[i-]+;
}
i=,j=,next_[]=-;
while(j<=r)
{
if(i==||p[i]==p[j]) next_[j++]=i++;
else i=next_[i-]+;
}
ans=(c-next[c])*(r-next_[r]);
cout<<ans;
putchar('\n');
}
return ;
}
最新文章
- 使用git命令提交远程github仓库的时候提示";rejected";(拒绝)解决办法
- 20145210 《Java程序设计》第十周学习总结
- LINUX 性能 测试 优化工具
- 【转】Java 集合系列03之 ArrayList详细介绍(源码解析)和使用示例
- asp.net微信开发第三篇----自定义会话管理
- Windows Phone开发(47):轻松调用Web Service
- C#模板打印excel
- java线程池的创建使用
- 写个重新加载 ocelot 配置的接口
- npm 安装cnpm淘宝镜像时报错解决
- P1256 显示图像(广搜)
- 20172302 《Java软件结构与数据结构》第六周学习总结
- 整数m去掉n位后剩下最大(小)值
- ELK学习博客
- canvas绘画基础(一):认识canvas画布
- testbench的设计 文件读取和写入操作 源代码
- php 统计fasta 序列长度和GC含量
- 7.2 Models -- Defining Models
- andorid 反编译
- 绑定内网和安全redis和mongo以及MQ