|
| 1 | +// BEGIN CUT HERE |
| 2 | + |
| 3 | +// END CUT HERE |
| 4 | +#include <algorithm> |
| 5 | +#include <iostream> |
| 6 | +#include <sstream> |
| 7 | +#include <string> |
| 8 | +#include <vector> |
| 9 | +#include <queue> |
| 10 | +#include <set> |
| 11 | +#include <map> |
| 12 | +#include <cstdio> |
| 13 | +#include <cstdlib> |
| 14 | +#include <cctype> |
| 15 | +#include <cmath> |
| 16 | +#include <string> |
| 17 | +#include <cstring> |
| 18 | +using namespace std; |
| 19 | + |
| 20 | +// BEGIN CUT HERE |
| 21 | +#define ARRSIZE(x) (sizeof(x)/sizeof(x[0])) |
| 22 | + |
| 23 | +template<typename T> void print( T a ) { |
| 24 | + cerr << a; |
| 25 | +} |
| 26 | +static void print( long long a ) { |
| 27 | + cerr << a << "L"; |
| 28 | +} |
| 29 | +static void print( string a ) { |
| 30 | + cerr << '"' << a << '"'; |
| 31 | +} |
| 32 | +template<typename T> void print( vector<T> a ) { |
| 33 | + cerr << "{"; |
| 34 | + for ( int i = 0 ; i != a.size() ; i++ ) { |
| 35 | + if ( i != 0 ) cerr << ", "; |
| 36 | + print( a[i] ); |
| 37 | + } |
| 38 | + cerr << "}" << endl; |
| 39 | +} |
| 40 | +template<typename T> void eq( int n, T have, T need ) { |
| 41 | + if ( have == need ) { |
| 42 | + cerr << "Case " << n << " passed." << endl; |
| 43 | + } else { |
| 44 | + cerr << "Case " << n << " failed: expected "; |
| 45 | + print( need ); |
| 46 | + cerr << " received "; |
| 47 | + print( have ); |
| 48 | + cerr << "." << endl; |
| 49 | + } |
| 50 | +} |
| 51 | +template<typename T> void eq( int n, vector<T> have, vector<T> need ) { |
| 52 | + if( have.size() != need.size() ) { |
| 53 | + cerr << "Case " << n << " failed: returned " << have.size() << " elements; expected " << need.size() << " elements."; |
| 54 | + print( have ); |
| 55 | + print( need ); |
| 56 | + return; |
| 57 | + } |
| 58 | + for( int i= 0; i < have.size(); i++ ) { |
| 59 | + if( have[i] != need[i] ) { |
| 60 | + cerr << "Case " << n << " failed. Expected and returned array differ in position " << i << "."; |
| 61 | + print( have ); |
| 62 | + print( need ); |
| 63 | + return; |
| 64 | + } |
| 65 | + } |
| 66 | + cerr << "Case " << n << " passed." << endl; |
| 67 | +} |
| 68 | +static void eq( int n, string have, string need ) { |
| 69 | + if ( have == need ) { |
| 70 | + cerr << "Case " << n << " passed." << endl; |
| 71 | + } else { |
| 72 | + cerr << "Case " << n << " failed: expected "; |
| 73 | + print( need ); |
| 74 | + cerr << " received "; |
| 75 | + print( have ); |
| 76 | + cerr << "." << endl; |
| 77 | + } |
| 78 | +} |
| 79 | +// END CUT HERE |
| 80 | + |
| 81 | +#define REP(i,n) for(int i=0;i<(n);++i) |
| 82 | +#define FOR(i,a,b) for(int i=(a);i<=(b);++i) |
| 83 | +#define RFOR(i,a,b) for(int i=(a);i>=(b);--i) |
| 84 | +#define FOREACH(it,c) for(typeof((c).begin())it=(c).begin();it!=(c).end();++it) |
| 85 | +#define CLR(x) memset((x),0,sizeof((x))) |
| 86 | +typedef long long LL; |
| 87 | +typedef vector<int> VI; |
| 88 | +typedef vector<string> VS; |
| 89 | + |
| 90 | +// BEGIN CUT HERE |
| 91 | +vector<string> split( const string& s, const string& delim =" " ) { |
| 92 | + vector<string> res; |
| 93 | + string t; |
| 94 | + for ( int i = 0 ; i != s.size() ; i++ ) { |
| 95 | + if ( delim.find( s[i] ) != string::npos ) { |
| 96 | + if ( !t.empty() ) { |
| 97 | + res.push_back( t ); |
| 98 | + t = ""; |
| 99 | + } |
| 100 | + } else { |
| 101 | + t += s[i]; |
| 102 | + } |
| 103 | + } |
| 104 | + if ( !t.empty() ) { |
| 105 | + res.push_back(t); |
| 106 | + } |
| 107 | + return res; |
| 108 | +} |
| 109 | + |
| 110 | +vector<int> splitInt( const string& s, const string& delim =" " ) { |
| 111 | + vector<string> tok = split( s, delim ); |
| 112 | + vector<int> res; |
| 113 | + for ( int i = 0 ; i != tok.size(); i++ ) |
| 114 | + res.push_back( atoi( tok[i].c_str() ) ); |
| 115 | + return res; |
| 116 | +} |
| 117 | +// END CUT HERE |
| 118 | + |
| 119 | +// BEGIN CUT HERE |
| 120 | +int s2i(string s) { |
| 121 | + stringstream ss; |
| 122 | + ss << s; |
| 123 | + int res; |
| 124 | + ss >> res; |
| 125 | + return res; |
| 126 | +} |
| 127 | + |
| 128 | +string i2s(int n) { |
| 129 | + stringstream ss; |
| 130 | + ss << n; |
| 131 | + string res; |
| 132 | + ss >> res; |
| 133 | + return res; |
| 134 | +} |
| 135 | +// END CUT HERE |
| 136 | +int mm[55][2][2][2]; |
| 137 | +int state[55]; |
| 138 | +int n; |
| 139 | + |
| 140 | +class EllysLamps { |
| 141 | +public: |
| 142 | + int dp(int idx, int lit, int addU, int addN) { |
| 143 | + int& ret = mm[idx][lit][addU][addN]; |
| 144 | + if (ret != -1) return ret; |
| 145 | + |
| 146 | + if (idx == n - 1) return min(lit + addN, !lit + addU); |
| 147 | + |
| 148 | + ret = 0; |
| 149 | + REP(lt,2) { |
| 150 | + REP(rt,2) { |
| 151 | + int t1 = dp(idx + 1, state[idx + 1] ^ rt, lit ^ lt ^ 1, lit ^ 1) + addU; |
| 152 | + int t2 = dp(idx + 1, state[idx + 1], lit ^ lt, lit) + addN; |
| 153 | + ret = max(ret, min(t1, t2)); |
| 154 | + } |
| 155 | + } |
| 156 | + |
| 157 | + return ret; |
| 158 | + } |
| 159 | + int getMin(string lamps) { |
| 160 | + n = lamps.length(); |
| 161 | + REP(i,n) state[i] = lamps[i] == 'Y'; |
| 162 | + memset(mm, -1, sizeof(mm)); |
| 163 | + int res = dp(0, state[0], 0, 0); |
| 164 | + return res; |
| 165 | + } |
| 166 | +}; |
| 167 | +// BEGIN CUT HERE |
| 168 | +int main() { |
| 169 | + { |
| 170 | + EllysLamps theObject; |
| 171 | + eq(0, theObject.getMin("YNNYN"),2); |
| 172 | + } |
| 173 | + { |
| 174 | + EllysLamps theObject; |
| 175 | + eq(1, theObject.getMin("NNN"),0); |
| 176 | + } |
| 177 | + { |
| 178 | + EllysLamps theObject; |
| 179 | + eq(2, theObject.getMin("YY"),0); |
| 180 | + } |
| 181 | + { |
| 182 | + EllysLamps theObject; |
| 183 | + eq(3, theObject.getMin("YNYYYNNNY"),3); |
| 184 | + } |
| 185 | + { |
| 186 | + EllysLamps theObject; |
| 187 | + eq(4, theObject.getMin("YNYYYYNYNNYYNNNNNNYNYNYNYNNYNYYYNY"),13); |
| 188 | + } |
| 189 | + return 0; |
| 190 | +} |
| 191 | +// END CUT HERE |
0 commit comments