2018.02.03【NOIP普及组】模拟赛D组

JZOJ NO.1 【2014.8.17NOIP普及组模拟】数池塘

深搜

#include <cstdio>
using namespace std;
int n,m,ans; char a[101][101]; bool v[101][101];
const int dx[8]={0,0,1,1,1,-1,-1,-1},dy[8]={1,-1,1,0,-1,1,0,-1};
void dfs(int x,int y){
	v[x][y]=1;
	for (int i=0;i<8;i++) if (x+dx[i]&&x+dx[i]<=n&&y+dy[i]&&y+dy[i]<=m
	&&!v[x+dx[i]][y+dy[i]]&&a[x+dx[i]][y+dy[i]]=='W') dfs(x+dx[i],y+dy[i]);
}
int main(){
	freopen("lkcount.in","r",stdin);
	freopen("lkcount.out","w",stdout);
	scanf("%d%d\n",&n,&m);
	for (int i=1;i<=n;i++) gets(a[i]+1);
	for (int i=1;i<=n;i++)
	for (int j=1;j<=m;j++)
	if (!v[i][j]&&a[i][j]=='W') 
	ans++,dfs(i,j);
	printf("%d",ans);
	return 0;
}

---

JZOJ NO.2 【2014.8.17NOIP普及组模拟】接苹果

分析

dp 状态转移方程$f[k]=max(f[k],f[k-1])+1$

---

代码

#include <cstdio>
#include <algorithm>
using namespace std;
int f[31],n,k,big;
int main(){ int x;
    freopen("bcatch.in","r",stdin);
    freopen("bcatch.out","w",stdout);
	scanf("%d%d",&n,&k);
	for (int i=1;i<=n;i++){
		scanf("%d",&x); x--;
		if (!x) f[0]++;
		for (int j=1;j<=k;j++) if (j%2==x) f[j]=max(f[j],f[j-1])+1;
	}
	for (int i=0;i<=k;i++) big=max(big,f[i]);
	printf("%d",big); return 0;
}

---

JZOJ NO.3 【2012.04.14普及组】找数

快排

#include <cstdio>
#include <algorithm>
using namespace std;
int a[3000001],n,k;
int main(){
	freopen("find.in","r",stdin);
	freopen("find.out","w",stdout);
	scanf("%d%d",&n,&k);
	for (int i=1;i<=n;i++) 
	scanf("%d",&a[i]); 
	stable_sort(a+1,a+1+n);
	printf("%d",a[n-k+1]); return 0;
}

---

JZOJ NO.4 【2012.04.14普及组】最短路线

高精度

#include <cstdio>
#include <cmath>
using namespace std;
const int mod=100000000,maxn=70;
struct bignum{int d[71];}f[801][801];
int n,m;
bignum add(bignum a,bignum b){
	bignum tmp; int g=0,s;
	for (int i=maxn;i>=1;i--){
		s=a.d[i]+b.d[i]+g;
		tmp.d[i]=s%mod;
		g=s/mod;
	}	
	return tmp;
}
void print(bignum tmp){
	int j; for (j=1;j<=maxn-1;j++) 
	if (tmp.d[j]) break; printf("%d",tmp.d[j]);
	for (int i=j+1;i<=maxn;i++){
		for (int c=1;c<=8-ceil(log10(tmp.d[i]));c++) putchar('0');
		printf("%d",tmp.d[i]);
	}
}
int main(){
	freopen("sline.in","r",stdin);
	freopen("sline.out","w",stdout);
    scanf("%d%d",&n,&m);
    for (int i=1;i<=n;i++)
    for (int j=1;j<=m;j++){
    if (i==1||j==1) f[i][j].d[maxn]=1;
    else f[i][j]=add(f[i-1][j],f[i][j-1]);
	}
	print(f[n][m]); return 0;
}

JZOJ NO.5【2012.04.14普及组】棋盘覆盖

深搜

#include <cstdio>
using namespace std;
int a[1025][1025],r,c,n,ans;
void dfs(int x,int y,int r,int c,int size){
	if (size==1) return;
	ans++; int s=size>>1;
	if (x+s<=r&&y+s<=c){//右下
		a[x+s-1][y+s-1]=ans;//左上
		a[x+s][y+s-1]=ans;//左下
		a[x+s-1][y+s]=ans;//右上
		dfs(x,y,x+s-1,y+s-1,s);//左上
		dfs(x+s,y,x+s,y+s-1,s);//左下
		dfs(x,y+s,x+s-1,y+s,s);//右上
		dfs(x+s,y+s,r,c,s);//右下
	}
	if (x+s>r&&y+s<=c){
		a[x+s-1][y+s-1]=ans;
		a[x+s][y+s-1]=ans;
		a[x+s][y+s]=ans;
		dfs(x,y,x+s-1,y+s-1,s);
		dfs(x+s,y,x+s,y+s-1,s);
		dfs(x,y+s,r,c,s);
		dfs(x+s,y+s,x+s,y+s,s);
	}
	if (x+s<=r&&y+s>c){
		a[x+s-1][y+s-1]=ans;
		a[x+s][y+s]=ans;
		a[x+s-1][y+s]=ans;
		dfs(x,y,x+s-1,y+s-1,s);
		dfs(x+s,y,r,c,s);
		dfs(x,y+s,x+s-1,y+s,s);
		dfs(x+s,y+s,x+s,y+s,s);
	}
	if (x+s>r&&y+s>c){
		a[x+s][y+s]=ans;
		a[x+s][y+s-1]=ans;
		a[x+s-1][y+s]=ans;
		dfs(x,y,r,c,s);
		dfs(x+s,y,x+s,y+s-1,s);
		dfs(x,y+s,x+s-1,y+s,s);
		dfs(x+s,y+s,x+s,y+s,s);
	}
}
int main(){
	freopen("chessboard.in","r",stdin);
	freopen("chessboard.out","w",stdout);
	scanf("%d%d%d",&n,&r,&c);
	dfs(1,1,r,c,n);
	for (int i=1;i<=n;i++)
	for (int j=1;j<=n;j++)
	printf("%d%c",a[i][j]?a[i][j]:-1,(j==n)?'\n':' ');
}