复习题目（2）

最新推荐文章于 2024-06-15 11:44:36 发布

大一菜鸟自学后端

最新推荐文章于 2024-06-15 11:44:36 发布

阅读量120

点赞数 1

文章标签：蓝桥杯算法 c++

本文链接：https://blog.csdn.net/2302_81473103/article/details/137516910

版权

NO.5 :岛屿个数

双bfs

#include<iostream>
#include<cstring>
#include<algorithm>
#include<queue>
#define x first
#define y second

using namespace std;

typedef pair <int, int> PII;
const int N = 55;
int m, n;
char g[N][N];
bool st_sea[N][N] = { 0 };
bool st_load[N][N] = { 0 };
int dx[] = { 0, 0, 1, -1, 1, 1, -1, -1 };
int dy[] = { 1, -1, 0, 0, 1, -1, 1, -1 };
int ans = 0;

void bfs_load(int x1, int y1)
{
	ans++;
	queue<PII> q_load;
	q_load.push({ x1, y1 });
	st_load[x1][y1] = true;

	while (!q_load.empty()) {
		auto t = q_load.front(); q_load.pop();

		for (int i = 0; i < 4; i++) {
			int a = t.x + dx[i], b = t.y + dy[i];
			if (a < 0 || a > m + 1 || b < 0 || b > n + 1) continue;
			if (st_load[a][b]) continue;
			if (g[a][b] != '1') continue;

			st_load[a][b] = st_load[t.x][t.y];
			q_load.push({ a, b });
		}
	}
	return;
}

void bfs_sea(int x1, int y1)
{
	memset(st_load, false, sizeof(st_load));
	memset(st_sea, false, sizeof(st_sea));
	queue<PII> q_sea;
	q_sea.push({ x1, y1 });
	st_sea[x1][y1] = true;

	while (!q_sea.empty()) {
		auto t = q_sea.front(); q_sea.pop();

		for (int i = 0; i < 8; i++) {
			int a = t.x + dx[i], b = t.y + dy[i];
			if (a < 0 || a > m + 1 || b < 0 || b > n + 1) continue;
			if (st_sea[a][b]) continue;
			if (g[a][b] == '1' && !st_load[a][b]) bfs_load(a, b);
			if (g[a][b] != '0') continue;

			st_sea[a][b] = st_sea[t.x][t.y];
			q_sea.push({ a, b });
		}
	}
	return;
}

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);

	int T; cin >> T;
	while (T--) {
		memset(g, '0', sizeof(g));
		ans = 0;
		cin >> m >> n;
		for (int i = 1; i <= m; i++) {
			string line; cin >> line;
			for (int j = 1; j <= n; j++) {
				g[i][j] = line[j - 1];
			}
		}

		bfs_sea(0, 0);
		cout << ans << endl;
	}


	return 0;
}

NO.6:更小的数

动态规划

#include<iostream>
#include<cstring>
#include<algorithm>

using namespace std;

const int N = 5050;
int dp[N][15];

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	
	string s; cin >> s;
	int n = s.size();
	int fi = s[0] - '0';
	for(int i = 0; i <= 9; i++){
		if(i == fi) dp[0][i] = 1;
		else dp[0][i] = 0;
	}
	
	for(int i = 1; i < n; i++){
		int a = s[i] - '0';
		for(int j = 0; j <= 9; j++){
			if(j == a) dp[i][a] = dp[i - 1][a] + 1;
			else dp[i][j] = dp[i - 1][j];
		}
	} 
	
	int ans = 0;
	for(int i = 1; i < n; i++){
		int a = s[i] - '0';
		for(int j = a + 1; j <= 9; j++){
			ans += dp[i][j];
		}
		
		if(dp[i][a] - 1){
			for(int j = 0; j < i; j++){
				if(s[j] - '0' == a){
					int left = j, right = i;
					while(left < right){
						left++;
						right--;
						if(s[left] == s[right]) continue;
						else if(s[left] < s[right]) break;
						else{
							ans++;
							break;
						}
					}
				}
			}
		}
	}
	
	cout << ans << endl;
	
	
	return 0;
}

NO.7:错误票据

#include<iostream>
#include<cstring>
#include<algorithm>
#include<vector>

using namespace std;

const int N = 1e5 + 10;
int a[N];

int main(void)
{
	int cent = 0;
	int n; cin >> n;
	int x;
	while(cin >> x){
		a[cent++] = x;
	}
	
	sort(a, a + cent);
	
	int ans1, ans2;
	for(int i = 0; i < cent - 1; i++){
		int l = a[i], r = a[i + 1];
		if(l == r) ans2 = l;
		if(r - l == 2) ans1 = r - 1;
	}
	cout << ans1 << ' ' << ans2 << endl;
	
	return 0;
}

NO.8:刷题统计

#include<iostream>
#include<cstring>
#include<algorithm>
#define int long long

using namespace std;

signed main(void)
{
	int a, b, n; cin >> a >> b >> n;
	int num =  5 * a + 2 * b;
	int T = n / num;
	int c = n % num;
	int cnt = 0;
	while(c > 0){
		cnt++;
		if(cnt <= 5) c -= a;
		else c -= b;
	}
	
	cout << 7 * T + cnt << endl;
	
	return 0;
}

NO.9：特别数的和

#include<iostream>
#include<cstring>
#include<algorithm>
#include<string>
#define int long long

using namespace std;

signed main(void)
{
	int n; cin >> n;
	
	int ans = 0;
	for(int j = 1; j <= n; j++){
		string s = to_string(j);
		for(int i = 0; i < s.size(); i++){
			if(s[i] - '0' == 2 || s[i] - '0' == 0 || s[i] - '0' == 1 || s[i] - '0' == 9){
				ans += j;
				break;
			} 
		}
	}
	
	cout << ans << endl;
	
	return 0;
}

NO.10:冶炼金属

#include<iostream>
#include<cstring>
#include<algorithm>
#define INF 0x3f3f3f3f3f3f3f3f
#define int long long

using namespace std;

signed main(void)
{
	int mx = INF, mn = -1;
	
	int n; cin >> n;
	for(int i = 1; i <= n; i++){
		int a, b; cin >> a >> b;
		mx = min(mx, a / b);
		mn = max(mn, a / (b + 1) + 1);
	}
	
	cout << mn << ' ' << mx << endl;
	
	return 0;
}

NO.11：A子2023

#include<iostream>
#include<cstring>
#include<algorithm>
#define int long long

using namespace std;

int dp[5] = {0};

signed main(void)
{
	string s;
	for(int i = 1; i <= 2023; i++) s += to_string(i);
	
	int len = s.size();
	for(int i = 0; i < len; i++){
		if(s[i] == '2'){
			dp[1]++;
			dp[3] += dp[2];
		}
		if(s[i] == '0'){
			dp[2] += dp[1];
		}
		if(s[i] == '3'){
			dp[4] += dp[3];
		}
	}
	
	cout << dp[4] << endl;
	
	return 0;
}

NO.12：双子数

#include<iostream>
#include<cstring>
#include<algorithm>
#define int long long

using namespace std;

const int N = 2e7;

int prime[N];
bool st[N] = {0};
int cnt = 0;

void get_prime(int n)
{
	for(int i = 2; i <= n; i++){
		if(!st[i]) prime[cnt++] = i;
		for(int j = 0; prime[j] <= n / i; j++){
			st[prime[j] * i] = true;
			if(i % prime[j] == 0) break;
		} 
	}
	
	return;
}

signed main(void)
{
	get_prime(N);
	
	int ans = 0;
	int le = 2333, ri = 23333333333333;
	for(int i = 0; i < cnt; i++){
		if(prime[i] * prime[i] * prime[i + 1] * prime[i + 1] > ri) break;
		for(int j = i + 1; j < cnt; j++){
			if(prime[i] * prime[i] * prime[j] * prime[j] < le) continue;
			if(prime[i] * prime[i] * prime[j] * prime[j] > ri) break;
			
			ans++;
		}
	}
	cout << ans << endl;
	
	return 0;
}

NO.13：网络寻路

#include<iostream>
#include<cstring>
#include<algorithm>
#include<unordered_map>
#include<vector>

using namespace std;

struct Node{
	int value;
	vector <Node*> children;
}; 

unordered_map <int, Node*> mp;

int n, m;
int ans = 0;

void dfs(int x, int fa, int cnt)
{
	if(cnt == 4){
		ans++;
		return;
	}
	for(int i = 0; i < mp[x]->children.size(); i++){
		int child = mp[x]->children[i]->value;
		if(child == fa) continue;
		dfs(child, x, cnt + 1);
	}
	return;
}

int main(void)
{
	int n; cin >> n >> m;
	Node node[n + 10];
	
	for(int i = 1; i <= n; i++){
		node[i].value = i;
		mp[i] = &node[i];
	}
	
	for(int i = 1; i <= m; i++){
		int x, y; cin >> x >> y;
		mp[x]->children.push_back(mp[y]);
		mp[y]->children.push_back(mp[x]);
	}
	
	for(int i = 1; i <= n; i++){
		dfs(i, -1, 1);
	}
	cout << ans << endl;
	
	return 0;
}

NO.14:分巧克力

#include<iostream>
#include<cstring>
#include<algorithm>

using namespace std;

const int N = 1e5 + 10;

int h[N], w[N];
int n, m; 

bool check(int mid)
{
	int sum = 0;
	for(int i = 1; i <= n; i++){
		int a = h[i] / mid, b = w[i] / mid;
		sum += a * b; 
	}
	return sum >= m;
}

int main(void)
{
	cin >> n >> m;
	
	for(int i = 1; i <= n; i++){
		cin >> h[i] >> w[i];
	}
	
	int l = 0, r = 1e5;
	while(l + 1 != r){
		int mid = (l + r) / 2;
		if(check(mid)) l = mid;
		else r = mid;
	}
	
	cout << l << endl;
	
	return 0;
}