結果
問題 | No.1744 Selfish Spies 1 (à la Princess' Perfectionism) |
ユーザー |
|
提出日時 | 2021-11-14 21:58:14 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,992 bytes |
コンパイル時間 | 2,499 ms |
コンパイル使用メモリ | 210,764 KB |
最終ジャッジ日時 | 2025-01-25 18:14:55 |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 23 WA * 16 |
ソースコード
#pragma region Macros#include <bits/stdc++.h>using namespace std;template <class T> inline bool chmax(T &a, T b) {if(a < b) {a = b;return 1;}return 0;}template <class T> inline bool chmin(T &a, T b) {if(a > b) {a = b;return 1;}return 0;}#ifdef DEBUGtemplate <class T, class U>ostream &operator<<(ostream &os, const pair<T, U> &p) {os << '(' << p.first << ',' << p.second << ')';return os;}template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {os << '{';for(int i = 0; i < (int)v.size(); i++) {if(i) { os << ','; }os << v[i];}os << '}';return os;}void debugg() { cerr << endl; }template <class T, class... Args>void debugg(const T &x, const Args &... args) {cerr << " " << x;debugg(args...);}#define debug(...) \cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debugg(__VA_ARGS__)#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl#else#define debug(...) (void(0))#define dump(x) (void(0))#endifstruct Setup {Setup() {cin.tie(0);ios::sync_with_stdio(false);cout << fixed << setprecision(15);}} __Setup;using ll = long long;#define OVERLOAD3(_1, _2, _3, name, ...) name#define ALL(v) (v).begin(), (v).end()#define RALL(v) (v).rbegin(), (v).rend()#define REP1(i, n) for(int i = 0; i < (n); i++)#define REP2(i, a, b) for(int i = (a); i < int(b); i++)#define REP(...) OVERLOAD3(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())const int INF = 1 << 30;const ll LLINF = 1LL << 60;constexpr int MOD = 1000000007;constexpr int MOD2 = 998244353;const int dx[4] = {1, 0, -1, 0};const int dy[4] = {0, 1, 0, -1};void Case(int i) { cout << "Case #" << i << ": "; }int popcount(int x) { return __builtin_popcount(x); }ll popcount(ll x) { return __builtin_popcountll(x); }#pragma endregion Macros#include <atcoder/maxflow>int main() {int N, M, L;cin >> N >> M >> L;atcoder::mf_graph<int> mf(N+M+2);int S = N+M, T = S+1;vector<pair<int, int>> es;REP(i, L) {int s, t;cin >> s >> t;s--; t = t-1 + N;mf.add_edge(s, t, 1);es.emplace_back(s, t);}REP(i, N) mf.add_edge(S, i, 1);REP(i, M) mf.add_edge(i+N, T, 1);int mx = mf.flow(S, T);auto res_es = mf.edges();REP(i, L) {auto [s, t] = es[i];if(res_es[i].flow == 0) {cout << "Yes\n";continue;}// mf.change_edge(i, 0, 0);mf.change_edge(L+s, 1, 0);mf.change_edge(L+t, 1, 0);int res = mf.flow(S, T);debug(i, res);if(res > 0) cout << "Yes\n";else cout << "No\n";mf.change_edge(i, 1, 0);mf.change_edge(L+s, 1, 1);mf.change_edge(L+t, 1, 1);}}