最大流 1 - المسألة

#456. 最大流 1

الإحصائيات

这是一道简单版本的最大流，你可以预期使用正确实现的 Dinic 算法或是其他算法来通过本题。

给定 $n$ 个点，$m$ 条边，给定每条边的容量，求从点 $s$ 到点 $t$ 的最大流。

输入格式

第一行四个整数 $ n , m , s , t $。

接下来的 $ m $ 行，每行三个整数 $ u , v , c $，表示 $ u $ 到 $ v $，流量为 $ c $ 的一条边。

输出格式

输出点 $ s $ 到点 $ t $ 的最大流。

样例数据

样例输入

样例输出

子任务

对于所有数据 $ 1 \leq n \leq 500$, $1 \leq m \leq 20\,000$, $1 \leq c \leq 10^9$

About Issues

We understand that our problem archive is not perfect. If you find any issues with the problem, including the statement, scoring configuration, time/memory limits, test cases, etc.

You may use this form to submit an issue regarding the problem. A problem moderator will review your issue and proceed it properly.

STOP! Before you submit an issue, please READ the following guidelines:

This is not a place to publish a discussion, editorial, or requests to debug your code. Your issue will only be visible by you and problem moderators. Other users will not be able to view or reply your issues.
Do not submit duplicated issues. If you have already submitted one, please wait for an moderator to review it. Submitting multiple issues will not speed up the review process and might cause your account to be banned.
Issues must be filed in English or Chinese only.
Be sure your issue is related to this problem. If you need to submit an issue regarding another problem, contest, category, etc., you should submit it to the corresponding page.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0