-
Notifications
You must be signed in to change notification settings - Fork 5
/
Incubator.cpp
186 lines (152 loc) · 4.2 KB
/
Incubator.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
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
// BEGIN CUT HERE
/*
// SRM 557 Div1 Medium (550)
問題
インキュベーターが少女と契約する。
少女は契約すると魔法少女となり、自分が守りたい少女を守る。
誰かに守られた少女もまた、自分が守りたい少女を守る。
守られていない魔法少女の最大人数を求める。
*/
// END CUT HERE
#include <algorithm>
#include <string>
#include <vector>
#include <iostream>
#include <sstream>
using namespace std;
typedef vector<int> IntVec;
class Incubator {
// From The Programming Contest Challendge Book
IntVec G[100];
int match[100];
bool used[100];
void add_edge(int u, int v) {
G[u].push_back(v);
G[v].push_back(u);
}
bool dfs(int v) {
used[v] = true;
int i;
for (i = 0; i < (int)G[v].size(); ++i) {
int u = G[v][i];
int w = match[u];
if (w < 0 || !used[w] && dfs(w)) {
match[v] = u;
match[u] = v;
return true;
}
}
return false;
}
public:
int maxMagicalGirls(vector <string> love) {
int sz = (int)love.size();
// Warshall-Floyd Algorithm
int p[50][50] = {};
int i, j, k;
for (i = 0; i < sz; ++i) {
for (j = 0; j < sz; ++j) {
p[i][j] = love[i][j] == 'Y';
}
}
for (k = 0; k < sz; ++k) {
for (i = 0; i < sz; ++i) {
for (j = 0; j < sz; ++j) {
p[i][j] |= p[i][k] & p[k][j];
}
}
}
// Bipartite Matching
for (i = 0; i < 100; ++i) {
G[i].clear();
}
memset(match, -1, sizeof(match));
for (i = 0; i < sz; ++i) {
for (j = 0; j < sz; ++j) {
if (p[i][j]) {
add_edge(i, 50+j);
}
}
}
int cnt = 0;
for (i = 0; i < sz; ++i) {
if (match[i] < 0) {
memset(used, 0, sizeof(used));
cnt += dfs(i);
}
}
return sz - cnt;
}
// 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[] = {"NY","NN"};
int Arg1 = 1;
vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
verify_case(n, Arg1, maxMagicalGirls(Arg0));
}
n++;
// test_case_1
if ((Case == -1) || (Case == n)){
string Arr0[] = {"NYN", "NNY", "NNN"};
int Arg1 = 1;
vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
verify_case(n, Arg1, maxMagicalGirls(Arg0));
}
n++;
// test_case_2
if ((Case == -1) || (Case == n)){
string Arr0[] = {"NNYNN","NNYNN","NNNYY","NNNNN","NNNNN"};
int Arg1 = 2;
vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
verify_case(n, Arg1, maxMagicalGirls(Arg0));
}
n++;
// test_case_3
if ((Case == -1) || (Case == n)){
string Arr0[] = {"NNNNN","NYNNN","NYNYN","YNYNN","NNNNN"};
int Arg1 = 2;
vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
verify_case(n, Arg1, maxMagicalGirls(Arg0));
}
n++;
// test_case_4
if ((Case == -1) || (Case == n)){
string Arr0[] = {"NNNNN","NNNNN","NNNNN","NNNNN","NNNNN"};
int Arg1 = 5;
vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
verify_case(n, Arg1, maxMagicalGirls(Arg0));
}
n++;
// test_case_5
if ((Case == -1) || (Case == n)){
string Arr0[] = {"NNYNNNNN","NNNYNNNN","NNNNYNNN","NNYNNNNN","NNNNNYYN","NNNYNNNY","NNNNNNNN","NNNNNNNN"};
int Arg1 = 2;
vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
verify_case(n, Arg1, maxMagicalGirls(Arg0));
}
n++;
// test_case_6
if ((Case == -1) || (Case == n)){
string Arr0[] = {"Y"};
int Arg1 = 0;
vector <string> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0])));
verify_case(n, Arg1, maxMagicalGirls(Arg0));
}
n++;
}
// END CUT HERE
};
// BEGIN CUT HERE
int main() {
Incubator ___test;
___test.run_test(-1);
return 0;
}
// END CUT HERE