-
Notifications
You must be signed in to change notification settings - Fork 5
/
Copy pathEllysFigurines.cpp
161 lines (137 loc) · 3.37 KB
/
EllysFigurines.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
// BEGIN CUT HERE
/*
TCO13 Round 1B Medium (500)
問題
-グリッド上のボードにいくつかの人形が置かれている
-一回の操作で、連続するR行またはC列の人形を取り除くことができる
-最小の操作回数を求める
*/
// END CUT HERE
#include <algorithm>
#include <string>
#include <vector>
#include <iostream>
#include <sstream>
using namespace std;
class EllysFigurines {
public:
int getMoves(vector <string> board, int R, int C) {
int ans = 2000000000;
int i, j;
int H = (int)board.size();
int W = (int)board[0].length();
int d[16] = {};
for (i = 0; i < H; ++i) {
for (j = 0; j < W; ++j) {
if (board[i][j] != '.') {
d[i] |= (1<<j);
}
}
}
int m = 1 << W;
for (int b = 0; b < m; ++b) {
int cnt = 0;
for (i = 0; i < W; ++i) {
if ((1<<i) & b) {
++cnt;
i += C - 1;
}
}
for (i = 0; i < H; ++i) {
if (d[i] & ~b) {
++cnt;
i += R - 1;
}
}
ans = min(ans, cnt);
}
return ans;
}
// BEGIN CUT HERE
private:
template <typename T> string print_array(const vector<T> &V) { ostringstream os; os << "{ "; for (typename vector<T>::const_iterator iter = V.begin(); iter != V.end(); ++iter) os << '\"' << *iter << "\","; os << " }"; return os.str(); }
void verify_case(int Case, const int &Expected, const int &Received) { cerr << "Test Case #" << Case << "..."; if (Expected == Received) cerr << "PASSED" << endl; else { cerr << "FAILED" << endl; cerr << "\tExpected: \"" << Expected << '\"' << endl; cerr << "\tReceived: \"" << Received << '\"' << endl; } }
public:
void run_test(int Case) {
int n = 0;
// test_case_0
if ((Case == -1) || (Case == n)){
string Arr0[] = {".X.X.",
"XX..X",
".XXX.",
"...X.",
".X.XX"};
int Arg1 = 1;
int Arg2 = 2;
int Arg3 = 3;
vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
verify_case(n, Arg3, getMoves(Arg0, Arg1, Arg2));
}
n++;
// test_case_1
if ((Case == -1) || (Case == n)){
string Arr0[] = {".X.X.",
"XX..X",
".X.X.",
"...X.",
".X.XX"};
int Arg1 = 2;
int Arg2 = 2;
int Arg3 = 2;
vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
verify_case(n, Arg3, getMoves(Arg0, Arg1, Arg2));
}
n++;
// test_case_2
if ((Case == -1) || (Case == n)){
string Arr0[] = {"XXXXXXX"};
int Arg1 = 2;
int Arg2 = 3;
int Arg3 = 1;
vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
verify_case(n, Arg3, getMoves(Arg0, Arg1, Arg2));
}
n++;
// test_case_3
if ((Case == -1) || (Case == n)){
string Arr0[] = {"XXXXX",
"X....",
"XXX..",
"X....",
"XXXXX"};
int Arg1 = 1;
int Arg2 = 1;
int Arg3 = 4;
vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
verify_case(n, Arg3, getMoves(Arg0, Arg1, Arg2));
}
n++;
// test_case_4
if ((Case == -1) || (Case == n)){
string Arr0[] = {"XXX..XXX..XXX.",
".X..X....X...X",
".X..X....X...X",
".X..X....X...X",
".X...XXX..XXX.",
"..............",
"...XX...XXX...",
"....X......X..",
"....X....XXX..",
"....X......X..",
"...XXX..XXX..."};
int Arg1 = 1;
int Arg2 = 2;
int Arg3 = 7;
vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
verify_case(n, Arg3, getMoves(Arg0, Arg1, Arg2));
}
n++;
}
// END CUT HERE
};
// BEGIN CUT HERE
int main() {
EllysFigurines ___test;
___test.run_test(-1);
}
// END CUT HERE