2020.04.29【NOIP普及组】模拟赛C组30

链接

T1:

三重爆力
1：草坪数
2：可能数
3：奶牛数

#include<iostream>
#include<cstdio>
using namespace std;
int m,n,j,a[10010],b[10010],f[10010];
int main(){
	freopen("revegetate.in","r",stdin);
	freopen("revegetate.out","w",stdout);
	cin>>n>>m;
	for(int i=1;i<=m;i++){
		cin>>a[i]>>b[i];
		if(a[i]>b[i]){
			int sw=a[i];
			a[i]=b[i];
			b[i]=sw;
		}
	}
	for(int i=1;i<=n;i++){
		for(j=1;j<=4;j++){
			bool flag=0;
			for(int k=1;k<=m;k++){
				if(b[k]==i&&f[a[k]]==j){
					flag=1;
				}
			}
			if(flag==0)break;
		}
		f[i]=j;
	}
	for(int i=1;i<=n;i++)cout<<f[i];
	return 0;
}

T2:

就是一个加加减减大大小小的问题
详见代码

#include<iostream>
#include<cstdio>
#include<string>
#include<cmath>
using namespace std;
int m,n;
struct node{
	string f;
	int x,y;
}a[1001000];
int main(){
	freopen("traffic.in","r",stdin);
	freopen("traffic.out","w",stdout);
	int l=0,r=1000100;
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i].f>>a[i].x>>a[i].y;
		if(a[i].f=="none"){
			l=max(l,a[i].x);
			r=min(r,a[i].y);
		}//平路之1~3,2~4,答案是2~3
		if(a[i].f=="on"){
			l+=a[i].x;
			r+=a[i].y;
		}//一元一次不等式
		if(a[i].f=="off"){
			l-=a[i].y;
			r-=a[i].x;
		}
		l=max(l,0);
	}
	int l1=0,r1=1000010;
	for(int i=n;i>=1;i--){
		if(a[i].f=="none"){
			l1=max(l1,a[i].x);
			r1=min(r1,a[i].y);
		}
		if(a[i].f=="on"){
			l1-=a[i].y;
			r1-=a[i].x;
		}
		if(a[i].f=="off"){
			l1+=a[i].x;
			r1+=a[i].y;
		}
		l1=max(l1,0);
	}
	cout<<l1<<' '<<r1<<endl<<l<<' '<<r;
	return 0;
}

T3:

找出周期

#include<iostream>
#include<cstdio>
using namespace std;
int a[9]={0,1,2,4,7,8,11,13,14};
int n;
int main(){
	freopen("moobuzz.in","r",stdin);
	freopen("moobuzz.out","w",stdout);
	cin>>n;
	int m=n/8;
	int k=n%8;
	if(k==0)cout<<m*15-1;
	else cout<<m*15+a[k];
	return 0;
}

T4:

并查集
把一样的并在一起
然后从x到y时，看看他们是不是一样的，如果一样就表示他们中途没有（或有）经过z

#include<iostream>
#include<cstdio>
using namespace std;
int m,n,fa[100100],a[100100];
char c[100100];
int getf(int x){
	if(fa[x]==x)return x;
	else return fa[x]=getf(fa[x]);
}
int main(){
	freopen("milkvisits.in","r",stdin);
	freopen("milkvisits.out","w",stdout);
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		cin>>c[i];
		fa[i]=i;
	}
	for(int i=1;i<=n-1;i++){
		int x,y;
		cin>>x>>y;
		if(c[x]==c[y]){
			int x1=getf(x);
			int y1=getf(y);
			fa[x1]=y1;
		}
	}
	for(int i=1;i<=m;i++){
		int x,y;
		char c1;
		cin>>x>>y>>c1;
		if(getf(x)==getf(y)&&c[x]!=c1)a[i]=0;
		else a[i]=1;
	}
	for(int i=1;i<=m;i++)cout<<a[i];
	return 0;
}