第十届蓝桥杯题解（部分）

蜡笔小金QAQ

已于 2022-04-06 22:32:18 修改

阅读量230

点赞数 3

分类专栏：蓝桥杯文章标签： c++

于 2022-02-19 22:20:29 首次发布

本文链接：https://blog.csdn.net/mrjinneu/article/details/123024972

版权

蓝桥杯专栏收录该内容

8 篇文章 2 订阅

订阅专栏

第十届蓝桥杯题解

注释：这段时间正好在写蓝桥杯的题，将部分的题目的解法和大家分享，代码中的网址是该代码蒟蒻当时参考其他大佬的题解文章所在的网址，鸣谢大佬，如有错误，欢迎各位大佬指正
有部分网址是提交答案的oj传送门

平方和

直接暴力穷举，无需赘述

#include <bits/stdc++.h>
using namespace std;
// https://www.lanqiao.cn/courses/2786/learning/?id=67813
long long ans1 = 0;
long long ans2 = 0;
bool judge(int n)
{
    while (n)
    {
        int remp = n % 10;
        if (remp == 1 || remp == 2 || remp == 0 || remp == 9)
            return true;
        n /= 10;
    }
    return false;
}
int main()
{
    for (int i = 1; i <= 2019; i++)
    {
        if(judge(i))
        {
            ans1+=i;
            ans2+=i*i;
        }
    }
    cout<<ans2;
        return 0;
}

数列求和

枚举过程中注意%1000

#include <bits/stdc++.h>
using namespace std;
// https://www.lanqiao.cn/courses/2786/learning/?id=67813
int a[20190328];
int main()
{
    a[1] = 1;
    a[2] = 1;
    a[3] = 1;
    for (int i = 4; i <= 20190324; i++)
    {
        a[i] = (a[i - 1] + a[i - 2] + a[i - 3])%10000;
    }
    cout<<a[20190324];

    return 0;
}

最大降雨量

一道脑筋急转弯题。我们可以这样去考虑，49天一共可以分为7组，这7组的中位数再取其中位数，可以画一个邻接矩阵，可以发现绝对比答案大的数字只有15个,那么答案是49-15

#include <bits/stdc++.h>
using namespace std;
// https://blog.csdn.net/linruier2017/article/details/88803441?ops_request_misc=&request_id=&biz_id=102&utm_term=%E8%93%9D%E6%A1%A5%E6%9D%AF%E7%AC%AC%E5%8D%81%E5%B1%8AC++&utm_medium=distribute.pc_search_result.none-task-blog-2~all~sobaiduweb~default-1-88803441.first_rank_v2_pc_rank_v29&spm=1018.2226.3001.4187
int main()
{
    cout<<34;

    return 0;
}

迷宫

一道bfs模板题。

#include <bits/stdc++.h>
using namespace std;
// bfs路径打印
// https://blog.csdn.net/ryo_218/article/details/88830082?spm=1001.2101.3001.6661.1&utm_medium=distribute.pc_relevant_t0.none-task-blog-2%7Edefault%7ECTRLIST%7ERate-1.pc_relevant_paycolumn_v3&depth_1-utm_source=distribute.pc_relevant_t0.none-task-blog-2%7Edefault%7ECTRLIST%7ERate-1.pc_relevant_paycolumn_v3&utm_relevant_index=1
int m, n; //长，高
struct node
{
    int x;
    int y;
    string path;
};
char maze[100][100];
bool visit[100][100];
int dirx[4] = {1, 0, 0, -1}; // D<L<R<U
int diry[4] = {0, -1, 1, 0};
char dir[4] = {'D', 'L', 'R', 'U'};
bool judge(int x, int y, int startx, int starty)
{
    if (x == n && y == m)
        return true;
    else
        return false;
}
void bfs(int startx, int starty)
{
    queue<node> q;
    visit[startx][starty] = 1;
    node p;
    p.x = startx, p.y = starty;
    q.push(p);
    while (!q.empty())
    {
        int x = q.front().x;
        int y = q.front().y;
        string way = q.front().path;
        q.pop();
        if (judge(x, y, startx, starty))
        {
            cout << way;
            return;
        }
        for (int i = 0; i < 4; i++)
        {
            int rempx = x + dirx[i];
            int rempy = y + diry[i];
            string rempway = way + dir[i];
            if (maze[rempx][rempy] == '0' && visit[rempx][rempy] == 0 && rempx <= n && rempx > 0 && rempy <= m && rempy > 0)
            {
                // cout<<"1 ";
                //  cout<<rempway<<endl;
                visit[rempx][rempy] = 1;
                node remp;
                remp.x = rempx, remp.y = rempy, remp.path = rempway;
                // cout << rempway << endl;
                q.push(remp);
            }
        }
    }
}
int main()
{
    ios::sync_with_stdio(false);
    cin >> m >> n;
    for (int i = 1; i <= n; i++)
    {
        string remp;
        cin >> remp;
        for (int j = 1; j <= m; j++)
        {
            maze[i][j] = remp[j - 1];
        }
    }
    bfs(1, 1);
    return 0;
}
/* 样例
50 30
01010101001011001001010110010110100100001000101010
00001000100000101010010000100000001001100110100101
01111011010010001000001101001011100011000000010000
01000000001010100011010000101000001010101011001011
00011111000000101000010010100010100000101100000000
11001000110101000010101100011010011010101011110111
00011011010101001001001010000001000101001110000000
10100000101000100110101010111110011000010000111010
00111000001010100001100010000001000101001100001001
11000110100001110010001001010101010101010001101000
00010000100100000101001010101110100010101010000101
11100100101001001000010000010101010100100100010100
00000010000000101011001111010001100000101010100011
10101010011100001000011000010110011110110100001000
10101010100001101010100101000010100000111011101001
10000000101100010000101100101101001011100000000100
10101001000000010100100001000100000100011110101001
00101001010101101001010100011010101101110000110101
11001010000100001100000010100101000001000111000010
00001000110000110101101000000100101001001000011101
10100101000101000000001110110010110101101010100001
00101000010000110101010000100010001001000100010101
10100001000110010001000010101001010101011111010010
00000100101000000110010100101001000001000000000010
11010000001001110111001001000011101001011011101000
00000110100010001000100000001000011101000000110011
10101000101000100010001111100010101001010000001000
10000010100101001010110000000100101010001011101000
00111100001000010000000110111000000001000000001011
10000001100111010111010001000110111010101101111000
*/

RSA解密

额，这个题我的代码只能参考！~ 答案是跑不出来的 ~只能讲一下我的代码的大(cuo)概(wu)思路，首先求出p，q，求出p，q后转化为求逆元问题，再转化为求 C^d%e的问题。从网上查了很长时间也没搞懂怎么优化。直接摆烂了、、、、、
(数论不会我是菜鸡)

#include <bits/stdc++.h>
using namespace std;
// 素数筛+欧几里得拓展+快速幂
int num = 0;
long long e;
long long d = 212353;
long long n = 1001733993063167141;
long long C = 20190324;
long long p, q;
long long remp;
long long fast_power(long long a, long long b, long long c) //(a^b) %c
{
    a = a % c;
    long long ans = 1;
    while (b)
    {
        a = a % c;
        if (b % 2 == 1)
            ans = (ans * a) % c;
        b = b / 2;
        a = (a * a) % c;
    }
    return ans;
}
long long ex_gcd(long long a, long long b, long long &x, long long &y)
{
    if (b == 0)
    {
        x = 1;
        y = 0;
        return a;
    }
    long long d = ex_gcd(b, a % b, x, y);
    long long tmp = x;
    x = y;
    y = tmp - a / b * y;
    return d;
} //这个是解 ax+by=c的特殊解方程
int main()
{
    for (int i = 2; i < n; i++)
    {
        if (n % i == 0)
            p = i, q = n % i;
    } // p,q得到
    // p = 891234941, q = 1123984201
    // 那么可得d * e % sum == 1, 这是一个典型的求解ax=c(mod b)问题。
    // 也就是e*d =1(mod sum)，我们可以用扩展欧几里得算法来求解
    // 欧几里得拓展
    long long sum = (p - 1) * (q - 1);
    long long x, y;
    e = ex_gcd(d, sum, x, y);
    e = (e % sum + sum) % sum;
    // cout << e;
    // 现在求 C^e%d
    cout << fast_power(C, e, d);
    return 0;
}

完全二叉树权值

一道数据结构概念题，只要知道完全二叉树的基本概念就迎刃而解了，0-2^{1-1是第一层，2}1~2^{2-1是第二层，2}2->2^2-1是第三层…以此类推

#include <bits/stdc++.h>
using namespace std;
// 传送门：http://lx.lanqiao.cn/problem.page?gpid=T2695
// 完全二叉树基本性质
#define INF 0x7fffffff
long long root[100000];
long long a[100000];
int n;
int limit = 0;
int num = 0;
int main()
{
    ios::sync_with_stdio(false);
    cin >> n;
    cin >> a[1];
    root[1] = a[1];
    num = 2;
    limit = 4;
    for (int i = 2; i <= n; i++)
    {
        cin >> a[i];
        root[num] += a[i];
        if (i + 1 == limit)
        {
            limit = limit * 2;
            num++;
        }
    }
    long long ans = 0;
    long long max1 = -INF;
    for (int i = 1; i <= num; i++)
    {
        if (max1 <= root[i])
        {
            max1 = root[i];
            ans = i;
        }
    }
    cout << ans;
    return 0;
}

外卖店队列

一道模拟题，如果直接以时间单位为循环入手直接TLE(别问我怎么知道的T—T)，可以考虑枚举每一订单，当商店接到订单之后才去处理它，可以大大减少时间

#include <bits/stdc++.h>
using namespace std;
// http://lx.lanqiao.cn/problem.page?gpid=T2697
// 参考题解：https://blog.csdn.net/qq_26139541/article/details/121284273?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522164491769216781685391475%2522%252C%2522scm%2522%253A%252220140713.130102334.pc%255Fall.%2522%257D&request_id=164491769216781685391475&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2~all~first_rank_ecpm_v1~rank_v31_ecpm-8-121284273.first_rank_v2_pc_rank_v29&utm_term=%E5%A4%96%E5%8D%96%E5%BA%97%E4%BC%98%E5%85%88%E7%BA%A7&spm=1018.2226.3001.4187
// 模拟
#define maxn 1000000
pair<int, int> order[maxn];
long long n, m, t;
int ans[maxn];        //记录每一家商店的分值
long long last[maxn]; // 记录第i个商店上一次订单出现的时间
bool first[maxn];     //进入优先序列
int main()
{
    ios::sync_with_stdio(false);
    cin >> n >> m >> t;
    for (int i = 1; i <= m; i++)
    {
        cin >> order[i].first >> order[i].second;
    }
    sort(order + 1, order + 1 + m); //让订单从小到大排序
    for (int i = 1; i <= m; i++)
    {
        int ts = order[i].first, id = order[i].second;
        if (ts != last[id]) //防止出现同一时间同一家店的订单的影响
        {
            ans[id] = ans[id] - (ts - last[id] - 1); //清算从上一次订单到现在中间所下降的分值
        }
        ans[id] = max(ans[id], 0);
        if (ans[id] <= 3)
        {
            first[id] = false;
        }
        ans[id] += 2;
        if (ans[id] > 5)
            first[id] = true;
        last[id] = ts; //更新last数组
    }
    for (int i = 1; i <= n; i++)
    { //将第m天统一进行更新（因为之前的操作的更新只会在有订单时更新，大部分商店ans数据仍然处于上一次订单更新状态）
        if (last[i] != t)
            ans[i] = ans[i] - (t - last[i]);
        if (ans[i] <= 3) 
            first[i] = false;
    }
    long long res = 0;
    for (int i = 1; i <= n; i++)
    {
        if (first[i])
            res++;
    }
    cout << res;
    return 0;
}

二刷的时候用了结构体存数据，思路更清晰了一些

#include <bits/stdc++.h>
using namespace std;
struct node1
{
	int lastcall;
	int ans;
	bool flag;//记录是否在优先序列 
}shop[100010];
struct node2
{
	int time;
	int id;
}ding[100010];
bool cmp1(node2 a,node2 b) //排订单 
{
	if(a.time!=b.time)
	return a.time<b.time;
	else
	return a.id<b.id;
}
int main()
{
	int n,m,t;
	scanf("%d %d %d",&n,&m,&t);
	for(int i=1;i<=m;i++)
	{
		int time,id;
		scanf("%d %d",&time,&id);
		ding[i].time=time;
		ding[i].id=id;
	} 
	sort(ding+1,ding+1+m,cmp1);
	for(int i=1;i<=m;i++)
	{
		int id=ding[i].id;
		int time=ding[i].time;
		if(shop[id].lastcall!=time)
		{
			shop[id].ans-=(time-1-shop[id].lastcall); //有订单的时候，不减反增 
		}
		shop[id].ans=max(shop[id].ans,0);
		if(shop[id].flag&&shop[id].ans<=3)
			shop[id].flag=false;
		shop[id].ans+=2;
		shop[id].lastcall=time;
		if(shop[id].ans>5)
			shop[id].flag=true;
	}	
	for(int i=1;i<=n;i++) //更新最后一天 
	{
		if(shop[i].lastcall!=t)
		{
			shop[i].ans-=(t-shop[i].lastcall); //有订单的时候，不减反增 
		}
//		shop[id].ans=max(shop[id].ans,0);
		if(shop[i].flag&&shop[i].ans<=3)
			shop[i].flag=false;
	}
	long long res=0;
	for(int i=1;i<=n;i++)
	{
		if(shop[i].flag)
		res++;
		
	}
	cout<<res;
	return 0;
}