oVeron

#include using namespace std;typedef long long ll;typedef pair pii;typedef pair pll;typedef tuple tiii;const int MAXN = 401;const int INF = 1e9;struct node{ int next; //다음 노드 int cap, fl; //용량, 유량};int N, P;vector graph[MAXN];int main(){ ios::sync_with_stdio(0); cin.tie(0), cout.tie(0); cin >> N >> P; while(P--) { int u, v; cin >> u >> v; graph[u].push_back({v, 1, 0}); graph[..

알고리즘/baekjoon 2024. 6. 29. 13:47