2020.8.10集训

matrix

description

给定两个长度为$n$的数列$l$,$t$,分别作为$n\times n$的矩阵的第一列和第一行，其他位置的矩阵满足

$$F_{i,j}=a\times F_{i,j-1}+b\times F_{i-1,j}$$

给定$a,b$，求$F_{n,n}$

$n\le 10^5$

solution

考虑一个数的贡献，$l_i(i>2)$到$F_{n,n}$的贡献是

$$a^{n-1}{b}^{n-i}\left(\genfrac{}{}{0ex}{}{n-1+n-i}{n-1}\right)$$

$t_i$的贡献也同理

复杂度$O(n\log n)$

code

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

# define Rep(i,a,b) for(int i=a;i<=b;i++)
# define _Rep(i,a,b) for(int i=a;i>=b;i--)
# define RepG(i,u) for(int i=head[u];~i;i=e[i].next)

typedef long long ll;

const int N=2e5+5;
const int mod=1e9+7;

template<typename T> void read(T &x){
   x=0;int f=1;
   char c=getchar();
   for(;!isdigit(c);c=getchar())if(c=='-')f=-1;
   for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+c-'0';
    x*=f;
}

int n,a,b;
int l[N],t[N];
int fac[N],inv[N];
int faca[N],facb[N];
int ans;

int Qpow(int base,int ind){
	int res=1;
	while(ind){
		if(ind&1)res=1ll*res*base%mod;
		base=1ll*base*base%mod;
		ind>>=1; 
	}
	return res;
}

int C(int n,int m){
	return 1ll*fac[n]*inv[m]%mod*inv[n-m]%mod;	
}

int main()
{
	freopen("matrix.in","r",stdin);
	freopen("matrix.out","w",stdout);
	read(n),read(a),read(b);
	Rep(i,1,n)read(l[i]);
	Rep(i,1,n)read(t[i]);
	if(n==1)return printf("%d\n",t[1]),0;
	fac[0]=inv[0]=faca[0]=facb[0]=1;
	Rep(i,1,2*n)fac[i]=1ll*i*fac[i-1]%mod;
	Rep(i,1,2*n)inv[i]=Qpow(fac[i],mod-2);	
	Rep(i,1,n)faca[i]=1ll*faca[i-1]*a%mod;
	Rep(i,1,n)facb[i]=1ll*facb[i-1]*b%mod;
	Rep(i,2,n)ans+=1ll*t[i]*C(n-i+n-2,n-i)%mod*faca[n-i]%mod*facb[n-1]%mod,ans%=mod;
	Rep(i,2,n)ans+=1ll*l[i]*C(n-i+n-2,n-i)%mod*faca[n-1]%mod*facb[n-i]%mod,ans%=mod;
	printf("%d\n",ans);
	return 0;
}

value

description

给定$n$个物品，价值$v_i$，代价$w_i$

每次选择一个$v_i$之后，其他的物品的价值都会减掉$w_i$

问最大代价

$n\le 5000,w_i\le 10^5$

solution

考虑贪心，代价小的显然先选，所以排序后背包即可

复杂度 O ( n max ⁡ { w i } ) O(n\max\{w_i\}) O(nmax{wi​})

code

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

# define Rep(i,a,b) for(int i=a;i<=b;i++)
# define _Rep(i,a,b) for(int i=a;i>=b;i--)
# define RepG(i,u) for(int i=head[u];~i;i=e[i].next)

typedef long long ll;

const int N=3e5+5;
const int mod=1e9+7;

template<typename T> void read(T &x){
   x=0;int f=1;
   char c=getchar();
   for(;!isdigit(c);c=getchar())if(c=='-')f=-1;
   for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+c-'0';
    x*=f;
}

int n;
int f[N];
int ans;

struct node{
	int v,w;
	bool operator < (const node &cmp)const{
		return w<cmp.w;
	}
}a[N];

int main()
{
	freopen("value.in","r",stdin);
	freopen("value.out","w",stdout);
	read(n);
	Rep(i,1,n)read(a[i].v),read(a[i].w);
	sort(a+1,a+n+1);
	Rep(i,1,n)
		_Rep(j,2e5,a[i].w)
			if(a[i].v-(j-a[i].w)>=0)f[j]=max(f[j],f[j-a[i].w]+a[i].v-(j-a[i].w));
	Rep(i,0,2e5)ans=max(ans,f[i]);
	printf("%d\n",ans);
	return 0;
}

binary

description
一个长度为$n$的序列

1 x y 把$a_x$替换为$y$
2 x y 求${\sum }_{i=1}^n(a_i+x)andy$

solution

考虑对于每一个二进制位分别处理
一个数在第$i$位上的贡献当且仅当他$\mathrm{m}\mathrm{o}\mathrm{d}{2}^{i+1}$的结果在$[2^i,2^{i+1}-1]$上

所以我们对于每一个二进制位开一个树状数组，每次相当于进行一次区间查询即可

复杂度$O(n{\log }^{2}n)$

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

# define Rep(i,a,b) for(int i=a;i<=b;i++)
# define _Rep(i,a,b) for(int i=a;i>=b;i--)
# define RepG(i,u) for(int i=head[u];~i;i=e[i].next)

typedef long long ll;

const int N=1e5+5;
const int M=1<<20+1;

template<typename T> void read(T &x){
   x=0;int f=1;
   char c=getchar();
   for(;!isdigit(c);c=getchar())if(c=='-')f=-1;
   for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+c-'0';
    x*=f;
}

int n,q;
int a[N];
int bit[35];

struct BIT{
	int bit[M];
	int lowbit(int o){return o&-o;}
	void add(int o,int x){
		o++;
		for(;o<M;o+=lowbit(o))bit[o]+=x;	
	}
	int ask(int o){
		o++;
		int res=0;
		for(;o;o-=lowbit(o))res+=bit[o];
		return res;	
	}
}t[20];

int main()
{
	freopen("binary.in","r",stdin);
	freopen("binary.out","w",stdout);
	read(n),read(q);
	Rep(i,1,n)read(a[i]);
	Rep(i,1,n)
		Rep(j,0,19)
			t[j].add(a[i]%(1<<j+1),1);
	while(q--){
		int opt,x,y;
		read(opt),read(x),read(y);
		if(opt==1){
			Rep(i,0,19)t[i].add(a[x]%(1<<i+1),-1);
			a[x]=y;
			Rep(i,0,19)t[i].add(a[x]%(1<<i+1),1);
		}
		else{
			ll res=0;
			Rep(i,0,19)
				if(y&(1<<i)){
					int p=1<<i+1;
					int r=((1<<i+1)-1-x%p+p)%p,l=((1<<i)-x%p+p)%p;
					if(l<=r)res+=1ll*(t[i].ask(r)-t[i].ask(l-1))*(1ll<<i);
					else res+=1ll*(t[i].ask(r)+t[i].ask(p-1)-t[i].ask(l-1))*(1ll<<i);	
				}
			printf("%lld\n",res);
		}
	}
	return 0;
}