#845990 (C++17) No.2238 Rock and Hole

提出ソース

結果

問題	No.2238 Rock and Hole
ユーザー	dyktr_06
提出日時	2023-03-03 23:52:01
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	159 ms / 3,000 ms
コード長	5,538 bytes
コンパイル時間	4,800 ms
コンパイル使用メモリ	279,184 KB
実行使用メモリ	31,500 KB
最終ジャッジ日時	2023-10-18 03:49:14
合計ジャッジ時間	6,459 ms
ジャッジサーバーID （参考情報）	judge14 / judge15

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 4,348 KB
testcase_01	AC	2 ms 4,348 KB
testcase_02	AC	2 ms 4,348 KB
testcase_03	AC	2 ms 4,348 KB
testcase_04	AC	2 ms 4,348 KB
testcase_05	AC	2 ms 4,348 KB
testcase_06	AC	2 ms 4,348 KB
testcase_07	AC	2 ms 4,348 KB
testcase_08	AC	2 ms 4,348 KB
testcase_09	AC	2 ms 4,348 KB
testcase_10	AC	22 ms 12,380 KB
testcase_11	AC	45 ms 22,588 KB
testcase_12	AC	42 ms 18,344 KB
testcase_13	AC	35 ms 18,360 KB
testcase_14	AC	17 ms 11,356 KB
testcase_15	AC	8 ms 6,684 KB
testcase_16	AC	97 ms 31,356 KB
testcase_17	AC	92 ms 31,500 KB
testcase_18	AC	56 ms 22,344 KB
testcase_19	AC	159 ms 22,212 KB
testcase_20	AC	70 ms 21,480 KB
testcase_21	AC	92 ms 22,776 KB
testcase_22	AC	57 ms 19,432 KB
testcase_23	AC	2 ms 4,348 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;
using namespace atcoder;

#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()
#define Sort(a) sort(a.begin(), a.end())
#define RSort(a) sort(a.rbegin(), a.rend())

typedef long long int ll;
typedef unsigned long long ul;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef pair<long long, long long> P;

template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }

const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double EPS = 1e-9;
const long double PI = acos(-1);
 
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; }

template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; 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, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; }

template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }

ll h, w;
vst s;

void input(){
    in(h, w);
    vin(s, h);
}

ll c(ll i, ll j){
    return j * h + i;
}

void solve(){
    vector<P> p;
    vector<vector<ll>> hh(h), wh(w);
    rep(i, h) rep(j, w){
        if(s[i][j] == 'h'){
            hh[i].push_back(j);
            wh[j].push_back(i);
        }
    }
    ll rcnt = 0;
    rep(i, h){
        rep(j, w){
            if(s[i][j] == 'r'){
                rcnt++;
                auto iter = upper_bound(ALL(hh[i]), j);
                auto iter2 = upper_bound(ALL(wh[j]), i);
                ll cnt1 = 1, cnt2 = 1;
                if(iter != hh[i].begin()) iter--, cnt1++;
                if(iter2 != wh[j].begin()) iter2--, cnt2++;
                rep(k, cnt1){
                    if(iter == hh[i].end()) break;
                    p.emplace_back(c(i, j), c(i, *iter));
                    iter++;
                }
                rep(k, cnt2){
                    if(iter2 == wh[j].end()) break;
                    p.emplace_back(c(i, j), c(*iter2, j));
                    iter2++;
                }
            }
        }
    }
    mf_graph<ll> G(2 * h * w + 2);
    ll MINF = 1 << 30;
    ll sv = 2 * h * w, tv = 2 * h * w + 1;
    rep(i, h) rep(j, w){
        G.add_edge(sv, c(i, j), 1);
        G.add_edge(h * w + c(i, j), tv, 1);
    }
    for(auto [x, y] : p){
        G.add_edge(x, h * w + y, 1);
    }
    if(G.flow(sv, tv) == rcnt){
        out("Yes");
    }else{
        out("No");
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    input();
    solve();
}

yukicoder

結果

テストケース

ソースコード