2022蓝桥杯省赛C++B组补题

C.刷题统计—模拟

#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
#define int long long
const int N = 100010;


signed main()
{
	int a,b,n;
	cin>>a>>b>>n;
	int res=0;
	int t=a*5+b*2;
	res+=n/t*7;
	n%=t;
	if(n>5*a)res+=5,n-=5*a,res+=(n+b-1)/b;
	else res+=(n+a-1)/a;
	cout<<res<<'\n';
}

D.修剪灌木—模拟

#include <iostream>
using namespace std;

signed main()
{
	int n;cin>>n;
	for(int i=1;i<=n;i++)cout<<max(i-1,n-i)*2<<'\n';
}

E.X 进制减法—数学推导

#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
const int mod = 1000000007;
#define int long long
const int N = 200010;
int a[N]={0},b[N]={0};
signed main()
{
	int n,m1,m2;
	cin>>n>>m1;
	for(int i=m1;i>=1;i--)cin>>a[i];
    cin>>m2;
	for(int i=m2;i>=1;i--)cin>>b[i];
	int m=max(m1,m2);
	int res=0;
	for(int i=m;i>=1;i--)
	    res=(res*max({2ll,a[i]+1,b[i]+1})+a[i]-b[i])%mod;
	cout<<res<<'\n';
}

F.统计子矩阵—前缀和+双指针

#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <bitset>
#include <map>
#include <cmath>
#include <cstdio>
#include <ctime>
using namespace std;
#define int long long
const int N = 510;
int s[N][N];
int n,m,k;
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
	cin>>n>>m>>k;
	for(int i=1;i<=n;i++)
	    for(int j=1;j<=m;j++)
	        cin>>s[i][j],s[i][j]+=s[i-1][j];
	int res=0;
	for(int i=1;i<=n;i++)
	{
	    for(int j=i;j<=n;j++)
	    {
	        for(int l=1,r=1,sum=0;r<=m;r++)
	        {
	            sum+=s[j][r]-s[i-1][r];
	            while(sum>k)
	            {
	                sum-=s[j][l]-s[i-1][l];
	                l++;
	            }
	            res+=r-l+1;
	        }
	    }
	}
	cout<<res<<'\n';
	
}

G.积木画—状压DP

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
#define int long long
const int mod = 1000000007;
int f[2][3];
signed main()
{
	int n;cin>>n;
	f[1][0]=1;
	f[1][1]=2;
	f[1][2]=1;
	for(int i=2;i<=n;i++)
	{
		f[i&1][0]=(f[i-1&1][2]+f[i-1&1][0])%mod;
		f[i&1][1]=(f[i-1&1][1]+f[i-1&1][0]*2)%mod;
		f[i&1][2]=(f[i-1&1][0]+f[i-1&1][1])%mod;
	}
	cout<<f[n&1][0]<<'\n';
}

H.扫雷—预处理+dfs+手写哈希

#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <bitset>
#include <map>
#include <cmath>
#include <cstdio>
#include <ctime>
using namespace std;
#define int long long
const int N = 50010, M = 999997;
int n,m;
int h[M],id[M];
bool st[M];
struct Point
{
    int x,y,r;
}point[N];
int get_key(int x,int y)
{
    return x*1000000001ll+y;
}
int find(int x,int y)
{
    int key=get_key(x,y);
    int t=(key%M+M)%M;
    while(h[t]!=-1&&h[t]!=key)
        if(++t==M)
            t=0;
    return t;
}
void dfs(int x,int y,int r)
{
    st[find(x,y)]=true;
    for(int i=x-r;i<=x+r;i++)
        for(int j=y-r;j<=y+r;j++)
            if((i-x)*(i-x)+(j-y)*(j-y)<=r*r)
            {
                int t=find(i,j);
                if(id[t]&&!st[t])
                    dfs(i,j,point[id[t]].r);
            }
}
signed main()
{
    memset(h,-1,sizeof h);
	cin>>n>>m;
	for(int i=1,x,y,r;i<=n;i++)
	{
	    cin>>x>>y>>r;
	    point[i]={x,y,r};
	    
	    int t=find(x,y);
	    if(h[t]==-1)h[t]=get_key(x,y);
	    if(!id[t]||point[id[t]].r<r)
	    {
	        id[t]=i;
	    }
	}
	
	int x,y,r;
	while(m--)
	{
	    cin>>x>>y>>r;
	    for(int i=x-r;i<=x+r;i++)
	        for(int j=y-r;j<=y+r;j++)
                if((i-x)*(i-x)+(j-y)*(j-y)<=r*r)
                {
                    int t=find(i,j);
                    if(id[t]&&!st[t])
                        dfs(i,j,point[id[t]].r);
                }
	}
	int res=0;
	for(int i=1;i<=n;i++)
	    if(st[find(point[i].x,point[i].y)])
	        res++;
	cout<<res<<'\n';
}

I.李白打酒加强版—DP

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
#define int long long
const int N = 110, mod = 1000000007;
int n,m;
int f[N][N][N];
signed main()
{
	cin>>n>>m;
	f[0][0][2]=1;
	for(int i=0;i<=n;i++)
	    for(int j=0;j<=m;j++)
	        for(int k=0;k<N;k++)
	        {
	            if(i&&k%2==0)f[i][j][k]=(f[i][j][k]+f[i-1][j][k/2])%mod;
	            if(j)f[i][j][k]=(f[i][j][k]+f[i][j-1][k+1])%mod;
	        }
	cout<<f[n][m-1][1]<<'\n';
}

J.砍竹子—贪心+思维

#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <cmath>
using namespace std;
#define int long long
const int N = 200010;
int f[N][10];
int n,m;
int h[N];
signed main()
{
	cin>>n;
	int res=0;
	for(int i=0;i<n;i++)
	{
	    vector<int>vec;
	    int x;cin>>x;
	    while(x>1)vec.push_back(x),x=sqrt(x/2+1);
	    res+=vec.size();
	    m=max(m,(int)vec.size());
	    for(int j=0,k=vec.size()-1;k>=0;k--,j++)
	    f[i][j]=vec[k];
	}
	for(int i=0;i<m;i++)
	    for(int j=1;j<n;j++)
	        if(f[j][i]&&f[j][i]==f[j-1][i])
	            res--;
	cout<<res<<'\n';
}