301667: CF316F2. Suns and Rays

Memory Limit:256 MB Time Limit:3 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

Suns and Rays

题目描述

Smart Beaver became interested in drawing. He draws suns. However, at some point, Smart Beaver realized that simply drawing suns is boring. So he decided to design a program that will process his drawings. You are given a picture drawn by the beaver. It will have two colors: one for the background and one for the suns in the image. Your task will be to count the number of suns in the image and for each of them to count the number of rays. Sun is arbitrarily rotated ellipse with rays. Ray is a segment which connects point on boundary of the ellipse with some point outside ellipse. ![](https://cdn.luogu.com.cn/upload/vjudge_pic/CF316F2/8ef6efd54b49cd419c0fbfa7509d8e57e90b4992.png) An image where all suns are circles. ![](https://cdn.luogu.com.cn/upload/vjudge_pic/CF316F2/05cd1ccc0c65679002e399651f00f7f18dd13325.png) An image where all suns are ellipses, their axes are parallel to the coordinate axes. ![](https://cdn.luogu.com.cn/upload/vjudge_pic/CF316F2/0f0edab021211a24cea86225fbd5f9e361b8882d.png) An image where all suns are rotated ellipses. It is guaranteed that: - No two suns have common points. - The rays’ width is $ 3 $ pixels. - The lengths of the ellipsis suns’ axes will lie between $ 40 $ and $ 200 $ pixels. - No two rays intersect. - The lengths of all rays will lie between $ 10 $ and $ 30 $ pixels.

输入输出格式

输入格式


The first line contains two integers $ h $ and $ w $ — the height and width of the image ( $ 1<=h,w<=1600 $ ). Next $ h $ lines will contain $ w $ space-separated integers each. They describe Smart Beaver’s picture. Each number equals either a $ 0 $ (the image background), or a $ 1 $ (the sun color). The input limits for scoring 30 points are (subproblem F1): - All suns on the image are circles. The input limits for scoring 70 points are (subproblems F1+F2): - All suns on the image are ellipses with axes parallel to the coordinate axes. The input limits for scoring 100 points are (subproblems F1+F2+F3): - All suns on the image are ellipses, they can be arbitrarily rotated.

输出格式


The first line must contain a single number $ k $ — the number of suns on the beaver’s image. The second line must contain exactly $ k $ space-separated integers, corresponding to the number of rays on each sun. The numbers of the second line must be sorted in the increasing order.

输入输出样例

暂无测试点

说明

For each complexity level you are suggested a sample in the initial data. You can download the samples at http://www.abbyy.ru/sun.zip.

Input

题意翻译

## 题目翻译 聪明的海狸开始对绘画感兴趣。他画太阳。但是,在某个时候,聪明的海狸意识到仅仅画太阳是无聊的。所以他决定设计一个可以处理他的绘画的程序。你给出了一个海狸画的图片。它将有两种颜色:一个是背景,一个是图像中的太阳。你的任务是统计图像中的太阳数量,并为每个太阳计算光线的数量。 太阳是任意旋转的椭圆形带有光线。光线是连接椭圆形的边界上的点与椭圆形外部某个点的线段。 ![](https://cdn.luogu.com.cn/upload/vjudge_pic/CF316F2/8ef6efd54b49cd419c0fbfa7509d8e57e90b4992.png) 太阳都是圆的图片。 ![](https://cdn.luogu.com.cn/upload/vjudge_pic/CF316F2/05cd1ccc0c65679002e399651f00f7f18dd13325.png) 太阳都是椭圆的图片,它们的轴与坐标轴平行。 ![](https://cdn.luogu.com.cn/upload/vjudge_pic/CF316F2/0f0edab021211a24cea86225fbd5f9e361b8882d.png) 太阳都是旋转的椭圆形图片。保证: - 没有两个太阳有共同的点。 - 光线的宽度为 $ 3 $ 像素。 - 椭圆形太阳的轴长度在 $ 40 $ 和 $ 200 $ 像素之间。 - 没有两个光线相交。 - 所有光线的长度在 $ 10 $ 和 $ 30 $ 像素之间。 ## 输入格式 第一行包含两个整数 $ h $ 和 $ w $ —— 图像的高度和宽度 $(1 <= h, w <= 1600)$。接下来的 $ h $ 行将包含 $ w $ 个以空格分隔的整数。它们描述聪明的海狸的图片。每个数字都等于 $ 0 $ (图像背景) 或 $ 1 $ (太阳颜色)。 得分为 30 分的子任务输入限制为(subproblem F1): - 图像上的所有太阳都是圆的。 得分为 70 分的子任务输入限制为(subproblems F1+F2): - 图像上的所有太阳都是轴平行的椭圆形。 得分为 100 分的子任务输入限制为(subproblems F1+F2+F3): - 图像上的所有太阳都是椭圆形的,它们可以任意旋转。 ## 输出格式 第一行必须包含一个数字 $ k $——海狸图片上的太阳数量。第二行必须恰好包含 $ k $ 个以升序排列的整数,对应于每个太阳上的光线数。 ## 提示 对于每个复杂程度,您都建议在初始数据中提供一个示例。您可以在 http://www.abbyy.ru/sun.zip 下载这些样本。

加入题单

算法标签: