Pagini recente » Cod sursa (job #1894123) | Cod sursa (job #2979363) | Cod sursa (job #1191620) | Cod sursa (job #1605167) | Cod sursa (job #2851652)
#include <bits/stdc++.h>
using namespace std;
class Matcher {
int n, m;
vector <int> l, r;
vector <bool> upd;
vector <vector <int>> g;
vector <bool> isOn1, isOn2;
inline bool pairup(int u) {
if(upd[u]) return false;
upd[u] = true;
for(int v : g[u]) if(!l[v])
return l[r[u] = v] = u;
for(int v : g[u]) if(pairup(l[v]))
return l[r[u] = v] = u;
return false;
}
void fill01(int u) {
for(int v : g[u]) if(isOn2[v]) {
isOn2[v] = true;
fill01(l[v]);
}
}
inline bool is_matched(int u) { return l[r[u]] == u; }
public:
Matcher(int n, int m) : n(n), m(m), l(m + 1), r(n + 1), upd(n + 1), g(n + 1), isOn1(n + 1, true), isOn2(m + 1, true) {}
void add_edge(int u, int v) { g[u].push_back(v); }
vector <pair <int, int>> match() {
for(bool ok = true; ok; ) {
ok = false;
fill(upd.begin(), upd.end(), false);
for(int i = 1; i <= n; i++) if(!r[i])
ok |= pairup(i);
}
vector <pair <int, int>> sol;
for(int i = 1; i <= n; i++)
if(is_matched(i)) {
isOn1[i] = false;
sol.emplace_back(i, r[i]);
}
return sol;
}
void flood() {
for(int i = 1; i <= n; i++) if(!is_matched(i))
fill01(i);
}
pair <int, vector <int>> get_light_map() {
int ans = 0;
vector <int> sol;
for(int i = 1; i <= n; i++) {
int val = isOn1[i] | (isOn2[i] << 1);
sol.push_back(val);
ans += isOn1[i] + isOn2[i];
}
return {ans, sol};
}
};
int main()
{
ifstream cin("felinare.in");
ofstream cout("felinare.out");
int n, m, u, v;
cin >> n >> m;
Matcher M(n, m);
for(int i = 1; i <= m; i++)
cin >> u >> v,
M.add_edge(u, v);
M.match();
M.flood();
auto [ans, sol] = M.get_light_map();
cout << ans << "\n";
for(int x : sol)
cout << x << "\n";
return 0;
}