[SEERC2018] + [DZY loves fibonacci numbers]

我要哭了....写完的blog突然被快于脑速的手速删了...没了...!!!....那我贴个代码就跑了算了...sigh...

A题

B题

C题 (抄了heltion的板子过的...实践出真知hhh)

#include<cstdio>
#include<iostream>
#include<cstdlib>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#define N 202
#define maxn 202
#define ll long long
#define mo 1000000007
using namespace std;
int n,m,dis[N][N],a[N];
int tot=0,white=0,node[N];
int ans;int vis[N],tmp[N];
int mat[N][N],g[N][N];
int cnt[N];
void clique(int num,int dep,int &ans){
	if(num==0){
		if(dep>ans)ans=dep;
		return;
	}
	int sum=0,j;
	int al=tot,all[N];
	for(int i=0;i<n;i++)all[i]=node[i];
	for(int i=0;i<tot;i++){
		if(dep+num-i<=ans)return;
		if(dep+cnt[node[i]]<=ans)return;
		for(sum=0,j=i+1;j<tot;j++)if(mat[node[i]][node[j]])tmp[sum++]=node[j];
		tot=sum;for(j=0;j<n;j++)node[j]=tmp[j];
		clique(tot,dep+1,ans);
		tot=al;for(int j=0;j<n;j++)node[j]=all[j];
	}
}
int maxclique(){
	int i,j;
	for(ans=0,i=n-1;i>=0;i--){
	 for(tot=0,j=i+1;j<n;j++)if(mat[i][j])node[tot++]=j;
		clique(tot,1,ans);
		cnt[i]=ans;
	}
	
	return ans;
}
int check(int mid){
	for(int i=0;i<n;i++)
	 for(int j=0;j<n;j++)mat[i][j]=1;
	for(int i=0;i<n;i++)
	 for(int j=i+1;j<n;j++)
	  if(a[i]==1 && a[j]==1 && dis[i][j]>mid){
	  	mat[i][j]=0;mat[j][i]=0;
	  }
	 if(maxclique()>=white+m)return 1;else return 0;
}
int main(){
    scanf("%d%d",&n,&m);
    for(int i=0;i<n;i++)scanf("%d",&a[i]);
    for(int i=0;i<n;i++)if(a[i]==0)white++;
    for(int i=0;i<n;i++)
     for(int j=0;j<n;j++)dis[i][j]=1000000000;
    for(int i=0;i<n;i++)dis[i][i]=0;
    for(int i=1;i<n;i++){
    	int u,v;scanf("%d%d",&u,&v);
    	u--;v--;
    	dis[u][v]=1;dis[v][u]=1;
    }
    for(int k=0;k<n;k++)
     for(int i=0;i<n;i++)
      for(int j=0;j<n;j++)dis[i][j]=min(dis[i][j],dis[i][k]+dis[k][j]);
    int L=0,R=n;
    int tmp=n;
    while(L<=R){
    	int mid=(L+R)/2;
    	if(check(mid)){tmp=mid;R=mid-1;}else L=mid+1;
    }
    printf("%d\n",tmp);
    return 0;
}

D题

#include<cstdio>
#include<iostream>
#include<cstdlib>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<queue>
#define N 2020
#define ll long long
#define mo 1000000007
using namespace std;
queue<int>q;
int dp[N][N],head[N],vet[N],pri[N],size[N],jie[N];
int n,m,K,tmp[N],edgenum;
void add(int u,int v,int w){edgenum++;vet[edgenum]=v;jie[edgenum]=head[u];head[u]=edgenum;pri[edgenum]=w;}
void dfs(int u,int ff){
	int e=head[u];size[u]=1;
	while(e>0){
		int v=vet[e];
		if(v!=ff){
			dfs(v,u);
			for(int i=0;i<=n;i++)tmp[i]=1000000000;
			for(int i=0;i<=size[u];i++){
				for(int j=0;j<=size[v];j++){
					if(i+j>2*m)continue;
					if(j%2==1){
						tmp[i+j]=min(tmp[i+j],dp[u][i]+dp[v][j]+pri[e]);
						tmp[i+j+1]=min(tmp[i+j+1],dp[u][i]+dp[v][j]+pri[e]);
					}else{
						tmp[i+j]=min(tmp[i+j],dp[u][i]+dp[v][j]+pri[e]*2);
						tmp[i+j+1]=min(tmp[i+j+1],dp[u][i]+dp[v][j]+pri[e]*2);
					}
				}
			}
			size[u]+=size[v];
			for(int i=0;i<=size[u];i++)dp[u][i]=tmp[i];
		}
		e=jie[e];
	}
	
}
int main(){
	int cas;
	scanf("%d",&cas);
	while(cas--){
		scanf("%d%d%d",&n,&m,&K);
		memset(dp,0,sizeof(dp));
		memset(head,0,sizeof(head));
		edgenum=0;
		for(int i=1;i<n;i++){
			int u,v,w;
			scanf("%d%d%d",&u,&v,&w);
			add(u,v,w);
			add(v,u,w);
		}
		dfs(1,0);
		int ans=1000000000;
		for(int i=0;i<=min(2*m,n);i+=2)ans=min(ans,dp[1][i]+(i/2*K));
		printf("%d\n",ans);
	}
	return 0;
}

E题

F题

G题

#include<cstdio>
#include<iostream>
#include<cstdlib>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#define N 8022020
#define ll long long
#define mo 1000000007
int n,m,nn;
ll tree[2][N],ans[2][N];
void modify(int op,int p,int l,int r,int deep,int x){
	if(l==r){tree[op][p]^=1;return;}
	int mid=(l+r)/2;
	if(x<=mid)modify(op,p+p,l,mid,deep+1,x);
	 else modify(op,p+p+1,mid+1,r,deep+1,x);
	if(tree[op][p]!=-1)ans[op][deep]--;
	if(tree[op][p+p]==tree[op][p+p+1])tree[op][p]=tree[op][p+p];else
	 tree[op][p]=-1;
	if(tree[op][p]!=-1)ans[op][deep]++;
}
int main(){
	scanf("%d%d",&n,&m);
	nn=n;n=1<<n;
	ll sum=0;
	for(int i=1;i<=nn;i++){
		ans[0][i]=ans[1][i]=1<<(i-1);
		sum=sum*4+1;
	}
	while(m--){
		int op,x;
		scanf("%d%d",&op,&x);
		modify(op,1,1,n,1,x);
		ll tmp=0;
		for(int i=1;i<=nn;i++){
			tmp+=ans[0][i]*ans[1][i];
		}
		printf("%lld\n",(ll)(sum-tmp)*4+1);
	}
	return 0;
}

H题

I题

J题

K题

DZY loves Fibonacci numbers(漂亮!!!)

#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <ctime>
#include <string>
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <iostream>
#include <algorithm>
#define ll long long
#define N 303030
#define M 1201010
#define mo 1000000009
using namespace std;
ll bas=276601605,q1=691504013,q2=308495997;
int n,m;
int a[N];
ll s[N],m1[N],m2[N];
struct node{ll a,b,sum;}tree[M];
void push_down(int p,int st,int ed){
	int mid=(st+ed)/2;
	ll aa=tree[p].a,bb=tree[p].b;
	if(aa==0 && bb==0)return;
	int len1=mid-st+1,len2=ed-mid;
	tree[p+p].a=(tree[p+p].a+aa)%mo;
	tree[p+p].b=(tree[p+p].b+bb)%mo;
	tree[p+p+1].a=(tree[p+p+1].a+aa*m1[len1]%mo)%mo;
	tree[p+p+1].b=(tree[p+p+1].b+bb*m2[len1]%mo)%mo;
	tree[p+p].sum=(tree[p+p].sum+aa*(m1[len1+2]-m1[2]+mo)%mo)%mo;
	tree[p+p].sum=(tree[p+p].sum-bb*(m2[len1+2]-m2[2]+mo)%mo+mo)%mo;
	tree[p+p+1].sum=(tree[p+p+1].sum+aa*m1[len1]%mo*(m1[len2+2]-m1[2]+mo)%mo)%mo;
	tree[p+p+1].sum=(tree[p+p+1].sum-bb*m2[len1]%mo*(m2[len2+2]-m2[2]+mo)%mo+mo)%mo;
	tree[p].a=0;
	tree[p].b=0;
}
void update(int p,int l,int r,int st,int ed,ll x,ll y){
	int mid=(st+ed)/2;
	int len=r-l+1;
	if(l==st && r==ed){
		tree[p].a=(tree[p].a+x)%mo;
		tree[p].b=(tree[p].b+y)%mo;
		tree[p].sum=(tree[p].sum+(x*(m1[len+2]-m1[2]+mo)%mo)%mo)%mo;
		tree[p].sum=(tree[p].sum-(y*(m2[len+2]-m2[2]+mo)%mo)%mo+mo)%mo;
		//printf("%d %d %d %lld\n",p,st,ed,tree[p].sum);
		return;
	}
	push_down(p,st,ed);
	len=mid-l+1;
	if(r<=mid)update(p+p,l,r,st,mid,x,y);else
	 if(l>mid)update(p+p+1,l,r,mid+1,ed,x,y);else
	  update(p+p,l,mid,st,mid,x,y),update(p+p+1,mid+1,r,mid+1,ed,x*m1[len]%mo,y*m2[len]%mo);
	tree[p].sum=(tree[p+p].sum+tree[p+p+1].sum)%mo;
}
ll query(int p,int l,int r,int st,int ed){
	if(l==st && r==ed)return tree[p].sum;
	push_down(p,st,ed);
	int mid=(st+ed)/2;
	if(r<=mid)return query(p+p,l,r,st,mid);else
	 if(l>mid)return query(p+p+1,l,r,mid+1,ed);else
	  return (query(p+p,l,mid,st,mid)+query(p+p+1,mid+1,r,mid+1,ed))%mo;
}
int main(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)scanf("%d",&a[i]),s[i]=(s[i-1]+a[i])%mo;
	m1[0]=1;m2[0]=1;
	for(int i=1;i<=n+5;i++){
		m1[i]=m1[i-1]*q1%mo;
		m2[i]=m2[i-1]*q2%mo;
	}
	//memset(tree,0,sizeof(0));
	while(m--){
		int op,l,r;
		scanf("%d%d%d",&op,&l,&r);
		if(op==1){update(1,l,r,1,n,1,1);}else{
			ll ans=(bas*query(1,l,r,1,n)%mo+s[r]-s[l-1]+mo)%mo;
			printf("%lld\n",ans);
		}
	}
	return 0;
}