結果
問題 | No.654 Air E869120 |
ユーザー |
![]() |
提出日時 | 2020-09-10 12:58:44 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 6,274 bytes |
コンパイル時間 | 2,324 ms |
コンパイル使用メモリ | 225,372 KB |
最終ジャッジ日時 | 2025-01-14 09:15:11 |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 5 |
other | AC * 21 WA * 14 |
ソースコード
#include <algorithm>#include <vector>namespace atcoder {namespace internal {template <class T> struct simple_queue {std::vector<T> payload;int pos = 0;void reserve(int n) { payload.reserve(n); }int size() const { return int(payload.size()) - pos; }bool empty() const { return pos == int(payload.size()); }void push(const T& t) { payload.push_back(t); }T& front() { return payload[pos]; }void clear() {payload.clear();pos = 0;}void pop() { pos++; }};} // namespace internal} // namespace atcoder#include <cassert>#include <limits>#include <queue>#include <vector>namespace atcoder {template <class Cap> struct mf_graph {public:mf_graph() : _n(0) {}mf_graph(int n) : _n(n), g(n) {}int add_edge(int from, int to, Cap cap) {assert(0 <= from && from < _n);assert(0 <= to && to < _n);assert(0 <= cap);int m = int(pos.size());pos.push_back({from, int(g[from].size())});g[from].push_back(_edge{to, int(g[to].size()), cap});g[to].push_back(_edge{from, int(g[from].size()) - 1, 0});return m;}struct edge {int from, to;Cap cap, flow;};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};}std::vector<edge> edges() {int m = int(pos.size());std::vector<edge> result;for (int i = 0; i < m; i++) {result.push_back(get_edge(i));}return result;}void change_edge(int i, Cap new_cap, Cap new_flow) {int m = int(pos.size());assert(0 <= i && i < m);assert(0 <= new_flow && new_flow <= new_cap);auto& _e = g[pos[i].first][pos[i].second];auto& _re = g[_e.to][_e.rev];_e.cap = new_cap - new_flow;_re.cap = new_flow;}Cap flow(int s, int t) {return flow(s, t, std::numeric_limits<Cap>::max());}Cap flow(int s, int t, Cap flow_limit) {assert(0 <= s && s < _n);assert(0 <= t && t < _n);std::vector<int> level(_n), iter(_n);internal::simple_queue<int> que;auto bfs = [&]() {std::fill(level.begin(), level.end(), -1);level[s] = 0;que.clear();que.push(s);while (!que.empty()) {int v = que.front();que.pop();for (auto e : g[v]) {if (e.cap == 0 || level[e.to] >= 0) continue;level[e.to] = level[v] + 1;if (e.to == t) return;que.push(e.to);}}};auto dfs = [&](auto self, int v, Cap up) {if (v == s) return up;Cap res = 0;int level_v = level[v];for (int& i = iter[v]; i < int(g[v].size()); i++) {_edge& e = g[v][i];if (level_v <= level[e.to] || g[e.to][e.rev].cap == 0) continue;Cap d =self(self, e.to, std::min(up - res, g[e.to][e.rev].cap));if (d <= 0) continue;g[v][i].cap += d;g[e.to][e.rev].cap -= d;res += d;if (res == up) break;}return res;};Cap flow = 0;while (flow < flow_limit) {bfs();if (level[t] == -1) break;std::fill(iter.begin(), iter.end(), 0);while (flow < flow_limit) {Cap f = dfs(dfs, t, flow_limit - flow);if (!f) break;flow += f;}}return flow;}std::vector<bool> min_cut(int s) {std::vector<bool> visited(_n);internal::simple_queue<int> que;que.push(s);while (!que.empty()) {int p = que.front();que.pop();visited[p] = true;for (auto e : g[p]) {if (e.cap && !visited[e.to]) {visited[e.to] = true;que.push(e.to);}}}return visited;}private:int _n;struct _edge {int to, rev;Cap cap;};std::vector<std::pair<int, int>> pos;std::vector<std::vector<_edge>> g;};} // namespace atcoder#include <bits/stdc++.h>#define rep(a,n) for (ll a = 0; a < (n); ++a)using namespace std;using namespace atcoder;using ll = long long;typedef pair<ll,ll> P;typedef pair<ll,P> PP;typedef vector<vector<int> > Graph;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; }const int INF = 1e9;bool match[60][60];struct air{ll u,v,p,q,w;};int main(){ios::sync_with_stdio(false);cin.tie(nullptr);//inputll n,m,d;cin >> n >> m >> d;vector<air>vec(m);set<P>st;//頂点にidをふりたいvector<vector<ll > >stay(n+1);st.insert({0,1});st.insert({INF,n});rep(i,m){ll a,b,c,d_now,e;cin >> a >> b >> c >> d_now >> e;d_now += d;st.insert({c,a});st.insert({d_now,b});stay[a].push_back(c);stay[b].push_back(d_now);vec[i]={a,b,c,d_now,e};}stay[1].push_back(0);stay[n].push_back(INF);map<P,int> id;int cnt = 0;for(auto it=st.begin();it!=st.end();it++){//idをふるP p = *it;id[p]=cnt;cnt++;}mf_graph<ll>graph(cnt+1);rep(i,n+1){if(stay[i].size()==0)continue;sort(stay[i].begin(),stay[i].end());rep(j,stay[i].size()-1){graph.add_edge(id[{stay[i][j],i}],id[{stay[i][j+1],i}],INF);}}rep(i,m){ll from = id[{vec[i].p,vec[i].u}];ll to = id[{vec[i].q,vec[i].v}];graph.add_edge(from,to,vec[i].w);}cout << graph.flow(0,cnt-1) << endl;return 0;}