F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

Image Processing

Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 126    Accepted Submission(s): 4


Problem Description
According to Wikipedia, image processing is any form of signal processing for
which the input is an image, such as photographs or frames of video; the output of image processing can be either an image or a set of characteristics or parameters related to the image. Most image-processing techniques involve treating the image as a two-dimensional signal and applying standard signal-processing techniques to it.
The task you are facing here is a relatively easy one (compared to our general
conception of image processing!). Given a black-and-white image of size R * C with some digits (and possibly other shapes) on it, your program needs to figure out the digits written on the image. Specifically, the digits drawn on the graph will adhere to the following rules:
1) Digits are drawn with a series of strokes. A stroke can be regarded as a
rectangle of any size on the image, and its edges will always be parallel to
either x-axis or y-axis. The number of strokes required to draw each digit will
be exactly as follows:

Refer to Figure 2 if you¡¯re unclear about how the digits are drawn.
2) Although the width of strokes used to draw a digit might be different, the outer shapes of digits will strictly follow those specified in Figure 2.
3) In order for a digit to be recognizable, all parts (strokes and joints) presented in the graph below must also be clearly distinguishable in the image.
(Refer to the last sample test case if you are unsure about this requirement;
in that test case, when the middle stroke of 2 is omitted, the number should
not be considered as recognizable.)
4) You may assume that the image is not rotated, and there is no noise in the input.

Please output the sum of digits recognizable in the graph. In the case that no
characters is recognizable, please output 0 instead.
 

Input
There are multiple test cases in the input file.
Each test case starts with two integers, R and C ( 1 ¡Ü R,C ¡Ü 500), specifying the number of rows / columns of the graph. Each of the following R lines contains consecutive C characters (¡®0¡¯ or ¡®1¡¯), describing the image to be processed.
Two successive test cases are separated by a blank line. A case with R = 0, C = 0 indicates the end of the input file, and should not be processed by your program.
 

Output
For each test case, please print a single integer, the sum of recognizable numbers.
 

Sample Input
5 12 001101011111 000101000011 000101001111 001101000011 000000000111 5 3 111 010 110 010 110 6 14 11111000011111 11001000000011 11111001000000 11111001001110 11001011001010 11111000001110 5 2 11 01 11 01 11 6 9 111100111 000100001 000100011 011100010 010000011 011110000 0 0
 

Sample Output
Case #1: 4 Case #2: 0 Case #3: 15 Case #4: 3 Case #5: 2
 

Source
 

Statistic | Submit | Discuss | Note
Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-11-26 20:13:37, Gzip enabled