2018蓝桥杯省赛B组

知行Yi

于 2023-03-11 16:21:28 发布

阅读量188

点赞数

文章标签：蓝桥杯算法深度优先

本文链接：https://blog.csdn.net/Jun_Bu_Jian_/article/details/129465037

版权

1361: [蓝桥杯2018初赛]乘积尾零
高精度

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

using namespace std;

vector<int> mul(vector<int> A, vector<int> B) {
    // A: 4 3 2 1
    // B: 6 5
    vector<int> C(A.size() + B.size() + 7, 0);  // 数组C开大一点没事，反正可以去前导零的
    for (int i = 0; i < A.size(); i ++) {
        for (int j = 0; j < B.size(); j ++) {
            C[i + j] += A[i] * B[j];
        }
    }

    // 处理进位
    for (int i = 0; i + 1 < C.size(); i ++) {
        C[i + 1] += C[i] / 10;
        C[i] %= 10;
    }

    // 处理前导零 "0000" 去掉前导零
    while (C.size() > 1 && C.back() == 0) C.pop_back();
    return C;
}

int main() {
    // string s1,s2;
    
    // vector<int> A;
    // A.push_back(1);
    // vector<int> C;
    
    // for(int i = 1;i <= 100;i ++){
    //     cin >> s1;
    //     vector<int> B;
    //     for (int i = s1.size() - 1; i >= 0; i --) B.push_back(s1[i] - '0');
    //     C = mul(A, B);
    //     A = C;
    // }
    
    
    // for (int i = 0; i < C.size(); i ++) cout << C[i];
    // cout << endl;
    
    string s = "0000000000000000000000000000000";
    cout << s.size() << endl;
    
    return 0;
}

1365: [蓝桥杯2018初赛]全球变暖
dfs

#include <iostream>
#include <cstring>
#include <algorithm>
#include <set>
 
using namespace std;
const int N = 1005;
char s[N][N];
int dx[] = {1,-1,0,0};
int dy[] = {0,0,1,-1};
int cnt,n;
int st[N][N];
 
void dfs(int x,int y){
    st[x][y] = cnt;
    for(int i = 0;i < 4;i ++){
        int a = x + dx[i];
        int b = y + dy[i];
        if(a < 1 || b < 1 || a > n || b > n) continue;
        if(s[a][b] == '#' && !st[a][b])
            dfs(a,b);
    }
}
 
int main()
{
    cin >> n;
    for(int i = 1;i <= n;i ++)
        for(int j = 1;j <= n;j ++)
            cin >> s[i][j];
    //先求出来有几块联通块，
    //再淹没看还有几块;
    for(int i = 1;i <= n;i ++)
        for(int j = 1;j <= n;j ++)
            if(s[i][j] == '#' && !st[i][j]){
                cnt ++;
                dfs(i,j);
            }
     
    //淹没
    for(int i = 1;i <= n;i ++)
        for(int j = 1;j <= n;j ++)
            if(!st[i][j])
                for(int o = 0;o < 4;o ++){
                    int x = i + dx[o];
                    int y = j + dy[o];
                    if(x < 1 || y < 1 || x > n || y > n) continue;
                    s[x][y] = '.';
                }
    // for(int i = 1;i <= n;i ++){
    //     for(int j = 1;j <= n;j ++)
    //         cout << st[i][j];
    //     cout << endl;    
    // }
     
    set<int> S;   
    for(int i = 1;i <= n;i ++)
        for(int j = 1;j <= n;j ++)
            if(st[i][j] && s[i][j] == '#')
                S.insert(st[i][j]);
    cout << cnt - S.size() << endl;            
    return 0;
}
/**************************************************************
    Problem: 1365
    User: 1533050560 [知行Yi]
    Language: C++
    Result: 正确
    Time:63 ms
    Memory:12564 kb
****************************************************************/

1373: [蓝桥杯2018初赛]日志统计
双指针

#include <iostream>
#include <algorithm>
#include <vector>
 
using namespace std;
const int N = 1e5 + 5;
vector<int> r[N];
int ans[N];
int s[N];
vector<int> a;
 
int n,k,d;
 
int main()
{
    cin >> n >> d >> k;
    int st,id;
     
    for(int i = 1;i <= n;i ++){
        cin >> st >> id;
        r[st].push_back(id);
    }    
     
    for(int i = 0;i <= 100000;i ++){
        if(i - d >= 0)
            for(auto x : r[i - d])
                ans[x] --;
         
        for(auto x : r[i]){
            ans[x] ++;
            if(ans[x] == k && s[x] == 0){
                a.push_back(x);
                s[x] = 1;
            }
        }
    }
     
    sort(a.begin(),a.end());
    for(auto x : a)
        cout << x << '\n';
    return 0;
}
/**************************************************************
    Problem: 1373
    User: 1533050560 [知行Yi]
    Language: C++
    Result: 正确
    Time:160 ms
    Memory:7688 kb
****************************************************************/

1370: [蓝桥杯2018初赛]测试次数
DP

#include <iostream>
#include <algorithm>
#include <vector>
 
using namespace std;
const int N = 1005;
int dp[N][N];//最坏情况下需要搞几次
//dp[i][j] 表示区间长度是i时，手机部数为j时的情况下需要的次数;
int n,m;
 
int main()
{
    //二分莫得法子搞 ———— 手机没有那么多;
    n = 1000,m = 3;
    for(int i = 1;i <= n;i ++)
        dp[i][1] = i;
     
    for(int j = 2;j <= 3;j ++)
        for(int i = 1;i <= 1000;i ++){
            //最坏的情况;
            dp[i][j] = dp[i - 1][j] + 1;
            //遍历所有情况;
            for(int k = 1;k <= i;k ++)
                dp[i][j] = min(dp[i][j],1 + max(dp[k - 1][j - 1],dp[i - k][j]));
        }
     
    cout << dp[1000][3] << endl;
    return 0;
}
/**************************************************************
    Problem: 1370
    User: 1533050560 [知行Yi]
    Language: C++
    Result: 正确
    Time:4 ms
    Memory:5392 kb
****************************************************************/

1371: [蓝桥杯2018初赛]递增三元组
排序+双指针

#include <iostream>
#include <algorithm>
#include <vector>
 
using namespace std;
typedef long long LL;
const int N = 1e5 + 5;
int a[N],b[N],c[N];
int n;
 
int main()
{
    cin >> n;
    for(int i = 1;i <= n;i ++) cin >> a[i];
    for(int i = 1;i <= n;i ++) cin >> b[i];
    for(int i = 1;i <= n;i ++) cin >> c[i];
     
    sort(a + 1,a + n + 1);
    sort(b + 1,b + n + 1);
    sort(c + 1,c + n + 1);
    LL ans = 0;
     
    LL l = 0,r = 0;
    for(int i = 1;i <= n;i ++){
        while(a[l + 1] < b[i] && l + 1 <= n) l ++;
        while(c[r + 1] <= b[i] && r + 1 <= n) r ++;
         
        //cout << l << " " << n - r << endl;
        ans += l * (n - r);
    }
     
    cout << ans << endl;
    return 0;
}
/**************************************************************
    Problem: 1371
    User: 1533050560 [知行Yi]
    Language: C++
    Result: 正确
    Time:84 ms
    Memory:2612 kb
****************************************************************/

1374: [蓝桥杯2018初赛]乘积最大
贪心注意爆long long

#include <algorithm>
#include <vector>
#include <cstring>
#include <iostream>
 
using namespace std;
typedef long long LL;
const LL mod = 1000000009;
const int N = 1e5 + 5;
int a[N];
int n,k;
 
void solve(){
    LL ans = 1,f = 1;
    cin >> n >> k;
     
    for(int i = 1;i <= n;i ++) cin >> a[i];
    sort(a + 1,a + n + 1);
     
    int l = 1,r = n;
    if(k&1){
        ans = a[r];
        r --;
        k --;
         
        if(ans < 0) f = -1;
    }
    while(k){
        LL x = (LL)a[l] * a[l + 1];
        LL y = (LL)a[r] * a[r - 1];
         
        if(x * f < y * f){
            ans = y % mod * ans % mod;
            r -= 2;
        } else {
            ans = x % mod * ans % mod;
            l += 2;
        }
        k -= 2;
    }
    cout << ans << endl;
    //cout << (ans + mod) % mod << '\n';
}
 
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0); 
    cout.tie(0);
     
    solve();
    return 0;
}
/**************************************************************
    Problem: 1374
    User: 1533050560 [知行Yi]
    Language: C++
    Result: 正确
    Time:73 ms
    Memory:1852 kb
****************************************************************/

1372: [蓝桥杯2018初赛]螺旋折线
找规律

#include <cstring>
#include <iostream>
#include <algorithm>
 
using namespace std;
 
typedef long long LL;
 
int main()
{
    int x, y;
    cin >> x >> y;
 
    if (abs(x) <= y)  // 在上方
    {
        int n = y;
        cout << (LL)(2 * n - 1) * (2 * n) + x - (-n) << endl;
    }
    else if (abs(y) <= x)  // 在右方
    {
        int n = x;
        cout << (LL)(2 * n) * (2 * n) + n - y << endl;
    }
    else if (abs(x) <= abs(y) + 1 && y < 0)  // 在下方
    {
        int n = abs(y);
        cout << (LL)(2 * n) * (2 * n + 1) + n - x << endl;
    }
    else  // 在左方
    {
        int n = abs(x);
        cout << (LL)(2 * n - 1) * (2 * n - 1) + y - (-n + 1) << endl;
    }
 
    return 0;
}
/**************************************************************
    Problem: 1372
    User: 1533050560 [知行Yi]
    Language: C++
    Result: 正确
    Time:6 ms
    Memory:1452 kb
****************************************************************/