[3_3_range] counting square numbers
来源:互联网 发布:吉祥兔源码 编辑:程序博客网 时间:2024/05/17 21:41
Farmer John grazes his cows on a large, square field N (2 <= N <= 250) miles on a side (because, for some reason, his cows will only graze on precisely square land segments). Regrettably, the cows have ravaged some of the land (always in 1 mile square increments). FJ needs to map the remaining squares (at least 2x2 on a side) on which his cows can graze (in these larger squares, no 1x1 mile segments are ravaged).
Your task is to count up all the various square grazing areas within the supplied dataset and report the number of square grazing areas (of sizes >= 2x2) remaining. Of course, grazing areas may overlap for purposes of this report.
PROGRAM NAME: range
INPUT FORMAT
Line 1:N, the number of miles on each side of the field.Line 2..N+1:N characters with no spaces. 0 represents "ravaged for that block; 1 represents "ready to eat".SAMPLE INPUT (file range.in)
6101111001111111111001111101101111001
OUTPUT FORMAT
Potentially several lines with the size of the square and the number of such squares that exist. Order them in ascending order from smallest to largest size.
SAMPLE OUTPUT (file range.out)
2 103 44 1
Enumeration method:
#include <cstdio>int g[300][300],b[300][300],c[300];int main(){ freopen("range.in","r",stdin); freopen("range.out","w",stdout); int n; scanf("%d",&n); for(int i=1;i<=n;++i) { char buf[1000]; scanf("%s",buf); for(int j=1;j<=n;++j) g[i][j]=buf[j-1]-'0'; } for(int i=1;i<=n;++i) for(int j=1;j<=n;++j) b[i][j]=b[i-1][j]+b[i][j-1]-b[i-1][j-1]+g[i][j]; for(int i=2;i<=n;++i) for(int j=2;j<=n;++j) { int k=2; while(i>=k && j>=k) { if(b[i][j]+b[i-k][j-k]-b[i-k][j]-b[i][j-k]==k*k) ++c[k]; ++k; } } for(int i=2;i<=n;++i) if(c[i]>0) printf("%d %d\n",i,c[i]); return 0;}
Dynamic Programming method:
To count the squares, we first precompute the biggest square with lower right corner at any particular location. This is done by dynamic programming: the biggest square with lower right corner at (i, j) is the minimum of three numbers:
- the number of consecutive uneaten grid units to the left
- the number of consecutive uneaten grid units to the right
- one plus the size of the biggest square with lower right corner at (i-1, j-1)
Once we've computed this information, counting squares is simple: go to each lower right corner and increment the counters for every square size between 2 and the biggest square ending at that corner.
#include <stdio.h>#include <stdlib.h>#include <string.h>#include <assert.h>#define MAXN 250int goodsq[MAXN][MAXN];int bigsq[MAXN][MAXN];int tot[MAXN+1];intmin(int a, int b){ return a < b ? a : b;}voidmain(void){ FILE *fin, *fout; int i, j, k, l, n, sz; fin = fopen("range.in", "r"); fout = fopen("range.out", "w"); assert(fin != NULL && fout != NULL); fscanf(fin, "%d\n", &n); for(i=0; i<n; i++) {for(j=0; j<n; j++) goodsq[i][j] = (getc(fin) == '1');assert(getc(fin) == '\n'); } /* calculate size of biggest square with lower right corner (i,j) */ for(i=0; i<n; i++) {for(j=0; j<n; j++) { for(k=i; k>=0; k--)if(goodsq[k][j] == 0) break; for(l=j; l>=0; l--)if(goodsq[i][l] == 0) break; sz = min(i-k, j-l); if(i > 0 && j > 0)sz = min(sz, bigsq[i-1][j-1]+1); bigsq[i][j] = sz;} } /* now just count squares */ for(i=0; i<n; i++) for(j=0; j<n; j++) for(k=2; k<=bigsq[i][j]; k++)tot[k]++; for(i=2; i<=n; i++)if(tot[i]) fprintf(fout, "%d %d\n", i, tot[i]); exit(0);}
Greg Price writes:
The posted solution runs in cubic time, with quadratic storage. With a little more cleverness in the dynamic programming, the task can be accomplished with only quadratic time and linear storage, and the same amount of code and coding effort. Instead of running back along the rows and columns from each square, we use the biggest-square values immediately to the west and north, so that each non-ravaged square's biggest-square value is one more than the minimum of the values to the west, north, and northwest. This saves time, bringing us from cubic to quadratic time.
Another improvement, which saves space and perhaps cleans up the code marginally, is to keep track of the number of squares of a given size as we go along. This obviates the need to keep a quadratic-size matrix of biggest-square values, because we only need the most recent row for continuing the computation. As for "ravaged" values, we only use each one once, all in order; we can just read those as we need them.
#include <fstream.h>ifstream fin("range.in");ofstream fout("range.out");const unsigned short maxn = 250 + 5;unsigned short n;char fieldpr;unsigned short sq[maxn]; // biggest-square valuesunsigned short sqpr;unsigned short numsq[maxn]; // number of squares of each sizeunsigned shortmin3(unsigned short a, unsigned short b, unsigned short c){if ((a <= b) && (a <= c))return a;else return (b <= c) ? b : c;}voidmain(){unsigned short r, c;unsigned short i;unsigned short tmp;fin >> n;for (c = 1; c <= n; c++)sq[c] = 0;for (i = 2; i <= n; i++)numsq[i] = 0;for (r = 1; r <= n; r++){sqpr = 0;sq[0] = 0;for (c = 1; c <= n; c++){fin >> fieldpr;if (!(fieldpr - '0')){sqpr = sq[c];sq[c] = 0;continue;}// Only three values needed.tmp = 1 + min3(sq[c-1], sqpr, sq[c]);sqpr = sq[c];sq[c] = tmp;// Only count maximal squares, for now.if (sq[c] >= 2)numsq[ sq[c] ]++;}}// Count all squares, not just maximal. for (i = n-1; i >= 2; i--)numsq[i] += numsq[i+1];for (i = 2; i <= n && numsq[i]; i++)fout << i << ' ' << numsq[i] << endl;}
- [3_3_range] counting square numbers
- Square Numbers(Square Numbers)
- HDU 2483 Counting square
- Sicily 1918. Counting square
- BNU - Square-Free Numbers
- UVa 11461 - Square Numbers
- uva 11461 Square Numbers
- Uva11461 Square Numbers
- UVA - 11461 Square Numbers
- UVA11461- Square Numbers
- UVa 11461 - Square Numbers
- UVA 11461-Square Numbers
- uva 11461Square Numbers
- Sum of Square Numbers
- hdu 2483 Counting square 枚举
- 南邮 OJ 1613 Counting square
- Kickstart 2017 A. Square Counting
- UVa OJ 11461-Square Numbers
- 无法打开包括文件:“CCApplication.h”: No such file or directory
- 备份
- 设计模式与架构设计的资料收藏
- SWT/Jface TreeViewer 获取展开节点元素集合
- Android应用开发——系统自带样式Android:theme
- [3_3_range] counting square numbers
- 判断一个自然数是否是某个数的平方。当然不能使用开方运算—谷歌
- SVN 服务器 与 客户端 配置搭建
- ProEssentials第200例SimplePolar Chart极坐标图表,使用DLL单文档VC6.0实现
- 排序算法之快速排序
- centos 安装python2.7
- jQuery Tree 大全
- 【phpcms-v9】前台content模块中pc标签的调用说明
- SSL WTLS TLS DTLS PKCS