{\rtf1\ansi\ansicpg1252\cocoartf949\cocoasubrtf540
{\fonttbl\f0\fnil\fcharset0 Consolas;\f1\fnil\fcharset0 Consolas-Bold;}
{\colortbl;\red255\green255\blue255;\red255\green255\blue255;\red128\green128\blue128;\red43\green101\blue150;
\red12\green22\blue249;\red53\green127\blue16;\red225\green43\blue148;}
\margl1440\margr1440\vieww9000\viewh8400\viewkind0
\deftab720
\pard\pardeftab720\sl260
\f0\fs24 \cf0 \cb2 /* UvA 639 - Don't Get Rooked\
Randall Head */\
\'a0\
\pard\pardeftab720\sl260
\cf3 #include <iostream>\cf0 \
\cf3 #include <cstdio>\cf0 \
\cf3 #include <algorithm>\cf0 \
\cf3 #include <cstring>\cf0 \
\cf3 #include <string>\cf0 \
\cf3 #include <cctype>\cf0 \
\cf3 #include <stack>\cf0 \
\cf3 #include <queue>\cf0 \
\cf3 #include <list>\cf0 \
\cf3 #include <vector>\cf0 \
\cf3 #include <map>\cf0 \
\cf3 #include <sstream>\cf0 \
\cf3 #include <cmath>\cf0 \
\cf3 #include <bitset>\cf0 \
\cf3 #include <utility>\cf0 \
\cf3 #include <set>\cf0 \
\cf3 #include <numeric>\cf0 \
\cf3 #define INT_MAX 2147483647\cf0 \
\cf3 #define INT_MIN -2147483647\cf0 \
\cf3 #define pi acos(-1.0)\cf0 \
\cf3 #define N 1000000\cf0 \
\cf3 #define LL unsigned long long\cf0 \
\pard\pardeftab720\sl260
\f1\b \cf4 using
\f0\b0 \cf0
\f1\b \cf4 namespace
\f0\b0 \cf0 std;\
\'a0\
\pard\pardeftab720\sl260
\f1\b \cf3 char
\f0\b0 \cf0 a [4 + 3] [4 + 3];\
\f1\b \cf3 int
\f0\b0 \cf0 f [4 + 3] [4 + 3];\
\f1\b \cf3 int
\f0\b0 \cf0 n;\
\'a0\
\f1\b \cf3 int
\f0\b0 \cf0 bktk (
\f1\b \cf3 int
\f0\b0 \cf0 rook)\
\{\
\'a0\'a0\'a0\'a0
\f1\b \cf3 int
\f0\b0 \cf0 ret = rook;\
\'a0\
\'a0\'a0\'a0\'a0
\f1\b \cf4 for
\f0\b0 \cf0 (
\f1\b \cf3 int
\f0\b0 \cf0 i = 0; i < n; i++ ) \{\
\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0
\f1\b \cf4 for
\f0\b0 \cf0 (
\f1\b \cf3 int
\f0\b0 \cf0 j = 0; j < n; j++ ) \{\
\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0
\f1\b \cf4 if
\f0\b0 \cf0 ( f [i] [j] == 0 ) \{\
\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0
\f1\b \cf4 for
\f0\b0 \cf0 (
\f1\b \cf3 int
\f0\b0 \cf0 k = j; k >= 0 && a [i] [k] != \cf5 'X'\cf0 ; k-- ) \cf6 // < current row\cf0 \
\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0f [i] [k]++;\
\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0
\f1\b \cf4 for
\f0\b0 \cf0 (
\f1\b \cf3 int
\f0\b0 \cf0 k = j + 1; k < n && a [i] [k] != \cf5 'X'\cf0 ; k++ ) \cf6 // current row >\cf0 \
\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0f [i] [k]++;\
\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0
\f1\b \cf4 for
\f0\b0 \cf0 (
\f1\b \cf3 int
\f0\b0 \cf0 k = i - 1; k >= 0 && a [k] [j] != \cf5 'X'\cf0 ; k-- ) \cf6 // current col ^\cf0 \
\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0f [k] [j]++;\
\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0
\f1\b \cf4 for
\f0\b0 \cf0 (
\f1\b \cf3 int
\f0\b0 \cf0 k = i + 1; k < n && a [k] [j] != \cf5 'X'\cf0 ; k++ ) \cf6 // current col\cf0 \
\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0f [k] [j]++;\
\'a0\
\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0
\f1\b \cf3 int
\f0\b0 \cf0 val = bktk (rook + 1);\
\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0
\f1\b \cf4 if
\f0\b0 \cf0 ( val > ret ) ret = val;\
\'a0\
\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0
\f1\b \cf4 for
\f0\b0 \cf0 (
\f1\b \cf3 int
\f0\b0 \cf0 k = j; k >= 0 && a [i] [k] != \cf5 'X'\cf0 ; k-- ) \cf6 // < current row\cf0 \
\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0f [i] [k]--;\
\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0
\f1\b \cf4 for
\f0\b0 \cf0 (
\f1\b \cf3 int
\f0\b0 \cf0 k = j + 1; k < n && a [i] [k] != \cf5 'X'\cf0 ; k++ ) \cf6 // current row >\cf0 \
\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0f [i] [k]--;\
\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0
\f1\b \cf4 for
\f0\b0 \cf0 (
\f1\b \cf3 int
\f0\b0 \cf0 k = i - 1; k >= 0 && a [k] [j] != \cf5 'X'\cf0 ; k-- ) \cf6 // current col ^\cf0 \
\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0f [k] [j]--;\
\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0
\f1\b \cf4 for
\f0\b0 \cf0 (
\f1\b \cf3 int
\f0\b0 \cf0 k = i + 1; k < n && a [k] [j] != \cf5 'X'\cf0 ; k++ ) \cf6 // current col\cf0 \
\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0f [k] [j]--;\
\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\}\
\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\}\
\'a0\'a0\'a0\'a0\}\
\'a0\
\'a0\'a0\'a0\'a0
\f1\b \cf4 return
\f0\b0 \cf0 ret;\
\}\
\'a0\
\f1\b \cf3 int
\f0\b0 \cf0 main ()\
\{\
\'a0\'a0\'a0\'a0
\f1\b \cf4 while
\f0\b0 \cf0 (
\f1\b \cf7 scanf
\f0\b0 \cf0 (\cf5 "%d"\cf0 , &n) && n ) \{\
\'a0\
\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0
\f1\b \cf4 for
\f0\b0 \cf0 (
\f1\b \cf3 int
\f0\b0 \cf0 i = 0; i < n; i++ )
\f1\b \cf7 scanf
\f0\b0 \cf0 (\cf5 "%s"\cf0 , a [i]);\
\'a0\
\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0
\f1\b \cf7 memset
\f0\b0 \cf0 (f, 0,
\f1\b \cf4 sizeof
\f0\b0 \cf0 (f));\
\'a0\
\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0
\f1\b \cf4 for
\f0\b0 \cf0 (
\f1\b \cf3 int
\f0\b0 \cf0 i = 0; i < n; i++ ) \{\
\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0
\f1\b \cf4 for
\f0\b0 \cf0 (
\f1\b \cf3 int
\f0\b0 \cf0 j = 0; j < n; j++ )\
\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0
\f1\b \cf4 if
\f0\b0 \cf0 ( a [i] [j] == \cf5 'X'\cf0 ) f [i] [j] = N;\
\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0\}\
\'a0\
\'a0\'a0\'a0\'a0\'a0\'a0\'a0\'a0
\f1\b \cf7 printf
\f0\b0 \cf0 (\cf5 "%d\\n"\cf0 , bktk (0));\
\'a0\'a0\'a0\'a0\}\
\'a0\
\'a0\'a0\'a0\'a0
\f1\b \cf4 return
\f0\b0 \cf0 0;\
\}\
\'a0\
\
}
The statements and opinions included in these pages are those of only. Any statements and
opinions included in these pages are not those of Louisiana
State University or the LSU Board of Supervisors.
© 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013, 2014