Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- // Knapsack DP is harder than FFT.
- #include<bits/stdc++.h>
- using namespace std;
- typedef long long ll; typedef pair<int,int> pii; typedef pair<ll,ll> pll;
- #define ff first
- #define ss second
- #define pb emplace_back
- #define AI(x) begin(x),end(x)
- template<class I>bool chmax(I&a,I b){return a<b?(a=b,true):false;}
- template<class I>bool chmin(I&a,I b){return b<a?(a=b,true):false;}
- #ifdef OWO
- #define debug(args...) SDF(#args, args)
- #define OIU(args...) ostream& operator<<(ostream&O,args)
- #define LKJ(S,B,E,F) template<class...T>OIU(S<T...>s){O<<B;int c=0;for(auto i:s)O<<(c++?", ":"")<<F;return O<<E;}
- LKJ(vector,'[',']',i)LKJ(deque,'[',']',i)LKJ(set,'{','}',i)LKJ(multiset,'{','}',i)LKJ(unordered_set,'{','}',i)LKJ(map,'{','}',i.ff<<':'<<i.ss)LKJ(unordered_map,'{','}',i.ff<<':'<<i.ss)
- template<class...T>void SDF(const char* s,T...a){int c=sizeof...(T);if(!c){cerr<<"\033[1;32mvoid\033[0m\n";return;}(cerr<<"\033[1;32m("<<s<<") = (",...,(cerr<<a<<(--c?", ":")\033[0m\n")));}
- template<class T,size_t N>OIU(array<T,N>a){return O<<vector<T>(AI(a));}template<class...T>OIU(pair<T...>p){return O<<'('<<p.ff<<','<<p.ss<<')';}template<class...T>OIU(tuple<T...>t){return O<<'(',apply([&O](T...s){int c=0;(...,(O<<(c++?", ":"")<<s));},t),O<<')';}
- #else
- #pragma GCC optimize("Ofast")
- #define debug(...) ((void)0)
- #endif
- /* Dinic here */
- // prob: TIOJ 1236
- // name: din
- // func: add flow
- const int N = 225, INF = INT_MAX;
- struct DIN{
- struct E{
- int v, c, r;
- E(int v, int c, int r):
- v(v), c(c), r(r){}
- };
- vector<E> adj[N];
- void add(int u, int v, int c){
- adj[u].pb(v, c, (int) adj[v].size());
- adj[v].pb(u, 0, (int) adj[u].size() - 1);
- }
- int n, s, t;
- void init(int nn, int ss, int tt){
- n = nn, s = ss, t = tt;
- for(int i = 0; i <= n; ++i)
- adj[i].clear();
- }
- int le[N], it[N];
- int bfs(){
- fill(le, le + N, -1); le[s] = 0;
- queue<int> q; q.push(s);
- while(!q.empty()){
- int u = q.front(); q.pop();
- for(auto [v, c, r]: adj[u]){
- if(c > 0 and le[v] == -1)
- le[v] = le[u] + 1, q.push(v);
- }
- }
- return ~le[t];
- }
- int dfs(int u, int f){
- if(u == t) return f;
- for(int &i = it[u]; i < (int) adj[u].size(); ++i){
- auto &[v, c, r] = adj[u][i];
- if(c > 0 and le[v] == le[u] + 1){
- int d = dfs(v, min(c, f));
- if(d > 0){
- c -= d;
- adj[v][r].c += d;
- return d;
- }
- }
- }
- return 0;
- }
- ll flow(){
- ll ans = 0, d;
- while(bfs()){
- fill(it, it + N, 0);
- while((d = dfs(s, INF)) > 0) ans += d;
- }
- return ans;
- }
- } din;
- /* Dinic end */
- signed main(){
- ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
- int n; cin >> n;
- din.init(n * 2 + 1, 0, n * 2 + 1);
- for(int i = 1; i <= n; ++i){
- int v; cin >> v;
- din.add(i, i + n, v);
- }
- int m; cin >> m;
- vector<bool> in(n + 1, 0), ou(n + 1, 0);
- for(int u, v, c; m; --m){
- cin >> u >> v;
- in[v] = 1; ou[u] = 1;
- din.add(u + n, v, INF);
- }
- for(int i = 1; i <= n; ++i){
- if(!in[i]) din.add(0, i, INF);
- if(!ou[i]) din.add(i + n, n * 2 + 1, INF);
- }
- cout << din.flow();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement