King's Pilots

题目链接   （双层图， 一层维护工作，一层维护政策）

 #include <bits/stdc++.h>
 using namespace std;

 inline int read()
 {
     int x=,f=;char ch=getchar();
     while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}
     while(ch>=''&&ch<=''){x=x*+ch-'';ch=getchar();}
     return x*f;
 }

 /********************************************************************/

 const int MAXN = ;
 const int MAXM = ;
 const int INF = 0x3f3f3f3f;

 struct Edge
 {
     int to, next, cap, flow, cost;
     int x, y;
 } edge[MAXM],HH[MAXN],MM[MAXN];
 int head[MAXN],tol;
 int pre[MAXN],dis[MAXN];
 bool vis[MAXN];
 int N, M;
 char map[MAXN][MAXN];
 void init()
 {
     N = MAXN;
     tol = ;
     memset(head, -, sizeof(head));
 }
 void addedge(int u, int v, int cap, int cost)//左端点，右端点，容量，花费
 {
     edge[tol]. to = v; edge[tol]. cap = cap; edge[tol]. cost = cost;
     edge[tol]. flow = ; edge[tol]. next = head[u]; head[u] = tol++;
     edge[tol]. to = u; edge[tol]. cap = ; edge[tol]. cost = -cost;
     edge[tol]. flow = ; edge[tol]. next = head[v]; head[v] = tol++;
 }
 bool spfa(int s, int t)
 {
     queue<int>q;
     for(int i = ; i < N; i++)
     {
         dis[i] = INF;
         vis[i] = false;
         pre[i] = -;
     }
     dis[s] = ;
     vis[s] = true;
     q.push(s);
     while(!q.empty())
     {
         int u = q.front();
         q.pop();
         vis[u] = false;
         for(int i = head[u]; i != -; i = edge[i]. next)
         {
             int v = edge[i]. to;
             if(edge[i]. cap > edge[i]. flow &&
                     dis[v] > dis[u] + edge[i]. cost )
             {
                 dis[v] = dis[u] + edge[i]. cost;
                 pre[v] = i;
                 if(!vis[v])
                 {
                     vis[v] = true;
                     q.push(v);
                 }
             }
         }
     }
     if(pre[t] == -) return false;
     else return true;
 }
 //返回的是最大流， cost存的是最小费用
 int minCostMaxflow(int s, int t, int &cost)
 {
     int flow = ;
     cost = ;
     while(spfa(s,t))
     {
         int Min = INF;
         for(int i = pre[t]; i != -; i = pre[edge[i^]. to])
         {
             if(Min > edge[i]. cap - edge[i]. flow)
                 Min = edge[i]. cap - edge[i]. flow;
         }
         for(int i = pre[t]; i != -; i = pre[edge[i^]. to])
         {
             edge[i]. flow += Min;
             edge[i^]. flow -= Min;
             cost += edge[i]. cost * Min;
         }
         flow += Min;
     }
     return flow;
 }
 const int inf = 1e9;
 int P[],p,q,S[],T[];
 void solve()
 {
     init();
     int m,n,k,sum=;
     scanf("%d%d",&n,&k);
     for(int i=;i<=n;i++)
         scanf("%d",&P[i]),sum+=P[i];
     scanf("%d%d%d",&m,&p,&q);
     for(int i=;i<=m;i++)
         scanf("%d%d",&S[i],&T[i]);
     int st=,ed=;
     for(int i=;i<=n;i++)
     {
         addedge(st,i,P[i],);
         addedge(n+i,ed,P[i],);
     }
     addedge(st,n+,k,);
     for(int i=p;i<=n;i++)
         addedge(st,n+i,inf,q);
     for(int i=;i<n;i++)
         addedge(i,i+,inf,);
     for(int i=;i<n;i++)
         addedge(n+i,n+i+,inf,);
     for(int i=;i<=n;i++)
     {
         for(int j=;j<=m;j++)
             if(i+T[j]<=n)
                 addedge(i,n+i+T[j],inf,S[j]);
     }
     int ans1=,ans2=;
     ans1=minCostMaxflow(st,ed,ans2);
     if(ans1==sum)printf("%d\n",ans2);
     else printf("No solution\n");
 }
 int main()
 {
     int t;
     scanf("%d",&t);
     while(t--)solve();
     return ;
 }