lickelon.log

문제 링크 : 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; ..

문제 링크 : boj.kr/27524난이도 : 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 Trie {public: unordered_map children; ll end; ll M; Trie() { end = 0; M = 0; } void insert(vector& key, ll score) { this->_insert(key, 0, score); ..

문제 링크 : boj.kr/1605난이도 : P3태그 : KMP코드#include #define all(x) (x).begin(), (x).end()#define INF 987654321using namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;vector getPi(vector P) { int L = (int)P.size(); vector Pi(L,0); int j = 0; for(int i = 1; i 0 && P[i] != P[j]) j = Pi[j-1]; if(P[i] == P[j]) Pi[i] = ++j; ..

문제 링크 : boj.kr/27485난이도 : P4태그 : KMP코드#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;vector getPi(string P) { int L = (int)P.size(); vector Pi(L,0); int j = 0; for(int i = 1; i 0 && P[i] != P[j]) j = Pi[j-1]; if(P[i] == P[j]) Pi[i] = ++j..

문제 링크 : boj.kr/3033난이도 : 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;vector getsa(string &s) { int n = s.size(); vector sa(n), g(n+1), ng(n+1); for(int i = 0; i getlcp(vector &sa, string &s){ int n = s.size(); vector lcp(n), isa(n); for(int i..

문제 링크 : http://boj.kr/9249난이도 : 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;vector getsa(string &s) { int n = s.size(); vector sa(n), g(n+1), ng(n+1); for(int i = 0; i getlcp(vector &sa, string &s){ int n = s.size(); vector lcp(n), isa(n); fo..

문제 링크 : boj.kr/1605난이도 : 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;vector getsa(string &s) { int n = s.size(); vector sa(n), g(n+1), ng(n+1); for(int i = 0; i getlcp(vector &sa, string &s){ int n = s.size(); vector lcp(n), isa(n); for(int i..