0w1

Entries from 2016-09-19 to 1 day

GCJ 2009 R2 pC. Stock Charts ( Bipartite Matching, Hungarian or Dinic )

Dashboard - Round 2 2009 - Google Code Jam Let us first represent the relations of the charts by directing edges from chart A to chart B iff A can be laid under B on the same sheet of paper ( as the description says ) without interfering o…

Template Dinic

Given N nodes, M arcs, returns max flow from 0 to N. #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair< int, int > pii; typedef pair< int, ll > pil; typedef pair< ll, int > pli; typedef pair< ll, ll > pll; typedef vector< i</bits/stdc++.h>…

CFR 558 E. A Simple Task ( Segment Tree )

Problem - E - Codeforces Quite creative a problem. If it were no problem E, I would have really thought performing brute force counting sort will somehow pass. Anyways, we will try bundling the same alphabets together for the sake of impro…