PAT1104-1107解题报告及其代码

PAT1104： Sum of Number Segments

简单的找规律题目，多写几次就能找到规律。。

#include<iostream>
#include<vector>
using namespace std;

int main(){
	int n;
	double a,sum = 0;
	vector<double> res;
	cin>>n;
	for(int i = 0;i<n;++i){
		cin>>a;
		res.push_back(a);
	}
	int size = res.size();
	for(int i = 0;i<n;++i)
		sum += res[i]*(n-i)*(i+1);
	printf("%.2lf\n",sum);
	return 0;
}

PAT1105： Spiral Matrix

矩阵的顺时针旋转赋值，在外层赋值-1确定边界，遇到边界则变化方向

#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include<cstring>
using namespace std;

bool cmp(const int &a,const int &b){
	return a>b;
}

int cal(int x){
	int y = sqrt(x);
	while(y>0){
		if(x%y == 0)
			return y;
		--y;
	}
	return 1;
}	

int main(){
	int n,a,flag[105][105],x,y,cnt = 0,num[105][105],sx = 0,sy = 0;
	vector<int> res;
	cin>>n;
	y = cal(n);
	x = n/y;
	memset(flag,-1,sizeof(flag));
	for(int i = 0;i<x;++i)
		for(int j = 0;j<y;++j)
			flag[i][j] = 0;
	for(int i = 0;i<n;++i){
		cin>>a;
		res.push_back(a);
	}	
	sort(res.begin(),res.end(),cmp);
	while(cnt<n){
		while(sy<y && flag[sx][sy] != -1){
			num[sx][sy] = res[cnt++];
			flag[sx][sy] = -1;
			++sy;
		}
		--sy;
		++sx;
		while(sx<x && flag[sx][sy] != -1){
			num[sx][sy] = res[cnt++];
			flag[sx][sy] = -1;
			++sx;
		}
		--sx;
		--sy;
		while(sy>=0 && flag[sx][sy] != -1){
			num[sx][sy] = res[cnt++];
			flag[sx][sy] = -1;
			--sy;
		}
		++sy;
		--sx;
		while(sx>=0 && flag[sx][sy] != -1){
			num[sx][sy] = res[cnt++];
			flag[sx][sy] = -1;
			--sx;
		}
		++sx;
		++sy;
	}
	for(int i = 0;i<x;++i){
		cout<<num[i][0];
		for(int j = 1;j<y;++j)
			cout<<" "<<num[i][j];
		cout<<endl;
	}
	return 0;
}

PAT1106： Lowest Price in Supply Chain

这道题是我有疑问的一道题，自己写的一直有几个点过不了，最后借鉴了大牛的，求各位大牛帮忙看看哪里错了

题目大致就是让我们对一棵树进行层次遍历，选出叶子结点层次最小的结点

WA代码：

#include<iostream>
#include<vector>
#include<queue>
#include<cmath>
using namespace std;
#define MAX 100005

struct node{
	int father,level;
	vector<int> son;
};

vector<node> num;
vector<int> check;

int main(){
	int n,m,tmp,root = 0,maxLevel = MAX,t = 0,cnt = 0;
	double price = 0,p,r;
	queue<int> tree;
	cin>>n>>p>>r;
	num.resize(n);
	check.reserve(n);
	for(int i = 0;i<n;++i){
		cin>>m;
		if(m == 0){
			num[i].son.push_back(-1);
			check.push_back(i);
			continue;
		}
		while(m--){
			cin>>tmp;
			num[i].son.push_back(tmp);
			num[tmp].father = i;
		}
	}
	num[root].level = 0;
	tree.push(root);
	while(!tree.empty()){
		int temp = tree.front();
		int sLevel = num[temp].level;
		int size = num[temp].son.size();
		for(int i = 0;i<size;++i){
			num[num[temp].son[i]].level = sLevel + 1;
			if(size == 1 && num[temp].son[0] == -1) continue;
			tree.push(num[temp].son[i]);
		}
		tree.pop();
	}
	for(int i = 0;i<check.size();++i){
		//cout<<check[i]<<endl;
		if(num[check[i]].level < maxLevel){
			maxLevel = num[check[i]].level;
			cnt = 0;
		}
		if(num[check[i]].level == maxLevel)
			++cnt;
	}
	price = p*pow(1+r/100.0,maxLevel);
	printf("%.4lf %d\n",price,cnt);
	return 0;
}

AC代码：

#include<iostream>
#include<vector>
#include<queue>
#include<cmath>
using namespace std;
#define MAX 100005

struct node{
	int father,level;
	vector<int> son;
};

vector<node> num;
vector<int> check;

int main(){
	int n,m,tmp,root = 0,maxLevel = MAX,t = 0,cnt = 0;
	double price = 0,p,r;
	queue<int> tree;
	cin>>n>>p>>r;
	num.resize(n);
	check.reserve(n);
	for(int i = 0;i<n;++i){
		cin>>m;
		if(m == 0)
			check.push_back(i);
		while(m--){
			cin>>tmp;
			num[i].son.push_back(tmp);
			num[tmp].father = i;
		}
	}
	num[root].level = 0;
	tree.push(root);
	while(!tree.empty()){
		int temp = tree.front();
		int sLevel = num[temp].level;
		int size = num[temp].son.size();
		for(int i = 0;i<size;++i){
			num[num[temp].son[i]].level = sLevel + 1;
			tree.push(num[temp].son[i]);
		}
		tree.pop();
	}
	for(int i = 0;i<check.size();++i){
		if(num[check[i]].level < maxLevel){
			maxLevel = num[check[i]].level;
			cnt = 0;
		}
		if(num[check[i]].level == maxLevel)
			++cnt;
	}
	price = p*pow(1+r/100.0,maxLevel);
	printf("%.4lf %d\n",price,cnt);
	return 0;
}

PAT1107： Social Clusters

简单的并查集问题

#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<set>
using namespace std;

vector<int> par;
vector<int> count1;
vector<int> num;

int cnt;

struct node{
	vector<int> sNum;
};
vector<node> xq(1005);

int find(int x){
	if(x == par[x])
		return x;
	else return par[x] = find(par[x]);
}

bool cmp(int a,int b){
	return a>b;
}

void merge(int a,int b){
	int x = find(a);
	int y = find(b);
	if(x == y) return ;
	--cnt;
	if(count1[x]<count1[y]){
		par[x] = y;
		num[y] += num[x];
	}
	else if(count1[x]>count1[y]){
		par[y] = x;
		num[x] += num[y];
	}
	else{
		par[y] = x;
		num[x] += num[y];
		count1[x]++;
	} 
}

int main(){
	int n,a,m,max = 0;
	cin>>n;
	par.resize(n);
	num.resize(n);
	count1.resize(n);
	for(int i = 0;i<n;++i){
		par[i] = i;
		num[i] = 1;
	}
	cnt = n;
	for(int i = 0;i<n;++i){
		scanf("%d:",&m);
		for(int j = 0;j<m;++j){
			scanf("%d",&a);
			if(a>max) max = a;
			xq[a].sNum.push_back(i);
		}
	}
	
	for(int i = 0;i<=max;++i){
		if(xq[i].sNum.size() != 0){
			for(int j = 1;j<xq[i].sNum.size();++j)
				merge(xq[i].sNum[0],xq[i].sNum[j]);
		}
	}
	
	set<int> res;
	for(int i = 0;i<n;++i)
		res.insert(find(i));
		
	vector<int> res2;
	set<int>::iterator iter = res.begin();
	
	for(;iter != res.end();++iter)
		res2.push_back(num[find(*iter)]);
	
	cout<<cnt<<endl;
	sort(res2.begin(),res2.end(),cmp);
	cout<<res2[0];
	for(int i = 1;i<cnt;++i)
		cout<<" "<<res2[i];
	cout<<endl;
	return 0;
}