codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

22B.md (1476B)


      1 Source: https://codeforces.com/problemset/problem/22/B
      2 
      3 B. Bargaining Table
      4 
      5 time limit per test
      6 
      7 2 seconds
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 stdin
     16 
     17 output
     18 
     19 stdout
     20 
     21 Bob wants to put a new bargaining table in his office. To do so he measured the office room thoroughly and drew its plan: Bob's office room is a rectangular room *n* × *m* meters. Each square meter of the room is either occupied by some furniture, or free. A bargaining table is rectangular, and should be placed so, that its sides are parallel to the office walls. Bob doesn't want to change or rearrange anything, that's why all the squares that will be occupied by the table should be initially free. Bob wants the new table to sit as many people as possible, thus its perimeter should be maximal. Help Bob find out the maximum possible perimeter of a bargaining table for his office.
     22 
     23 Input
     24 
     25 The first line contains 2 space-separated numbers *n* and *m* (1 ≤ *n*, *m* ≤ 25) — the office room dimensions. Then there follow *n* lines with *m* characters 0 or 1 each. 0 stands for a free square meter of the office room. 1 stands for an occupied square meter. It's guaranteed that at least one square meter in the room is free.
     26 
     27 Output
     28 
     29 Output one number — the maximum possible perimeter of a bargaining table for Bob's office room.
     30 
     31 Examples
     32 
     33 Input
     34 
     35 ```
     36 3 3  
     37 000  
     38 010  
     39 000
     40 ```
     41 
     42 Output
     43 
     44 ```
     45 8
     46 ```
     47 
     48 Input
     49 
     50 ```
     51 5 4  
     52 1100  
     53 0000  
     54 0000  
     55 0000  
     56 0000
     57 ```
     58 
     59 Output
     60 
     61 ```
     62 16
     63 ```