2018宁夏邀请赛 补题

A

为什么搜不到题解
显然状压dp就行，但是没有想到很简便的处理三维二维的做法。

F. Clever King

最大权闭合子图裸题，直接dinic，要开longlong

#include<iostream>
#include <cstring>
#include <cmath>
#include <map>
#include <vector>
#include <algorithm>
#define int ll
using namespace std;
typedef long long ll;
const int M = 4000 + 5;
const int N = 8e2 + 5;
const int INF = 0x3f3f3f3f;
int n1,n2,tot;
struct node
{
    int v,w,to;
} edge[M*2];
int pre[N],cnt,dep[N];
int S,T,z,head[N],sum,id;
int n,m,q[N],cur[N];
void add(int u,int v,int w)
{
    edge[cnt]= {v,w,head[u]};
    head[u]=cnt++;
    edge[cnt]= {u,0,head[v]};
    head[v]=cnt++;
}
bool bfs()
{
    for(int i=0; i<=T; i++)
        dep[i]=0;
    dep[S]=1;
    int l=0,r=1;
    q[r]=S;
    while(l<r)
    {
        int u=q[++l];
        for(int i=head[u]; i!=-1; i=edge[i].to)
        {
            int v=edge[i].v;
            if(!dep[v]&&edge[i].w)
                dep[v]=dep[u]+1,q[++r]=v;
        }
    }
    return dep[T];
}
int dfs(int u,int mi)
{
    int res=0;
    if(mi==0||u==T)
        return mi;
    for(int &i=cur[u]; i!=-1; i=edge[i].to)
    {
        int v=edge[i].v;
        if(dep[u]+1==dep[v]&&edge[i].w)
        {
            int minn=dfs(v,min(mi-res,edge[i].w));
            edge[i].w-=minn;
            edge[i^1].w+=minn;
            res+=minn;
            if(res==mi)
                return res;
        }
    }
    if(res==0) dep[u]=0;
    return res;
}
int dinic()
{
    ll res=0;
    while(bfs())
    {
        memcpy(cur,head,sizeof(head));
//        cout<<res<<endl;
        res+=dfs(S,INF);
    }
    return res;
}

signed main(){
	int t;cin >> t;
	while(t--){
		cin >> n1 >> n2;
		S = 0;T = n1 + n2 + 1;cnt= 0;
		ll totp = 0;
		for(int i = 0; i <= n1 + n2 + 1; i++) head[i] = -1;
		
		for(int i = 1; i <= n1; i++){
			int w;cin >> w;
			totp += w;
			add(S,i,w);
		}
		for(int i = 1; i <= n2; i++){
			int w;cin >> w;
			add(i+n1,T,w);
		}
		
		int m1,m2,v;
		for(int u = 1; u <= n1; u++){
			cin >> m1 >> m2;
			for(int i = 0; i < m1; i++){
				cin >> v;
				add(u,v+n1,INF);
			}
			for(int i = 0; i < m2; i++){
				cin >> v;
				add(u,v,INF);
			}
		}
		int ans = dinic();
//		cout<<"ans: "<<ans<<endl;
		cout<<totp - ans<<endl;
	}
}

G. Trouble of Tyrant

利用了斜率优化思想的题目。可以证明决策具有单调性：选的中转点一定是逐渐靠近末尾点，于是用单调栈维护了一个下凸壳。

#include<iostream>
#include <cstring>
#include <cmath>
#include <map>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
#define int ll
const int N = 2e5 + 5;
struct node{
	int cnt,dis;
	node(int c=0,int d=0):cnt(c),dis(d){}
};
struct que{
	int id,val,ans;
	que(int i=0,int v=0):id(i),val(v){} 
}query[N];
int dp[N],sum[N],dis[N];
node stk[N];
int top;
bool cmp1(que &a,que &b){
	return a.val < b.val;
}
bool cmp2(que &a,que &b){
	return a.id < b.id;
} 
long long cal(node a,node b,node c){
	return (b.cnt - a.cnt)*(c.dis - a.dis) - (c.cnt - a.cnt)*(b.dis - a.dis);
}
signed main(){
	int t,n,q;
	cin >> t;
	while(t--){
		top = 0;
		cin >> n >> q;
		sum[n] = sum[n+1] = 0;
		for(int i = 2; i <= n; i++) cin >> dis[i];
		for(int i = 2; i <= n-1; i++) cin >> sum[i];
		for(int i = n; i >= 2; i--){
			sum[i] += sum[i+1];
			dp[n -i] = sum[i]+dis[i];
		}
		for(int i = 0; i < n - 1; i++){
			if(top && stk[top].dis < dp[i]) continue;
			while(top >= 2 && cal(stk[top-1],stk[top],node(i,dp[i]))<=0 ) top--;
			stk[++top] = node(i,dp[i]);
		}
		
		for(int i = 0; i < q; i++){
			query[i].id = i;
			cin >> query[i].val;
		}
		sort(query,query+q,cmp1);
		int pos = top;
		for(int i = 0; i < q; i++){
			int d = query[i].val;
			while(pos >= 2 && ((stk[pos].dis + (stk[pos].cnt+1)*query[i].val) > (stk[pos-1].dis + (stk[pos-1].cnt+1)*query[i].val))){
				pos--;
			}
			query[i].ans = stk[pos].dis + (stk[pos].cnt+1)*query[i].val;
		}
		sort(query,query+q,cmp2);
		for(int i = 0; i < q; i++){
			cout << query[i].ans<<" \n"[i == q-1];
		}	
	}
}

H. Rock Paper Scissors Lizard Spock.

fft有空再补