lickelon.log

문제 링크 : boj.kr/14286난이도 : P3태그 : 최대 유량코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFFusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;class Flow { vector> edge; vector> f, c; int n;public: Flow(int n) { this->n = n; edge.resize(n); f = vector>(n, vector(n)); c = vector>(n, vector(n)); ..

문제 링크 : boj.kr/4672난이도 : P3태그 : 최대 유량코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFFusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;class Flow { vector> edge; vector> f, c; int n;public: Flow(int n) { this->n = n; edge.resize(n); f = vector>(n, vector(n)); c = vector>(n, vector(n)); ..

문제 링크 : boj.kr/1420난이도 : P2태그 : 최대 유량코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFFusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;class Flow { vector> edge; map f, c; int n;public: Flow(int n) { this->n = n; edge.resize(n); } int flow(int start, int end) { init(); int ans = 0;..

문제 링크 : boj.kr/3295난이도 : P2태그 : 최대 유량코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFFusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;class Flow { vector> edge; vector> f, c; int n;public: Flow(int n) { this->n = n; edge.resize(n); f = vector>(n, vector(n)); c = vector>(n, vector(n)); ..

문제 링크 : http://boj.kr/3683난이도 : P2태그 : 최대 유량코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFFusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;class Flow { vector> edge; vector> f, c; int n;public: Flow(int n) { this->n = n; edge.resize(n); f = vector>(n, vector(n)); c = vector>(n, vector..

문제 링크 : boj.kr/1671난이도 : P3태그 : 최대 유량코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFFusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;class Flow { vector> edge; vector> f, c; int n;public: Flow(int n) { this->n = n; edge.resize(n); f = vector>(n, vector(n)); c = vector>(n, vector(n)); ..

문제 링크 : boj.kr/11375난이도 : P4태그 : 최대 유량코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFFusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;class Flow { vector> edge; vector> f, c; int n;public: Flow(int n) { this->n = n; edge.resize(n); f = vector>(n, vector(n)); c = vector>(n, vector(n)); ..

문제 링크 : boj.kr/10976난이도 : P4태그 : 최대 유량코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFFusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;class Flow { vector> edge; vector> f, c; int n;public: Flow(int n) { this->n = n; edge.resize(n); f = vector>(n, vector(n)); c = vector>(n, vector(n)); ..

문제 링크 : boj.kr/2367난이도 : P4태그 : 최대 유량코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFFusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;class Flow { vector> edge; vector> f, c; int n;public: Flow(int n) { this->n = n; edge.resize(n); f = vector>(n, vector(n)); c = vector>(n, vector(n)); ..

문제 링크 : boj.kr/11378난이도 : P3태그 : 최대 유량코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFFusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;int flow(vector> &edge, int start, int end) { int n = edge.size(); vector> c(n, vector(n)); vector> f(n, vector(n)); //init for(int i = 0; i parent(n, -1); queue _q; ..