JLU 2020 Winter Freshman Round 1 补题记录

B题

基本八数码题，BFS+Cantor

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;

const int factory[] = { 1,1,2,6,24,120,720,5040,40320,362880 };
const int dir[4][2] = { {-1,0} ,{0,-1},{1,0} ,{0,1} };

int t, start[9], goal[9], visited[362880 + 5];

struct node{
	int state[9];
	int dis;
};

bool Cantor(int str[], int n) {
	long result = 0;
	for (int i = 0; i < n; i++) {
		int counted = 0;
		for (int j = i + 1; j < n; j++) {
			if (str[i] > str[j])
				++counted;
		}
		result += counted * factory[n - i - 1];
	}
	if (!visited[result]) {
		visited[result] = 1;
		return 1;
	}
	return 0;
}

int bfs() {
	node head;
	memcpy(head.state , start, sizeof(head.state));
	head.dis = 0;
	queue<node>q;
	Cantor(head.state, 9);
	q.push(head);

	while (!q.empty()) {
		head = q.front();
		q.pop();
		if (memcmp(head.state, goal, sizeof(goal)) == 0)
			return head.dis;
		int z;
		for (z = 0; z < 9; z++)
			if (head.state[z] == 0)
				break;
		int x = z % 3;
		int y = z / 3;
		for (int i = 0; i < 4; i++) {
			int newx = x + dir[i][0];
			int newy = y + dir[i][1];
			int nz = newx + 3 * newy;
			if (newx >= 0 && newx < 3 && newy >= 0 && newy < 3) {
				node newnode;
				memcpy(&newnode, &head, sizeof(struct node));
				swap(newnode.state[z], newnode.state[nz]);
				newnode.dis++;
				if (Cantor(newnode.state, 9))
					q.push(newnode);
			}
		}
	}
	return -1;
}

int main(void) {
	scanf("%d", &t);
	for (int kase = 1; kase <= t; kase++) {
		memset(visited, 0, sizeof(visited));
		for (int i = 0; i < 9; i++)scanf("%d", &start[i]);
		for (int i = 0; i < 9; i++)scanf("%d", &goal[i]);
		if (kase > 1)printf("\n");
		printf("Game #%d :\nThe minimum move of the game is : ", kase);
		printf("%d\n", bfs());
	}
	return 0;
}

C题

给出多项式，求导数

代码如下：

#include<cstdio>
#include<vector>
#include<algorithm>
#include<map>
using namespace std;
const int maxp = 100 + 5;
int N, P;
int main(void) {
	scanf("%d", &N);
	for (int kase = 1; kase <= N; kase++) {
		scanf("%d", &P);
		map<int, int>c;
		vector<int>hav;
		int len = 0;
		for (int i = 1; i <= P; i++) {
			int x, y;
			scanf("%d %d", &x, &y);
			if (!c.count(y - 1)) 
				hav.push_back(y - 1);
			c[y - 1] += x * y;
		}
		for (int i = 0; i < hav.size(); i++)
			if (c[hav[i]] == 0)len++;
		if (kase > 1)printf("\n");
		printf("Polynomial #%d:\n", kase);
		if (len == hav.size()) {
			printf("0\n");
			continue;
		}
		sort(hav.begin(), hav.end());
		int num = 0;
		for (int i = hav.size() - 1; i >= 0; i--) {
			int e = hav[i];
			if (c[e] == 0)continue;
			if (!num)printf("%d", c[e]);
			else {
				if (c[e] > 0)printf(" + ");
				else printf(" - ");
				if (abs(c[e]) != 1)
					printf("%d", abs(c[e]));
				else {
					if (e == 0)
						printf("1");
				}
			}
			if (e) {
				printf("x");
				if (e != 1)printf("^%d", e);
			}
			num++;
		}
		printf("\n");
	}
	return 0;
}

F题

水题…

代码如下：

#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn = 350 + 5;
int n;
char str[maxn];
void read(char& ch) {
	ch = getchar();
	while (ch == ' ' || ch == '\n')ch = getchar();
}
int main(void) {
	while (~scanf("%d", &n)) {
		for (int i = 0; i < n; i++) read(str[i]);
		int ans = 0;
		for (int i = 0; i < n - 1; i++) {
			if (str[i] == str[i + 1])continue;
			char lef, rig;
			if (str[i] == 'w') {
				int tmp = (i + n - 1) % n;
				while (str[tmp] == 'w') 
					tmp = (tmp + n - 1) % n;
				if (str[tmp] == str[i + 1])continue;
				lef = str[tmp];
				rig = str[i + 1];
			}
			else if (str[i + 1] == 'w') {
				int tmp = (i + 2) % n;
				while (str[tmp] == 'w')
					tmp = (tmp + 1) % n;
				if (str[tmp] == str[i])continue;//同色之间夹着w直接跳过
				lef = str[i];
				rig = str[tmp];
			}
			else {
				lef = str[i];
				rig = str[i + 1];
			}
			int L = 1, R = 1;
			int ri = (i + 2) % n;
			while (rig == str[ri] || str[ri] == 'w') {
				R++; ri = (ri + 1) % n;
			}
			int li = (i + n - 1) % n;
			while (lef == str[li] || str[li] == 'w') {
				L++; li = (li + n - 1) % n;
			}
			ans = max(ans, L + R);
		}
		if (ans)printf("%d\n", ans);
		else printf("%d\n", n);
	}
	return 0;
}

I题

BFS水题
代码如下：

#include<cstdio>
#include<queue>
#include<vector>
using namespace std;
const int dir[4][2] = { {0,-1},{-1,0},{0,1},{1,0} };
const char to[4] = { 'W','N','E','S' };
int n, m, kase, g[10005][10005];
struct node {
	int x, y;
	vector<char>step;
};
int main(void) {
	while (~scanf("%d %d", &n, &m)) {
		for (int i = 1; i <= n; i++)
			for (int j = 1; j <= m; j++)
				scanf("%d", &g[i][j]);
		node head;
		head.x = 1;
		head.y = 1;
		queue<node>q;
		q.push(head);
		while (!q.empty()) {
			head = q.front();
			q.pop();
			if (head.x == n && head.y == m)break;
			for (int i = 0; i < 4; i++) {
				int row = head.x + dir[i][0];
				int col = head.y + dir[i][1];
				if (row<1 || row>n || col<1 || col>m)continue;
				if (!g[row][col])continue;
				g[row][col] = 0;
				node now = head;
				now.x = row;
				now.y = col;
				now.step.push_back(to[i]);
				q.push(now);
			}
		}
		if (kase)printf("\n");
		printf("Maze #%d:\n", ++kase);
		for (int i = 0; i < head.step.size(); i++)
			printf("%c", head.step[i]);
		printf("\n");
	}
	return 0;
}

G题

找最短路

#include<cstdio>
#include<vector>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
const double inf = 0x3f3f3f3f;
int n, S, t, A, B;
struct node {
	int x, y;
}p[500];
double cost[500][500];
void getFourth(int x1, int y1, int x2, int y2, int x3, int y3, int& x4, int& y4) {
	if ((x2 - x1) * (x2 - x3) + (y2 - y1) * (y2 - y3) == 0) {
		swap(x1, x2);
		swap(y1, y2);
	}
	else if ((x3 - x1) * (x3 - x2) + (y3 - y1) * (y3 - y2) == 0) {
		swap(x1, x3);
		swap(y1, y3);
	}
	x4 = x2 + x3 - x1;
	y4 = y2 + y3 - y1;
}
int main(void) {
	scanf("%d", &n);
	while (n--) {
		scanf("%d %d %d %d", &S, &t, &A, &B);
		int maxCnt = 4 * S;
		for (int i = 0; i < maxCnt; i++)
			for (int j = 0; j < maxCnt; j++)
				cost[i][j] = (i == j) ? 0 : inf;
		int cnt = 0;
		vector<int>pointA, pointB;
		for (int i = 1; i <= S; i++) {
			for (int k = 0; k < 3; k++, cnt++)
				scanf("%d %d", &p[cnt].x, &p[cnt].y);
			int pos[4] = { cnt - 3,cnt - 2,cnt - 1,cnt };
			getFourth(p[cnt - 3].x, p[cnt - 3].y, p[cnt - 2].x, p[cnt - 2].y, p[cnt - 1].x, p[cnt - 1].y, p[cnt].x, p[cnt].y);
			cnt++;
			int T; scanf("%d", &T);
			for (int k = 0; k < 3; k++)
				for (int j = k + 1; j < 4; j++) {
					double len = sqrt(pow((p[pos[k]].x - p[pos[j]].x), 2) + pow((p[pos[k]].y - p[pos[j]].y), 2));
					cost[pos[k]][pos[j]] = cost[pos[j]][pos[k]] = len * T;
				}
			if (i == A) {
				for (int k = 1; k <= 4; k++)
					pointA.push_back(cnt - k);
			}
			if (i == B) {
				for (int k = 1; k <= 4; k++)
					pointB.push_back(cnt - k);
			}
		}
		for (int i = 0; i < cnt - 1; i++)
			for (int j = i + 1; j < cnt; j++) {//同一个城市
				if (i / 4 == j / 4)continue;
				double len = sqrt(pow((p[i].x - p[j].x), 2) + pow((p[i].y - p[j].y), 2));
				cost[i][j] = cost[j][i] = len * t;
			}
		for (int k = 0; k < cnt; k++)
			for (int i = 0; i < cnt; i++)
				if (i != k)
					for (int j = 0; j < cnt; j++) {
						if (i == j || k == j)continue;
						cost[i][j] = min(cost[i][j], cost[i][k] + cost[k][j]);
					}
		double ans = inf;
		for (int i = 0; i < pointA.size(); i++)
			for (int j = 0; j < pointB.size(); j++)
				ans = min(ans, cost[pointA[i]][pointB[j]]);
		printf("%.2f\n", ans);
	}
	return 0;
}

H题

如果无相关节点或者相关节点对应的子树深度全部相等(叶子除外)则为根。

#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
int n;
vector<int>connect[101];
int depth(int bef,int now) {
	int ret = 0;
	for (int i = 0; i < connect[now].size(); i++) {
		if (connect[now][i] == bef)continue;
		ret = max(ret, depth(now, connect[now][i]));
	}
	return ret + 1;
}
int main(void) {
	while (~scanf("%d", &n) && n) {
		for (int i = 1; i <= n; i++) {
			int x;
			connect[i].clear();
			while (~scanf("%d", &x) && x)
				connect[i].push_back(x);
		}
		vector<int>ans;
		for (int i = 1; i <= n; i++) {
			if (connect[i].size() == 0) {
				ans.push_back(i);
				continue;
			}
			else if (connect[i].size() == 1)
				continue;
			bool isRoot = true;
			int d = depth(i, connect[i][0]);
			for (int j = 1; j < connect[i].size(); j++) {
				if (d != depth(i, connect[i][j])) {
					isRoot = false;
					break;
				}
			}
			if(isRoot)ans.push_back(i);
		}
		for (int i = 0; i < ans.size(); i++)
			printf("%d%c", ans[i], i == ans.size() - 1 ? '\n' : ' ');
	}
	return 0;
}