#618971 (C++17) No.580 旅館の予約計画

提出ソース

結果

問題	No.580 旅館の予約計画
ユーザー	tkmst201
提出日時	2021-02-17 14:47:36
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	190 ms / 2,000 ms
コード長	6,642 bytes
コンパイル時間	2,489 ms
コンパイル使用メモリ	219,868 KB
実行使用メモリ	6,948 KB
最終ジャッジ日時	2024-09-14 01:51:44
合計ジャッジ時間	6,305 ms
ジャッジサーバーID （参考情報）	judge1 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	4 ms 6,816 KB
testcase_01	AC	4 ms 6,940 KB
testcase_02	AC	5 ms 6,940 KB
testcase_03	AC	8 ms 6,940 KB
testcase_04	AC	9 ms 6,944 KB
testcase_05	AC	8 ms 6,940 KB
testcase_06	AC	15 ms 6,944 KB
testcase_07	AC	31 ms 6,940 KB
testcase_08	AC	16 ms 6,944 KB
testcase_09	AC	15 ms 6,940 KB
testcase_10	AC	24 ms 6,944 KB
testcase_11	AC	36 ms 6,940 KB
testcase_12	AC	42 ms 6,944 KB
testcase_13	AC	20 ms 6,940 KB
testcase_14	AC	32 ms 6,940 KB
testcase_15	AC	190 ms 6,944 KB
testcase_16	AC	175 ms 6,944 KB
testcase_17	AC	166 ms 6,944 KB
testcase_18	AC	148 ms 6,944 KB
testcase_19	AC	153 ms 6,940 KB
testcase_20	AC	129 ms 6,944 KB
testcase_21	AC	140 ms 6,940 KB
testcase_22	AC	90 ms 6,944 KB
testcase_23	AC	141 ms 6,940 KB
testcase_24	AC	157 ms 6,944 KB
testcase_25	AC	114 ms 6,944 KB
testcase_26	AC	14 ms 6,944 KB
testcase_27	AC	14 ms 6,940 KB
testcase_28	AC	13 ms 6,944 KB
testcase_29	AC	12 ms 6,940 KB
testcase_30	AC	92 ms 6,940 KB
testcase_31	AC	131 ms 6,948 KB
testcase_32	AC	92 ms 6,940 KB
testcase_33	AC	175 ms 6,944 KB
testcase_34	AC	62 ms 6,940 KB
testcase_35	AC	6 ms 6,940 KB

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

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

#ifndef ATCODER_MINCOSTFLOW_HPP
#define ATCODER_MINCOSTFLOW_HPP 1

#include <algorithm>
#include <cassert>
#include <limits>
#include <queue>
#include <vector>

namespace atcoder {

template <class Cap, class Cost> struct mcf_graph {
  public:
    mcf_graph() {}
    mcf_graph(int n) : _n(n), g(n) {}

    int add_edge(int from, int to, Cap cap, Cost cost) {
        assert(0 <= from && from < _n);
        assert(0 <= to && to < _n);
        int m = int(pos.size());
        pos.push_back({from, int(g[from].size())});
        g[from].push_back(_edge{to, int(g[to].size()), cap, cost});
        g[to].push_back(_edge{from, int(g[from].size()) - 1, 0, -cost});
        return m;
    }

    struct edge {
        int from, to;
        Cap cap, flow;
        Cost cost;
    };

    edge get_edge(int i) {
        int m = int(pos.size());
        assert(0 <= i && i < m);
        auto _e = g[pos[i].first][pos[i].second];
        auto _re = g[_e.to][_e.rev];
        return edge{
            pos[i].first, _e.to, _e.cap + _re.cap, _re.cap, _e.cost,
        };
    }
    std::vector<edge> edges() {
        int m = int(pos.size());
        std::vector<edge> result(m);
        for (int i = 0; i < m; i++) {
            result[i] = get_edge(i);
        }
        return result;
    }

    std::pair<Cap, Cost> flow(int s, int t) {
        return flow(s, t, std::numeric_limits<Cap>::max());
    }
    std::pair<Cap, Cost> flow(int s, int t, Cap flow_limit) {
        return slope(s, t, flow_limit).back();
    }
    std::vector<std::pair<Cap, Cost>> slope(int s, int t) {
        return slope(s, t, std::numeric_limits<Cap>::max());
    }
    std::vector<std::pair<Cap, Cost>> slope(int s, int t, Cap flow_limit) {
        assert(0 <= s && s < _n);
        assert(0 <= t && t < _n);
        assert(s != t);
        // variants (C = maxcost):
        // -(n-1)C <= dual[s] <= dual[i] <= dual[t] = 0
        // reduced cost (= e.cost + dual[e.from] - dual[e.to]) >= 0 for all edge
        std::vector<Cost> dual(_n, 0), dist(_n);
        std::vector<int> pv(_n), pe(_n);
        std::vector<bool> vis(_n);
        auto dual_ref = [&]() {
            std::fill(dist.begin(), dist.end(),
                      std::numeric_limits<Cost>::max());
            std::fill(pv.begin(), pv.end(), -1);
            std::fill(pe.begin(), pe.end(), -1);
            std::fill(vis.begin(), vis.end(), false);
            struct Q {
                Cost key;
                int to;
                bool operator<(Q r) const { return key > r.key; }
            };
            std::priority_queue<Q> que;
            dist[s] = 0;
            que.push(Q{0, s});
            while (!que.empty()) {
                int v = que.top().to;
                que.pop();
                if (vis[v]) continue;
                vis[v] = true;
                if (v == t) break;
                // dist[v] = shortest(s, v) + dual[s] - dual[v]
                // dist[v] >= 0 (all reduced cost are positive)
                // dist[v] <= (n-1)C
                for (int i = 0; i < int(g[v].size()); i++) {
                    auto e = g[v][i];
                    if (vis[e.to] || !e.cap) continue;
                    // |-dual[e.to] + dual[v]| <= (n-1)C
                    // cost <= C - -(n-1)C + 0 = nC
                    Cost cost = e.cost - dual[e.to] + dual[v];
                    if (dist[e.to] - dist[v] > cost) {
                        dist[e.to] = dist[v] + cost;
                        pv[e.to] = v;
                        pe[e.to] = i;
                        que.push(Q{dist[e.to], e.to});
                    }
                }
            }
            if (!vis[t]) {
                return false;
            }

            for (int v = 0; v < _n; v++) {
                if (!vis[v]) continue;
                // dual[v] = dual[v] - dist[t] + dist[v]
                //         = dual[v] - (shortest(s, t) + dual[s] - dual[t]) + (shortest(s, v) + dual[s] - dual[v])
                //         = - shortest(s, t) + dual[t] + shortest(s, v)
                //         = shortest(s, v) - shortest(s, t) >= 0 - (n-1)C
                dual[v] -= dist[t] - dist[v];
            }
            return true;
        };
        Cap flow = 0;
        Cost cost = 0, prev_cost = -1;
        std::vector<std::pair<Cap, Cost>> result;
        result.push_back({flow, cost});
        while (flow < flow_limit) {
            if (!dual_ref()) break;
            Cap c = flow_limit - flow;
            for (int v = t; v != s; v = pv[v]) {
                c = std::min(c, g[pv[v]][pe[v]].cap);
            }
            for (int v = t; v != s; v = pv[v]) {
                auto& e = g[pv[v]][pe[v]];
                e.cap -= c;
                g[v][e.rev].cap += c;
            }
            Cost d = -dual[s];
            flow += c;
            cost += c * d;
            if (prev_cost == d) {
                result.pop_back();
            }
            result.push_back({flow, cost});
            prev_cost = cost;
        }
        return result;
    }

  private:
    int _n;

    struct _edge {
        int to, rev;
        Cap cap;
        Cost cost;
    };

    std::vector<std::pair<int, int>> pos;
    std::vector<std::vector<_edge>> g;
};

}  // namespace atcoder

#endif  // ATCODER_MINCOSTFLOW_HPP

int main() {
	int N, M;
	cin >> N >> M;
	vector<int> L(M), R(M);
	constexpr int mxtime = 24 * 60 * 7;
	atcoder::mcf_graph<int, int> mcf(mxtime + 3);
	const int s = mxtime + 1, t = mxtime + 2;
	REP(i, mxtime) mcf.add_edge(i, i + 1, N, 0);
	mcf.add_edge(s, 0, N, 0);
	mcf.add_edge(mxtime, t, N, 0);
	
	int ans = 0;
	REP(i, M) {
		int d[2], h[2], m[2];
		scanf("%d %d:%d %d %d:%d", d, h, m, d + 1, h + 1, m + 1);
		auto conv = [](int d, int h, int m) {
			return (d - 2) * 24 * 60 + h * 60 + m;
		};
		const int u = conv(d[0], h[0], m[0]);
		const int v = conv(d[1], h[1], m[1]) + 1;
		// u->v cap 1, cost -1
		mcf.add_edge(s, v, 1, 0);
		mcf.add_edge(u, t, 1, 0);
		mcf.add_edge(v, u, 1, 1);
		++ans;
	}
	ans -= mcf.flow(s, t).second;
	cout << ans << endl;
}

yukicoder

結果

テストケース

ソースコード