AtCoder Beginner Contest 183

貌似昨天能第一场自主ak…

都怪火锅…

吃完回家就睡着了…

A.

#include <bits/stdc++.h>
using namespace std;
int n;
int main(){
	scanf("%d",&n);
	printf("%d\n",max(0,n));
return 0;
}

B.

#include <bits/stdc++.h>
using namespace std;
double x,y,xx,yy,h,l,k,ans;
int main(){
	scanf("%lf%lf%lf%lf",&x,&y,&xx,&yy);
	h=fabs(y)+fabs(yy);
	l=fabs(x-xx);
	k=l/h;
	if (x<xx) ans=x+fabs(y)*k;
	else ans=x-fabs(y)*k;
	printf("%.10f\n",ans);
return 0;
}

C.

#include <bits/stdc++.h>
using namespace std;
int n,m,ans;
int b[10],a[10][10];
bool vis[10];

inline void init()
{
	int zy=0;
	for (register int i=2; i<=n; ++i) zy+=a[b[i-1]][b[i]];
	zy+=a[b[n]][b[1]];
	if (zy==m) ans++;
}
void dfs(int x)
{
	if (x==n+1)
	{
		init();
		return;
	}
	for (register int i=2; i<=n; ++i)
	if (!vis[i])
	{
		vis[i]=true;
		b[x]=i;
		dfs(x+1);
		vis[i]=false;
	}
}

int main(){
	scanf("%d%d",&n,&m);
	for (register int i=1; i<=n; ++i)
	for (register int j=1; j<=n; ++j) scanf("%d",&a[i][j]); 
	b[1]=1; vis[1]=true;
	dfs(2);
	printf("%d\n",ans);
return 0;
}

D.

noip原题。

#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N=2e5+5;
int n,m,a,b,c;
int f[N];
signed main(){
	scanf("%lld%lld",&n,&m);
	for (register int i=1; i<=n; ++i)
	{
		scanf("%lld%lld%lld",&a,&b,&c);
		f[a]+=c; f[b]-=c;
	}
	for (register int i=0; i<=n; ++i) f[i]+=f[i-1];
	for (register int i=0; i<=n; ++i)
	{
		if (f[i]>m) {puts("No"); return 0;} 
	}
	puts("Yes");
return 0;	
}

E.

f[i][j]:(1,1)–>（i,j）的方案数。

#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N=2e3+5,MOD=1e9+7;
int n,m;
int f[N][N],hang[N],lie[N],xie[10005];
char str[N][N];
signed main(){
	scanf("%lld%lld",&n,&m);
	for (register int i=1; i<=n; ++i) scanf("%s",str[i]+1);	
	f[1][1]=1; hang[1]=1; lie[1]=1; xie[1-1+3000]=1;
	for (register int i=1; i<=n; ++i)
	for (register int j=1; j<=m; ++j)
	{
		if (i==1&&j==1) continue;
		if (str[i][j]=='#') 
		{
			hang[i]=0; lie[j]=0; xie[i-j+3000]=0;
			continue;
		}
		f[i][j]=(hang[i]+lie[j]+xie[i-j+3000])%MOD;
		hang[i]=(hang[i]+f[i][j])%MOD;
		lie[j]=(lie[j]+f[i][j])%MOD;
		xie[i-j+3000]=(xie[i-j+3000]+f[i][j])%MOD;
	}
	printf("%lld\n",f[n][m]);
return 0;	
}

F.

启发式合并一个log，偷懒用map一个log，n logn logn。

不开c++11的话，map就只能多写个iterator遍历了。

#include <bits/stdc++.h>
using namespace std;
const int N=2e5+5;
int n,q,x,opt,y;
int f[N];
map<int,int>c[N];

int find(int x)
{
	if (f[x]==x) return x;
	return f[x]=find(f[x]);
}
int main(){
	scanf("%d%d",&n,&q);
	for (register int i=1; i<=n; ++i)
	{
		scanf("%d",&x);
		c[i][x]++;
		f[i]=i;
	}
	while (q--)
	{
		scanf("%d%d%d",&opt,&x,&y);
		if (opt==1)
		{
			int xx=find(x),yy=find(y);
			if (xx!=yy)
			{
				if (c[xx].size()<c[yy].size()) swap(xx,yy);
				f[yy]=xx;
				map<int,int>::iterator it;
				for (it=c[yy].begin(); it!=c[yy].end(); it++) c[xx][it->first]+=c[yy][it->first];
			}
		}
		else
		{
			int xx=find(x);
			printf("%d\n",c[xx][y]);
		}
	}
return 0;
}