ural 1221. Malevich Strikes Back!

anmob303090

于 2015-10-19 21:18:00 发布

阅读量128

点赞数

原文链接：http://www.cnblogs.com/StupidBoy/p/4893068.html

版权

1221. Malevich Strikes Back!

Time limit: 1.0 second
Memory limit: 64 MB

After the greatest success of Malevich's "Black Square" the famous artist decided to create a new masterpiece. He took a large sheet of checked paper and filled some cells with black. After that he realized the picture to be too complicated. He was afraid, that people would not understand the sense of the painting. Thus, Malevich decided to cut out a smaller picture of the special form. It should be a black square with its sides parallel to the sides of the list. A white square rotated by 45 degrees should be placed inside the black square. The corners of the white square should lay on the sides of the black square. You can see an example of such picture on the figure.

The original paper size is N × N, 0 < N ≤ 100. Your program should help Malevich to find the largest figure corresponding to the pattern described above.

Input

The input contains several test cases. Each test case starts with the size of paper N. The following N lines of the test case describe the original painting: "1" denotes a black and "0" denotes a white cell. End of the input is marked by a zero value for N.

Output

Your program should output the size (i.e. the maximum width or height) of the largest figure, which Malevich would like to cut out. If no such figure exists, output "No solution".

Sample

input	output
6 1 1 0 1 1 0 1 0 0 0 1 1 0 0 0 0 0 0 1 0 0 0 1 1 1 1 0 1 1 1 0 1 1 1 1 1 4 1 0 0 1 0 0 0 0 0 0 0 0 1 0 0 1 0	5 No solution

Problem Author: Nikita Shamgunov
Problem Source: The Seventh Ural State University collegiate programming contest

Tags: dynamic programming ( hide tags for unsolved problems )

Difficulty: 432

题意：给出一个n*n的黑白染色的矩阵，如果有一个白色的斜着的（逆时针转45°）正方形，把这个正方形不成一个大的正方形，补上去的那部分都是黑色的话，就是合法的。

问最大的合法的白色正方形的斜边是多少？具体看样例。

分析：暴力枚举那个斜边，然后暴力判断。只有一个点不算正方形

  1 #include <cstdio>
  2 #include <cstring>
  3 #include <cstdlib>
  4 #include <cmath>
  5 #include <deque>
  6 #include <vector>
  7 #include <queue>
  8 #include <iostream>
  9 #include <algorithm>
 10 #include <map>
 11 #include <set>
 12 #include <ctime>
 13 using namespace std;
 14 typedef long long LL;
 15 typedef double DB;
 16 #define For(i, s, t) for(int i = (s); i <= (t); i++)
 17 #define Ford(i, s, t) for(int i = (s); i >= (t); i--)
 18 #define Rep(i, t) for(int i = (0); i < (t); i++)
 19 #define Repn(i, t) for(int i = ((t)-1); i >= (0); i--)
 20 #define rep(i, x, t) for(int i = (x); i < (t); i++)
 21 #define MIT (2147483647)
 22 #define INF (1000000001)
 23 #define MLL (1000000000000000001LL)
 24 #define sz(x) ((int) (x).size())
 25 #define clr(x, y) memset(x, y, sizeof(x))
 26 #define puf push_front
 27 #define pub push_back
 28 #define pof pop_front
 29 #define pob pop_back
 30 #define ft first
 31 #define sd second
 32 #define mk make_pair
 33 inline void SetIO(string Name) {
 34     string Input = Name+".in",
 35     Output = Name+".out";
 36     freopen(Input.c_str(), "r", stdin),
 37     freopen(Output.c_str(), "w", stdout);
 38 }
 39 
 40 inline int Getint() {
 41     int Ret = 0;
 42     char Ch = ' ';
 43     while(!(Ch >= '0' && Ch <= '9')) Ch = getchar();
 44     while(Ch >= '0' && Ch <= '9') {
 45         Ret = Ret*10+Ch-'0';
 46         Ch = getchar();
 47     }
 48     return Ret;
 49 }
 50 
 51 const int N = 110;
 52 int n, Map[N][N];
 53 
 54 inline void Solve();
 55 
 56 inline void Input() {
 57     while(~scanf("%d", &n) && n) {
 58         For(i, 1, n)
 59             For(j, 1, n) scanf("%d", &Map[i][j]);
 60         Solve();
 61     }
 62 }
 63 
 64 inline bool Check(int x, int y, int r) {
 65     r /= 2;
 66     if(x-r < 1 || x +r > n || y-r < 1 || y+r > n) return 0;
 67     For(j, y-r, y+r) {
 68         For(i, x-r, x-r+abs(j-y)-1)
 69             if(!Map[i][j]) return 0;
 70         For(i, x+r-abs(j-y)+1, x+r)
 71             if(!Map[i][j]) return 0;
 72         
 73         For(i, x-r+abs(j-y), x+r-abs(j-y))
 74             if(Map[i][j]) return 0;
 75     }
 76     return 1;
 77 }
 78 
 79 inline void Solve() {
 80     int m = n;
 81     bool Flag = 0;
 82     if(!(m&1)) m--;
 83     while(m >= 3) {
 84         For(i, 1, n) {
 85             For(j, 1, n)
 86                 if(!Map[i][j] && Check(i, j, m)) {
 87                     Flag = 1;
 88                     break;
 89                 }
 90             if(Flag) break;
 91         }
 92         if(Flag) break;
 93         m -= 2;
 94     }
 95     
 96     if(Flag) printf("%d\n", m);
 97     else puts("No solution");
 98 }
 99 
100 int main() {
101     #ifndef ONLINE_JUDGE 
102     SetIO("E");
103     #endif 
104     Input();
105     //Solve();
106     return 0;
107 }