플로우2 AtCoder ABC 239 풀이 https://atcoder.jp/contests/abc239/tasks Tasks - Denso Create Programming Contest 2022(AtCoder Beginner Contest 239) AtCoder is a programming contest site for anyone from beginners to experts. We hold weekly programming contests online. atcoder.jp A. 구하라는 값을 출력해주면 됩니다. long long을 써줍시다. #include using namespace std; using ll = long long; int main() { ios::sync_with_stdio(0), cin.tie(0); ll x; cin.. 2022. 10. 1. 플로우 - Dinic, Edmonds-Karp 알고리즘 1. [ Dinic ] const int MAX = 808; vectorg[MAX]; int work[MAX], lv[MAX], cap[MAX][MAX], flow[MAX][MAX]; struct Dinic { void add(int u, int v, int c) { g[u].push_back(v); g[v].push_back(u); cap[u][v] += c; } bool bfs(int S, int T) { memset(lv, -1, sizeof(lv)); queueq; lv[S] = 0; q.push(S); while (q.size()) { int cur = q.front(); q.pop(); for (int nxt : g[cur]) { if (lv[nxt] == -1 && cap[cur][nxt] .. 2022. 8. 8. 이전 1 다음