Codeforces Round#419 (div.1)

Problem B.点击打开链接

这个题找规律真是Excited...找出来是这样的:

#include<bits/stdc++.h>
#define mod 1000000007
#define maxn 200100
using namespace std;
int fac[maxn],inv[maxn],n,a[maxn],ans;
int C(int x,int y){return 1ll*fac[y]*inv[x]%mod*inv[y-x]%mod;}
int qpow(int a,int b){int ans=1,tmp=a;for(;b;b>>=1,tmp=1ll*tmp*tmp%mod)if(b&1)ans=1ll*ans*tmp%mod;return ans;}
int main(){
	scanf("%d",&n);
	fac[0]=inv[0]=1;
	for(int i=1;i<=n;++i)
		scanf("%d",&a[i]),fac[i]=1ll*i*fac[i-1]%mod;
	inv[n]=qpow(fac[n],mod-2);
	for(int i=n-1;i>=1;--i)inv[i]=1ll*inv[i+1]*(i+1)%mod;
	if(n%4==0){
		for(int i=1;i<=n;i++)
			ans=(ans+1ll*(i&1?1:-1)*C((i-1)>>1,(n>>1)-1)*a[i])%mod,ans=(ans+mod)%mod;//,printf("[%d]",(i&1?1:-1)*C((i-1)>>1,(n>>1)-1));
		printf("%d\n",ans);
	} else if(n%4==1){
		for(int i=1;i<=n;i+=2)
			ans=(ans+1ll*C(i>>1,n>>1)*a[i])%mod;
		printf("%d\n",ans);
	} else if(n%4==2){
		for(int i=1;i<=n;++i)
			ans=(ans+1ll*C((i-1)>>1,(n-1)>>1)*a[i])%mod;
		printf("%d\n",ans);
	} else {
		for(int i=2;i<=n;i+=2)
			ans=(ans+2ll*C((i-1)>>1,(n-2)>>1)*a[i])%mod;
		int lst=0;
		for(int i=1;i<=n/2;i+=2)
			ans=(ans+1ll*(C(i>>1,(n-2)>>1)-lst)*(a[i]-a[n+1-i]))%mod,ans=(ans+mod)%mod,lst=C(i>>1,(n-2)>>1);
		printf("%d\n",ans);
	}
}

Problem D.点击打开链接

首先需要补集转化，完了之后就是要求

<=(A,B,r)或<=(A,q,C)或<=(p,B,C)的点的个数

立刻发现这是一个类似于三维面积并的东西

于是枚举第三维,每次加入点时就用一个Set维护一个类似于轮廓线的东西

#include<bits/stdc++.h>
#define maxn 500100
using namespace std;
typedef pair<int,int> par;
long long ans=0,cur=0;
int n,p,q,r,x,y,A[maxn],B[maxn],C[maxn];
vector<par>v[maxn];
set<par>st;
int main(){
	scanf("%d%d%d%d",&n,&p,&q,&r);
	ans=1ll*p*q*r,cur=0;
	st.insert(par(0,1<<30));
	st.insert(par(1<<30,0));
	for(int i=1;i<=n;++i)
		scanf("%d%d%d",&A[i],&B[i],&C[i]);
	for(int i=1;i<=n;++i)
		v[r].push_back(par(A[i],B[i])),
		v[C[i]].push_back(par(A[i],q)),
		v[C[i]].push_back(par(p,B[i]));
	for(int i=r;i>=1;ans-=cur,i--){
		for(int j=0;j<v[i].size();++j){
			par wxh=v[i][j],xxt;
			set<par>::iterator it=st.lower_bound(wxh);
			if(it!=st.end()&&it->second>=wxh.second)continue;
			xxt.second=(it==st.end()?0:it->second);
			xxt.first=wxh.first;
			set<par>::iterator xt=it;xt--;
			while(true){
				cur+=1ll*(xxt.first-xt->first)*(wxh.second-xxt.second);
				if(xt->second>wxh.second)break;
				if(xt==st.begin()){xxt=*xt,st.erase(xxt);break;}
				else xxt=*xt,xt--,st.erase(xxt);
			}
			st.insert(wxh);
		}
	//	for(auto s:st)printf("{%d,%d}",s.first,s.second);
	//	printf("[%lld,%d,%d]\n",cur,i,p*q);
	}
	printf("%lld\n",ans);
}

Problem E.点击打开链接

先用一个dp求出每个长度的可选点个数(本质不同的长度只有log个)

然后就像在线段树上走一样,若左边的个数<k,则走右边.

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,k;
int main(){
	scanf("%lld%lld",&n,&k);
	if(k==1)return printf("1"),0;
	if(k==2)return printf("%lld",n),0;
	n-=2,k-=3;
	map<ll,ll>f,g,nxt;
	g[n]=1;
	while(g.size()){
		nxt.clear();
		for(auto s:g)if(s.first)
			f[-((s.first-1)>>1)]+=s.second,
			nxt[(s.first)>>1]+=s.second,
			nxt[(s.first-1)>>1]+=s.second;
		g=nxt;
	}
	for(auto s:f){
		//printf("[%d]",s.first);
		if(s.second>k){
			ll l=1,r=n,len=-s.first;
//			printf("[%d]",len);
			while(true){
				if(((r-l)>>1)==len&&k==0)
					return printf("%lld",((r-l)>>1)+1+l),0;
				map<ll,ll>A,B,C;
				ll mid=l+r>>1;
				A[mid-l]=1;
				B[(r-l)>>1]=1;
				while(A.size()){
					C.clear();
					for(auto qs:A)if(qs.first)
						B[(qs.first-1)>>1]+=qs.second,
						C[(qs.first)>>1]+=qs.second,
						C[(qs.first-1)>>1]+=qs.second;
					A=C;
				}
			//	printf("[%d]",B[len]);
				if(B[len]>k)r=mid-1;
				else l=mid+1,k-=B[len];
			}
		} else k-=s.second;
	}
}