結果

問題 No.2238 Rock and Hole
ユーザー woodywoodywoodywoody
提出日時 2023-03-04 04:52:49
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 57 ms / 3,000 ms
コード長 5,497 bytes
コンパイル時間 3,966 ms
コンパイル使用メモリ 248,560 KB
実行使用メモリ 22,504 KB
最終ジャッジ日時 2024-09-18 00:56:40
合計ジャッジ時間 5,085 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 1 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 1 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 2 ms
5,376 KB
testcase_07 AC 2 ms
5,376 KB
testcase_08 AC 2 ms
5,376 KB
testcase_09 AC 2 ms
5,376 KB
testcase_10 AC 5 ms
5,376 KB
testcase_11 AC 27 ms
13,568 KB
testcase_12 AC 25 ms
14,020 KB
testcase_13 AC 27 ms
13,416 KB
testcase_14 AC 16 ms
9,196 KB
testcase_15 AC 7 ms
5,632 KB
testcase_16 AC 53 ms
19,428 KB
testcase_17 AC 57 ms
22,504 KB
testcase_18 AC 35 ms
18,272 KB
testcase_19 AC 37 ms
10,056 KB
testcase_20 AC 37 ms
12,216 KB
testcase_21 AC 40 ms
10,980 KB
testcase_22 AC 23 ms
10,508 KB
testcase_23 AC 2 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define rrepx(i,x,b) for(int i=b-1;i>=x;i--)
#define fore(i,a) for(auto i:a)
#define fore1(i,a) for(auto &i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second
#define pcnt __builtin_popcountll

using namespace std;
using namespace atcoder;

using ll = long long;
using ld = long double;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return true;} else {cout << "No" << endl; return false;}}
#define dame { cout << "No" << endl; return;}
#define dame1 { cout << -1 << endl; return;}
#define cout2(x,y) cout << x << " " << y << endl;
#define coutp(p) cout << p.fi << " " << p.se << endl;
#define out cout << ans << endl;
#define outd cout << fixed << setprecision(20) << ans << endl;
#define outm cout << ans.val() << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define outdv fore(yans , ans) cout << yans.val() << "\n";
#define coutv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define coutv2(v) fore(vy , v) cout << vy << "\n";
#define coutvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define coutvm2(v) fore(vy , v) cout << vy.val() << "\n";
using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;using pii = pair<int,int>;using pdd = pair<ld,ld>;
using tp = tuple<int ,int ,int>;
using vi = vector<int>;using vd = vector<ld>;using vl = vector<ll>;using vs = vector<string>;using vb = vector<bool>;
using vpii = vector<pii>;using vpli = vector<pli>;using vpll = vector<pll>;using vpil = vector<pil>;
using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvs = vector<vector<string>>;using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;using vvpli = vector<vector<pli>>;using vvpll = vector<vpll>;using vvpil = vector<vpil>;
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = dynamic_modint<0>;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
#define yes {cout <<"Yes"<<endl;}
#define yesr { cout <<"Yes"<<endl; return;}
#define no {cout <<"No"<<endl;}
#define nor { cout <<"No"<<endl; return;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#ifdef MY_LOCAL_DEBUG
#define show(x) cerr<<#x<<" = "<<x<<endl
#define showp(p) cerr<<#p<<" = "<<p.fi<<" : "<<p.se<<endl
#define show2(x,y) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<endl
#define show3(x,y,z) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<" : "<<#z<<" = "<<z<<endl
#define show4(x,y,z,x2) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<" : "<<#z<<" = "<<z<<" : "<<#x2<<" = "<<x2<<endl
#define test(x) cout << "test" << x << endl
#define showv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) fore(vy , v) cout << vy << "\n";
#define showvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define showvm2(v) fore(vy , v) cout << vy.val() << "\n";
#else
#define show(x)
#define showp(p)
#define show2(x,y)
#define show3(x,y,z)
#define show4(x,y,z,x2)
#define test(x)
#define showv(v)
#define showv2(v)
#define showvm(v)
#define showvm2(v)
#endif

void solve(){
    int h,w; cin>>h>>w;
    vs s(h);
    rep(i,h) cin>>s[i];
    int ro=0,ho=0;
    rep(i,h) rep(j,w){
        if (s[i][j] == 'h') ro++;
        if (s[i][j] == 'r') ho++;
    }
    int nr = 0;
    int nh = 0;
    vvi vh(h),vw(w);
    map<pii,int> mp;
    rep(i,h) rep(j,w){
        if (s[i][j]=='h'){
            mp[{i,j}] = nr++;
            vh[i].pb(j);
            vw[j].pb(i);
        }
    }
    mf_graph<int> mg(ro+ho+2);
    int st = ro+ho;
    int go = st+1;
    rep(i,h) rep(j,w){
        if (s[i][j]=='r'){
            auto it = lower_bound(rng(vh[i]) , j);
            if (it != vh[i].end()){
                pii p = {i , *it};
                assert(mp.count(p));
                mg.add_edge(mp[p] , ro+nh , 1);
            }
            if (it != vh[i].begin()){
                it--;
                pii p = {i , *it};
                assert(mp.count(p));
                mg.add_edge(mp[p] , ro+nh , 1);
            }
            it = lower_bound(rng(vw[j]) , i);
            if (it != vw[j].end()){
                pii p = {*it , j};
                assert(mp.count(p));
                mg.add_edge(mp[p] , ro+nh , 1);
            }
            if (it != vw[j].begin()){
                it--;
                pii p = {*it , j};
                assert(mp.count(p));
                mg.add_edge(mp[p] , ro+nh , 1);
            }
            nh++;
        }
    }
    rep(i,ro) mg.add_edge(st,i,1);
    rep(i,ho) mg.add_edge(i+ro,go,1);
    int flow = mg.flow(st,go);
    yn(flow==ho);

    return;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    //cin>>t;

    rep(i,t){
        solve();
    }

    return 0;
}
0