結果
問題 | No.1745 Selfish Spies 2 (à la Princess' Perfectionism) |
ユーザー |
![]() |
提出日時 | 2023-03-07 18:38:32 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 6,002 bytes |
コンパイル時間 | 2,135 ms |
コンパイル使用メモリ | 208,560 KB |
最終ジャッジ日時 | 2025-02-11 06:17:19 |
ジャッジサーバーID (参考情報) |
judge5 / judge6 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 31 WA * 23 RE * 5 |
ソースコード
#include <bits/stdc++.h>// clang-format offstd::ostream&operator<<(std::ostream&os,std::int8_t x){return os<<(int)x;}std::ostream&operator<<(std::ostream&os,std::uint8_t x){return os<<(int)x;}std::ostream&operator<<(std::ostream&os,const __int128_t &v){if(!v)os<<"0";__int128_t tmp=v<0?(os<<"-",-v):v;std::string s;while(tmp)s+='0'+(tmp%10),tmp/=10;return std::reverse(s.begin(),s.end()),os<<s;}std::ostream&operator<<(std::ostream&os,const __uint128_t &v){if(!v)os<<"0";__uint128_t tmp=v;std::string s;while(tmp)s+='0'+(tmp%10),tmp/=10;returnstd::reverse(s.begin(),s.end()),os<<s;}#define checkpoint() (void(0))#define debug(x) (void(0))#define debugArray(x,n) (void(0))#define debugMatrix(x,h,w) (void(0))// clang-format on#ifdef __LOCAL// clang-format off#undef checkpoint#undef debug#undef debugArray#undef debugMatrixtemplate<class T, class U>std::ostream &operator<<(std::ostream&os,const std::pair<T,U>&x){return os<<"("<<x.first<<", "<<x.second<<")";}template<typename T>std::ostream &operator<<(std::ostream&os,const std::vector<T>&vec){os<<'[';for(int _=0,__= vec.size();_<__;++_)os<<(_ ?", ":"")<<vec[_];return os<<']';}template<typename T>std::ostream &operator<<(std::ostream&os,const std::set<T>&s){os<<'{';int _=0;for(const auto &x:s)os<<(_++ ? ", " : "")<<x;return os << '}';}template<typename T,std::size_t _Nm>std::ostream&operator<<(std::ostream &os,const std::array<T, _Nm> &arr) {os<<'['<<arr[0];for(std::size_t _=1;_<_Nm;++_)os<<", "<<arr[_];return os<<']';}template<class Tup,std::size_t... I>void print(std::ostream&os,const Tup &x,std::index_sequence<I...>){(void)(int[]){(os<<std::get<I>(x)<<", ",0)...};}template<class... Args>std::ostream &operator<<(std::ostream&os,const std::tuple<Args...> &x) {static constexpr std::size_t N = sizeof...(Args);os<<"(";if constexpr(N>=2)print(os,x,std::make_index_sequence<N-1>());return os<<std::get<N-1>(x)<<")";}const std::string COLOR_RESET="\033[0m",BRIGHT_GREEN="\033[1;32m",BRIGHT_RED="\033[1;31m",BRIGHT_CYAN="\033[1;36m",NORMAL_CROSSED="\033[0;9;37m",ITALIC="\033[3m",BOLD="\033[1m",RED_BACKGROUND="\033[1;41m",NORMAL_FAINT="\033[0;2m";#define func_LINE_FILE NORMAL_FAINT<<" in "<<BOLD<<__func__<<NORMAL_FAINT<<ITALIC<<" (L"<<__LINE__<<") "<< __FILE__<<COLOR_RESET#define checkpoint() std::cerr<<BRIGHT_RED<<"< check point! >"<<func_LINE_FILE<<'\n'#define debug(x) std::cerr<<BRIGHT_CYAN<<#x<<COLOR_RESET<<" = "<<(x)<<func_LINE_FILE<<'\n'#define debugArray(x, n) do{std::cerr<<BRIGHT_CYAN<<#x<<COLOR_RESET<<" = ["<<x[0];for(int _=1;_<(int)(n);++_)std::cerr<<", "<<x[_];std::cerr<<"]"<<func_LINE_FILE<<'\n';}while(0)#define debugMatrix(x, h, w) do{std::cerr<<BRIGHT_CYAN<<#x<<"\n"<<COLOR_RESET<<"= ";for(int _=0;(_)<(int)(h);++_){std::cerr<<((_?" [":"[["));for(int __=0;__<(int)(w);++__)std::cerr<<((__?", ":""))<<x[_][__];std::cerr<<"]"<<(_+1==(int)(h)?"]":",\n");}std::cerr<<func_LINE_FILE<<'\n';}while(0)#endif// clang-format onclass DulmageMendelsohn {std::vector<int> blg[2];std::vector<std::array<int, 2>> es;public:DulmageMendelsohn(int L, int R): blg{std::vector(L, -3), std::vector(R, -3)} {}void add_edge(int l, int r) { es.push_back({l, r}); }void build() {const int n[]= {(int)blg[0].size(), (int)blg[1].size()};std::vector<int> g[2], pos[2], rt, pre, mate[2], que(std::max(n[0], n[1]));for (int b= 2; b--;) g[b].resize(es.size()), pos[b].resize(n[b] + 1), mate[b].assign(n[0], -1);for (auto [l, r]: es) ++pos[0][l], ++pos[1][r];for (int b= 2; b--;) std::partial_sum(pos[b].begin(), pos[b].end(), pos[b].begin());for (auto [l, r]: es) g[0][--pos[0][l]]= r, g[1][--pos[1][r]]= l;int t, k= 0;for (bool upd= true; upd;) {upd= false, rt.assign(n[0], -1), pre.assign(n[0], -1), t= 0;for (int l= n[0]; l--;)if (mate[0][l] == -1) que[t++]= rt[l]= pre[l]= l;for (int i= 0; i < t; ++i)if (int l= que[i]; mate[0][rt[l]] == -1)for (int j= pos[0][l], r, nl; j < pos[0][l + 1]; ++j) {if (nl= mate[1][r= g[0][j]]; nl == -1) {for (upd= true; r != -1; l= pre[l]) mate[1][r]= l, std::swap(mate[0][l], r);break;}if (pre[nl] == -1) rt[que[t++]= nl]= rt[pre[nl]= l];}}for (int l= n[0]; l--;)if (mate[0][l] == -1) blg[0][l]= -1;for (int r= n[1]; r--;)if (mate[1][r] == -1) blg[1][r]= 0;for (int b= 2, c= 0; b--; --c)for (int s= n[b], i= t= 0; s--;)if (mate[b][s] == -1)for (que[t++]= s; i < t; ++i)for (int v= que[i], j= pos[b][v], u, w; j < pos[b][v + 1]; ++j)if (blg[!b][u= g[0][j]] == -3)if (blg[!b][u]= c, w= mate[1][u]; w != -1 && blg[b][w] == -3) blg[b][que[t++]= w]= c;pre.assign(pos[0].begin(), pos[0].begin() + n[0]), t= 0;for (int s= n[0], v; s--;)if (blg[0][s] == -3)for (blg[0][v= s]= -4; v >= 0;) {if (pre[v] == pos[0][v + 1]) rt[t++]= v, v= blg[0][v];else if (int w= mate[1][g[0][pre[v]++]]; blg[0][w] == -3) blg[0][w]= v, v= w;}for (int i= 0, e= 0; t--;)if (int s= rt[t], p= mate[0][s]; blg[1][p] == -3)for (que[e++]= p, blg[0][s]= blg[1][p]= ++k; i < e; ++i)for (int v= que[i], j= pos[1][v]; j < pos[1][v + 1]; ++j)if (int u= g[1][j], w= mate[0][u]; blg[1][w] == -3) que[e++]= w, blg[0][u]= blg[1][w]= k;++k;for (int l= n[0]; l--;)if (blg[0][l] == -1) blg[0][l]= k;for (int r= n[1]; r--;)if (blg[1][r] == -1) blg[1][r]= k;}int left_belong(int l) const { return blg[0][l]; }int right_belong(int r) const { return blg[1][r]; }};using namespace std;namespace yukicoder1745 {signed main() {cin.tie(0);ios::sync_with_stdio(0);int N, M, L;cin >> N >> M >> L;DulmageMendelsohn dm(N, M);int S[L], T[L];for (int i= 0; i < L; ++i) {cin >> S[i] >> T[i];dm.add_edge(--S[i], --T[i]);}dm.build();for (int i= 0; i < L; ++i) {cout << (dm.left_belong(S[i]) == dm.right_belong(T[i]) ? "Yes" : "No") << '\n';}return 0;}}signed main() {cin.tie(0);ios::sync_with_stdio(0);yukicoder1745::main();return 0;}