国庆七连测（四）

题目比较简单，没有什么好讲的。放一下题目。
SP16244 KUSAC - Kusac
SP16409 LOPOV - Lopov
SP16180 RATAR - Ratar

代码：

Kusac

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int gcd(int a,int b){
	while(b!=0){
		int tmp=a%b;
		a=b,b=tmp;
	}
	return a;
}
int n,m,d;
int main(){
	freopen("kusac.in","r",stdin);
	freopen("kusac.out","w",stdout);
	cin>>n>>m;
	d=gcd(n,m);
	m/=d;
	printf("%d\n",(m-1)*d);
	return 0;
}

Lopov

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define rint register int
using namespace std;
const int maxn=300000+1000;
int n,k;
struct node{
	int w,v;
}a[maxn];
int c[maxn],f[maxn],used[maxn];
long long ans=0;
inline void read(int &x){
	x=0;char tmp=getchar();
	while(tmp<'0'||tmp>'9') tmp=getchar();
	while(tmp>='0'&&tmp<='9') x=(x<<1)+(x<<3)+tmp-'0',tmp=getchar();
}
bool cmp1(node x,node y){
	if(x.v==y.v) x.w<y.w;
	return x.v>y.v;
}
bool cmp2(int x,int y){
	return x>y;
}
inline int ld(int x){
	int l=0,r=k;
	while(l<r){
		int mid=(l+r)>>1;mid++;
		if(c[mid]>=x) l=mid;
		else r=mid-1;
	}
	return l;
}
inline int find(int x){
	if(f[x]!=x) f[x]=find(f[x]);
	return f[x];
}
int main(){
	freopen("lopov.in","r",stdin);
	freopen("lopov.out","w",stdout);
	cin>>n>>k;
	for(rint i=1;i<=n;i++)
		read(a[i].w),read(a[i].v);
	for(rint i=1;i<=k;i++)
		read(c[i]);
	memset(used,0,sizeof(used));
	for(rint i=1;i<=k;i++)f[i]=i;
	sort(a+1,a+n+1,cmp1);
	sort(c+1,c+k+1,cmp2);
	for(rint i=1;i<=n;i++){
		rint pos=ld(a[i].w);
		if(!pos)continue;
		pos=find(pos);
		if(used[pos]==1) continue;
		used[pos]=1,ans=ans+1ll*a[i].v;
		if(pos!=1) f[pos]=find(pos-1);
	}
	cout<<ans<<endl;
	return 0;
}

ratar

#include<map>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define rint register int
using namespace std;
const int maxn=60;
int n,g[maxn][maxn];
int s[maxn][maxn],ans;
map<int,int>mp;
int px[maxn*maxn],cnt;
inline void Init(){
	int link[maxn][maxn];
	memset(link,0,sizeof(link));
	memset(s,0,sizeof(s));
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++)
			link[i][j]=link[i][j-1]+g[i][j];
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++)
			s[i][j]=s[i-1][j]+link[i][j];
	}
	return ;
}
inline int calc(int a,int b,int c,int d){
	a--,b--;
	return s[c][d]-s[a][d]-s[c][b]+s[a][b];
}
inline int lb(int x){
	int l=0,r=cnt;
	while(l<r){
		int mid=l+r>>1;mid++;
		if(px[mid]<=x) l=mid;
		else r=mid-1;
	}
	return l;
}
inline int ub(int x){
	int l=0,r=cnt;
	while(l<r){
		int mid=l+r>>1;mid++;
		if(px[mid]<x) l=mid;
		else r=mid-1;
	}
	return l+1;
}
int main(){
	cin>>n;
	for(rint i=1;i<=n;i++)
		for(rint j=1;j<=n;j++)
			scanf("%d",&g[i][j]);
	Init();
	for(rint i=1;i<=n;i++){
		for(rint j=1;j<=n;j++){
//			mp.clear();
			cnt=0;
			for(rint x=1;x<=i;x++)
				for(rint y=1;y<=j;y++)
//					mp[calc(x,y,i,j)]++;
					px[++cnt]=calc(x,y,i,j);
			sort(px+1,px+cnt+1);
			for(rint x=i+1;x<=n;x++)
				for(rint y=j+1;y<=n;y++){
					rint d=calc(i+1,j+1,x,y);
					ans+=lb(d)-ub(d)+1;
				}
//					ans+=mp[calc(i+1,j+1,x,y)];


//			mp.clear();
			cnt=0;
			for(rint x=i;x<=n;x++)
				for(rint y=1;y<=j;y++)
//					mp[calc(i,y,x,j)]++;
					px[++cnt]=calc(i,y,x,j);
			sort(px+1,px+cnt+1);
			for(rint x=1;x<i;x++)
				for(rint y=j+1;y<=n;y++){
					rint d=calc(x,j+1,i-1,y);
					ans+=lb(d)-ub(d)+1;
				}
//					ans+=mp[calc(x,j+1,i-1,y)];
		}
	}
	cout<<ans<<endl;
	return 0;
}