19年冬季Pat甲级

7-1

#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
const int maxn = 27;
string cap[maxn][7];
void Print(string s) {
	vector<string> ans;
	for (int i = 0; i < s.size(); i++) {
		int t = s[i] - 'A' + 1;
		for (int j = 0; j < 5; j++) {
			string str;
			for (int k = 0; k < 7; k++) {
				str += cap[t][k][j];
			}
			ans.push_back(str);
		}
		if (i != s.size() - 1) {
			ans.push_back("       ");
		}
	}
	for (int i = 0; i < 7; i++) {
		for (int j = 0; j < ans.size(); j++) {
			cout << ans[j][i];
		}
		if (i != 6) { cout << endl; }
	}
	return;
}

int main() {
	string s;
	for (int i = 1; i < maxn; i++) {
		for (int j = 0; j < 7; j++) {
			cin >> s;
			cap[i][j] = s;
		}
	}
	string str;
	vector<string> p;
	char c;
	getchar();
	while (scanf("%c", &c) != EOF) {//
		if (c == '\n') { break; }
		if (isupper(c)) {
			str += c;
		}
		else {
			if (str.size()) {
				p.push_back(str);
				str.clear();
			}
		}
	}
	if (str.size()) { p.push_back(str); }
	for (int i = 0; i < p.size(); i++) {
		Print(p[i]);
		if (i != p.size() - 1) {
			cout << endl << endl;
		}
	}
	return 0;
}

7-2

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
const int maxn = 1e5 + 10;
int n, k, start;

struct node {
	int ad, v, next;
}num[maxn];
vector<vector<node> > ans;
vector<node> pri;

int main() {
	scanf("%d%d%d", &start, &n, &k);
	int a, b, c;
	for (int i = 0; i < n; i++) {
		scanf("%d%d%d", &a, &b, &c);
		num[a] = { a,b,c };
	}
	vector<node> temp;
	int cnt = 0;
	while (start != -1) {
		temp.push_back(num[start]);
		cnt++;
		start = num[start].next;
		if (temp.size() == k) {
			ans.push_back(temp);
			temp.clear();
		}
	}
	if (temp.size()) { ans.push_back(temp); }
	int len = ans.size();
	for (int i = len - 1; i >= 0; i--) {
		for (int j = 0; j < ans[i].size(); j++) {
			pri.push_back(ans[i][j]);
		}
	}
	for (int i = 0; i < cnt; i++) {
		if (i != cnt - 1) { printf("%05d %d %05d\n", pri[i].ad, pri[i].v, pri[i + 1].ad); }
		else { printf("%05d %d -1", pri[i].ad, pri[i].v); }
	}
	return 0;
}

7-3

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
const int maxn = 220;
int n, m, k, l;
int G[maxn][maxn] = { {0} };

void fun(vector<int>& t, int index) {
	int len = t.size(), flag = 0, temp = -1;
	if (len == 1) {
		for (int i = 1; i <= n; i++) {
			if (G[i][t[0]] == 1) {
				printf("Area %d may invite more people, such as %d.\n", index, i);
				return;
			}
		}
		printf("Area %d is OK.\n", index);
		return;
	}
	for (int i = 0; i < len; i++) {
		for (int j = i + 1; j < len; j++) {
			if (G[t[i]][t[j]] == 0) { flag = 1; }
		}
	}
	if (flag) { printf("Area %d needs help.\n", index); return; }
	for (int i = 1; i <= n; i++) {
		flag = 1;
		for (int j = 0; j < len; j++) {
			if (i == t[j] || G[t[j]][i] == 0) { flag = 0; break; }
		}
		if (flag) { printf("Area %d may invite more people, such as %d.\n", index, i); return; }
	}
	printf("Area %d is OK.\n", index);
	return;
}

int main() {
	scanf("%d%d", &n, &m);
	for (int i = 0; i < m; i++) {
		int a, b;
		scanf("%d%d", &a, &b);
		G[a][b] = G[b][a] = 1;
	}
	scanf("%d", &k);
	for (int i = 1; i <= k; i++) {
		scanf("%d", &l);
		vector<int> t(l);
		for (int j = 0; j < l; j++) { scanf("%d", &t[j]); }
		fun(t, i);
	}
	return 0;
}

7-4

#include<iostream>
#include<vector>
#include<algorithm>	
using namespace std;
#define INF 0x3f3f3f3f
const int maxn = 35;
int n, num[maxn];
struct node {
	int v, p;
};
vector<node> ans;
int getMin(int l, int r) {
	int Min = INF, pos = 0;
	for (int i = l; i <= r; i++) {
		if (num[i] < Min) {
			Min = num[i];
			pos = i;
		}
	}
	return pos;
}

void fun(int l, int r, int p) {
	if (r < l) { return; }
	int root = getMin(l, r);
	ans.push_back({ num[root],p });
	fun(l, root - 1, 2 * p + 1);
	fun(root + 1, r, 2 * p + 2);
}

int main() {
	cin >> n;
	for (int i = 0; i < n; i++) { cin >> num[i]; }
	fun(0, n - 1, 0);
	sort(ans.begin(), ans.end(), [](node a, node b) {return a.p < b.p; });
	for (int i = 0; i < n; i++) {
		cout << ans[i].v;
		if (i != n - 1) { cout << ' '; }
	}
	return 0;
}