#line 1 "Contests/yukicoder_/6654/main.cpp" /* #define aclmodint */ /* #define aclsegtree */ /* #include */ /* using namespace atcoder; */ #include #include using namespace atcoder; #line 1 "library/me/template.cpp" #include using namespace std; #define REP(a,b) for(int a = 0;a < (int)(b);++a) #define FOR(i,a,b) for(ll i = a; i < (ll)(b); i++) #define ALL(a) (a).begin(),(a).end() #define END(a) { print(a); return; } #define DBG(a) { cerr << #a << ": "; dbg(a); } using VI = vector; using VVI = vector; using VVVI = vector; using ll = long long; using VL = vector; using VVL = vector; using VVVL = vector; using VD = vector; using VVD = vector; using VVVD = vector; using VS = vector; using VVS = vector; using VVVS = vector; using VC = vector; using VVC = vector; using VVVC = vector; using P = pair; using VP = vector

; using VVP = vector; using VVVP = vector; using LP = pair; using VLP = vector; using VVLP = vector; using VVVLP = vector; constexpr int INF = 1001001001; constexpr ll LINF = 1001001001001001001ll; constexpr int DX[] = {1, 0, -1, 0}; constexpr int DY[] = {0, 1, 0, -1}; #ifdef aclmodint using MI7 = modint1000000007; using V7 = vector; using VV7 = vector; using VVV7 = vector; using MI3 = modint998244353; using V3 = vector; using VV3 = vector; using VVV3 = vector; ostream &operator<<(ostream &os, const modint &x) { os << x.val(); return os; } ostream &operator<<(ostream &os, const MI3 &x) { os << x.val(); return os; } ostream &operator<<(ostream &os, const MI7 &x) { os << x.val(); return os; } istream &operator>>(istream &is, modint &x) { int y; is >> y; x = y; return is; } istream &operator>>(istream &is, MI3 &x) { int y; is >> y; x = y; return is; } istream &operator>>(istream &is, MI7 &x) { int y; is >> y; x = y; return is; } #endif void print() { cout << '\n'; } template void print(const T &t) { cout << t << '\n'; } template void print(const Head &head, const Tail &... tail) { cout << head << ' '; print(tail...); } void dbg() { cout << '\n'; } template void dbg(const T &t) { cerr << t << '\n'; } template void dbg(const Head &head, const Tail &... tail) { cerr << head << ' '; dbg(tail...); } template< typename T1, typename T2 > ostream &operator<<(ostream &os, const pair< T1, T2 >& p) { os << p.first << " " << p.second; return os; } template< typename T1, typename T2 > istream &operator>>(istream &is, pair< T1, T2 > &p) { is >> p.first >> p.second; return is; } template< typename T > ostream &operator<<(ostream &os, const vector< T > &v) { for(int i = 0; i < (int) v.size(); i++) { os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; } template< typename T > istream &operator>>(istream &is, vector< T > &v) { for(T &in : v) is >> in; return is; } template< typename T1, typename T2 > inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); } template< typename T1, typename T2 > inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); } template pair> compress(const vector &a) { int n = a.size(); vector x; REP(i, n) x.push_back(i); sort(ALL(x)); x.erase(unique(ALL(x)), x.end()); VI res(n); REP(i, n) res[i] = lower_bound(ALL(x), a); return make_pair(res, x); } #ifdef aclsegtree template struct value_size { S value; int size; }; template S min_op(S l, S r) { return min(l, r); }; template S max_op(S l, S r) { return max(l, r); }; template S sum_op(S l, S r) { return l + r; }; template value_size sum_op_size(value_size l, value_size r) { return {l.value + r.value, l.size + r.size}; }; template value_size min_op_size(value_size l, value_size r) { return {min(l.value, r.value), l.size + r.size}; }; template value_size max_op_size(value_size l, value_size r) { return {max(l.value, r.value), l.size + r.size}; }; template S min_e() { return numeric_limits::max(); }; template S max_e() { return numeric_limits::min(); }; template S sum_e() { return 0; } template value_size sum_e_size() { return {0, 0}; } template value_size min_e_size() { return {numeric_limits::max(), 0}; } template value_size max_e_size() { return {numeric_limits::min(), 0}; } template S chmin_mapping(F f, S x) { return min(x, f); } template S chmax_mapping(F f, S x) { return max(x, f); } template S add_mapping(F f, S x) { return x + f; } template value_size add_mapping_size(F f, value_size x) { return {x.value + x.size * f, x.size}; } template F chmin_composition(F f, F g) { return min(f, g); } template F chmax_composition(F f, F g) { return max(f, g); } template F add_composition(F f, F g) { return f + g; } template F chmin_id() { return numeric_limits::max(); } template F chmax_id() { return numeric_limits::min(); } template F add_id() { return 0; } template using RSumQ = segtree, sum_e>; template using RMaxQ = segtree, max_e>; template using RMinQ = segtree, min_e>; template using RAddSumQ = lazy_segtree, sum_op_size, sum_e_size, F, add_mapping_size, add_composition, add_id>; template using RAddMinQ = lazy_segtree, min_e, F, add_mapping, add_composition, add_id>; template using RAddMaxQ = lazy_segtree, max_e, F, add_mapping, add_composition, add_id>; template using RMinMinQ = lazy_segtree, min_e, F, chmin_mapping, chmin_composition, chmin_id>; template using RMaxMaxQ = lazy_segtree, max_e, F, chmax_mapping, chmax_composition, chmax_id>; #endif #line 11 "Contests/yukicoder_/6654/main.cpp" void solve(){ int n, m, l; cin >> n >> m >> l; mf_graph mf(n + m + 2); scc_graph scc(n + m); VVI graph(n + m), rgraph(n + m); REP(i, l) { int s, t; cin >> s >> t; s--; t--; mf.add_edge(s, n + t, 1); scc.add_edge(s, n + t); graph[s].push_back(n + t); rgraph[n + t].push_back(s); } REP(i, n) mf.add_edge(n + m, i, 1); REP(i, m) mf.add_edge(n + i, n + m + 1, 1); mf.flow(n + m, n + m + 1); VI unmatch(n + m, 1); REP(i, l) { atcoder::mf_graph::edge e = mf.get_edge(i); if(e.flow) { scc.add_edge(e.to, e.from); graph[e.to].push_back(e.from); rgraph[e.from].push_back(e.to); unmatch[e.from] = unmatch[e.to] = 0; } } VI from_unmatch(n + m); int id = 0; function dfs = [&](int i) { if(from_unmatch[i]) return; from_unmatch[i] = id; for(int to : graph[i]) dfs(to); }; REP(i, n + m) if(unmatch[i]) { id++; dfs(i); } VI to_unmatch(n + m); swap(from_unmatch, to_unmatch); swap(graph, rgraph); id = 0; REP(i, n + m) { id++; if(unmatch[i]) dfs(i); } swap(from_unmatch, to_unmatch); swap(graph, rgraph); VVI groups = scc.scc(); VI group_num(n + m); REP(i, groups.size()) { REP(j, groups[i].size()) { group_num[groups[i][j]] = i; } } VI from_size(n + m), to_size(n + m); REP(i, l) { mf_graph::edge e = mf.get_edge(i); if(e.flow) { from_size[from_unmatch[e.from]]++; to_size[to_unmatch[e.from]]++; } } REP(i, l) { mf_graph::edge e = mf.get_edge(i); if(e.flow) print("Yes"); else if(from_unmatch[e.from] && from_size[from_unmatch[e.from]]) print("Yes"); else if(to_unmatch[e.from] && to_size[to_unmatch[e.from]]) print("Yes"); else if(group_num[e.from] != group_num[e.to]) print("No"); else print("Yes"); } } // generated by oj-template v4.7.2 (https://github.com/online-judge-tools/template-generator) int main() { // Fasterize input/output script ios::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(100); // scanf/printf user should delete this fasterize input/output script int t = 1; //cin >> t; // comment out if solving multi testcase for(int testCase = 1;testCase <= t;++testCase){ solve(); } return 0; }