Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

clarify constraints just in case #156

Merged
merged 1 commit into from
Mar 17, 2023
Merged

clarify constraints just in case #156

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 1 addition & 0 deletions document_en/mincostflow.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -76,6 +76,7 @@ It returns $g$ as the list of the changepoints, that satisfies the followings.
Let $x$ be the maximum cost among all edges.

- $s \neq t$
- $0 \leq s, t \lt n$
- You can't call `min_cost_slope` or `min_cost_max_flow` multiple times.
- The total amount of the flow is in `Cap`.
- The total cost of the flow is in `Cost`.
Expand Down
1 change: 1 addition & 0 deletions document_ja/mincostflow.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -76,6 +76,7 @@ vector<pair<Cap, Cost>> graph.slope(int s, int t, Cap flow_limit);
辺のコストの最大を $x$ として

- $s \neq t$
- $0 \leq s, t \lt n$
- `min_cost_slope`や`min_cost_max_flow`を合わせて複数回呼んだときの挙動は未定義
- `s`から`t`へ流したフローの流量が `Cap` に収まる。
- 流したフローのコストの総和が `Cost` に収まる。
Expand Down