牛客网 小白月赛6

地址链接：点我
A 鲲
分作弊的情况和不作弊的情况

#include <cstdio>
#include <cmath>

int main() {
    double L, k, a, b, ta, tb, tc;
    scanf("%lf%lf%lf%lf", &L, &k, &a, &b);
    if (a <= b) {
        ta = L / a;
        tb = L / b;
        printf("%.2f\n", tb-ta);
    }else {
        ta = L / a;
        tb = L / b;
        tc = k / (a-b);
        if (2*tc < tb && 2*tc < ta) tb = 2*tc;
         
        printf("%.2f\n", tb-ta);
    }
    return 0;
}

B 鹏
模拟

#include<iostream> 
using namespace std;
int main(){
	int n;
	scanf("%d",&n);
	int up=0;
	int x1,x2;
	scanf("%d",&x1);
	int cnt=0;
	for(int i=1;i<n;i++){
		scanf("%d",&x2);
		if(x2>x1){
			up=1;
			x1=x2;
		}
		else if(x2<x1&&up==1){
			cnt++;
			up=0;
			x1=x2;
		}
		else if(x2<x1&&up==0){
			x1=x2;
		}
	}
	printf("%d\n",cnt);
} 

C 桃花
求树的直径

#include<bits/stdc++.h>
using namespace std;
#define MEM(a,b,start,end) for(int ii=start;ii<=end;ii++) a[ii]=b;
const int maxn=1000000+100;
struct Edge{
    int to,next;
}edge[maxn<<1];
int head[maxn],tot;
int MAX;
int du[maxn];
void DFS(int u,int d,int fa){
    du[u]=d;
    int Max=0,SMax=0;
    for(int i=head[u];i!=-1;i=edge[i].next){
         
        Edge e=edge[i];
        int v=e.to;
        if(v==fa)  continue;
        DFS(v,d+1,u);
        int num=du[v]-d;
        du[u]=max(du[u],du[v]);
        if(num>SMax) SMax=num;
        if(SMax>Max) swap(SMax,Max);
    }
    MAX=max(MAX,SMax+Max+1);
}
 
int main(){
     int n;
     scanf("%d",&n);
     MEM(head,-1,1,n);
     for(int i=1;i<n;i++){
        int u,v;
        scanf("%d%d",&u,&v);
        edge[tot].to=v;
        edge[tot].next=head[u];
        head[u]=tot++;
        edge[tot].to=u;
        edge[tot].next=head[v];
        head[v]=tot++;
     }
     DFS(1,1,-1);
     printf("%d\n",MAX);
}

D 字符串丝带
开两个数组记录一下

#include<bits/stdc++.h>
using namespace std;
const int maxn=1000000+100;

char ch[maxn];
int num[100];
int cnt[maxn];

int main(){
    int n,m;
    scanf("%d%d",&n,&m);
    scanf("%s",ch);
    for(int i=0;i<n;i++){
    	
    	num[ch[i]-'a']++;
    	cnt[i+1]=num[ch[i]-'a'];
	}
	while(m--){
		
		int ind;
		scanf("%d",&ind);
		printf("%d\n",cnt[ind]);
	}
}

E 对弈
就直接模拟吧，但是没做出来，这里就直接贴大佬的代码了。

#include <bits/stdc++.h>
using namespace std; typedef long long ll;
inline int read(); inline void write(int x);
const int M = 1280, MOD = 1000000007;
  
const int go[4][2] = {{1,1},{0,1},{1,0},{-1,1}};
//1,1 - n,n对应 5,5 - n+4,n+4, 所有棋子横纵坐标+4
int save[M][M];
int main(void)
{
    int n=read(),m=read();
    int ans = 0, ansstep = m, player = -1; //1表示htbest,-1表示whz
    for(int step = 1;step<=m; step++)
    {
        player *= -1;
        int x=read()+4,y=read()+4;
        save[x][y] = player;
        for(int k = 0;k<4;k++)
        {
            int px = x - 4*go[k][0], py = y-4*go[k][1];
            int lx = 0,alx = 0;
            for(int cnt = 0;cnt<9;cnt++)
            {
                if(save[px][py]==player)
                {
                    lx++;
                    alx = max(alx,lx);
                }
                else
                {
                    lx = 0;
                }
                px +=go[k][0],py+=go[k][1];
            }
            if(alx>=5)
            {
                ans = player;
                ansstep = step;
                goto end;
            }
        }
    }
    end:
    if(ans==0)
        printf("UNK %d\n",m);
    else if(ans==1)
        printf("HtBest %d\n",ansstep );
    else
        printf("WHZ %d\n",ansstep );
    return 0;
}
  
  
inline int read()
{
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9') {if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
inline void write(int x)
{
     if(x<0) putchar('-'),x=-x;
     if(x>9) write(x/10);
     putchar(x%10+'0');
}

F 发电
用线段树或树状数组可做
单点更新，区间查询

#include<stdio.h>
typedef long long ll;
#define lson l ,mid ,t << 1
#define rson mid + 1 ,r ,t << 1 | 1
#define MOD 1000000007

ll sum[1000000*4+100];
long long pow_mod(long long a,long long b,long long m)
{
    a=a%m;
    long long ans=1;
    while(b)
    {
        if(b&1)
        {
            ans=(ans*a)%m;
            b--;
        }
        b>>=1;
        a=a*a%m;
    }
    return ans;
}
void Pushup(int t)
{
    sum[t] = ((sum[t<<1] % MOD) * (sum[t<<1|1] % MOD)) % MOD;
}

void BuidTree(int l ,int r ,int t)
{
    sum[t] = 1;
    if(l == r)
    {
        sum[t]=1;
        
        return;
    }
    int mid = (l + r) >> 1;
    BuidTree(lson);
    BuidTree(rson);
    Pushup(t);
}

void Update(int l ,int r ,int t ,int a ,int b)
{
     if(l == r)
     {
          sum[t] = (sum[t]*b) % MOD;
          return;
     }
     int mid = (l + r) >> 1;
     if(a <= mid) Update(lson ,a ,b);
     else Update(rson ,a ,b);
     Pushup(t);
}
ll Query(int l ,int r ,int t ,int a ,int b)
{
    if(a <= l && b >= r)
    return sum[t];
    int mid = (l + r) >> 1;
    ll ans = 1;
    if(a <= mid) ans *= Query(lson ,a ,b) % MOD;
    if(b > mid) ans *= Query(rson ,a ,b) % MOD;
    return ans % MOD;
}

int main ()
{
    int i ,n ,m ,a ,b ,c;
    scanf("%d%d",&n,&m);
    BuidTree(1 ,n ,1);
    
    while(m--)
    {
        scanf("%d %d %d" ,&a ,&b ,&c);
        if(a==1) Update(1 ,n ,1 ,b ,c);  //b位置乘以c 
        else if(a==2){                   //b位置除以c 
        	ll inv=pow_mod(c,MOD-2,MOD);
            
			Update(1,n,1,b,inv);
		} 
        else printf("%lld\n" ,Query(1 ,n ,1 ,b ,c) % MOD);
    }

    return 0;
}
     

G 指纹锁
set模拟

#include<iostream>
#include<cstdio>
#include<set>
const int mod=1000000007;
using namespace std;
set<int>s;
inline int read(); inline void write(int x);
int search(int n){
	auto it=s.lower_bound(n);
	if(it==s.end()) return mod;
	return *it;
}
int main(){
	int m,k;
    m=read();k=read();
	char ch[10];
	int a;
	while(m--){
		scanf("%s %d",ch,&a);
		if(ch[0]=='a'){
			if(search(a-k)>a+k){
				s.insert(a);
			}
		}
		else if(ch[0]=='d'){
			int pos=search(a-k);
			
			while(pos<=a+k){
				s.erase(pos);
				pos=search(a-k);
				
			}
		}
		else{
			if(search(a-k)<=a+k){
				puts("Yes");
			}
			else{
				puts("No");
			}
		}
	}
	
	
}
inline int read()
{
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9') {if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
inline void write(int x)
{
     if(x<0) putchar('-'),x=-x;
     if(x>9) write(x/10);
     putchar(x%10+'0');
}

H 挖沟
并查集生成最小生成树

#include<bits/stdc++.h> 
#define M 500000+10
struct st
{
    int u,v,w;
}edge[M];
int f[M];
int cmp1(const void *a,const void *b)
{
    return (*(struct st*)a).w-(*(struct st *)b).w;
}
int cmp2(const void *a,const void *b)
{
    return (*(struct st*)b).w-(*(struct st *)a).w;
}
int finde(int x)
{
    if(x!=f[x])
        f[x]=finde(f[x]);
    return f[x];
}
void make(int a,int b)
{
    int x=finde(a);
    int y=finde(b);
    if(x!=y)
        f[x]=y;
}
int main()
{
    int i,m,n,a,b,c;
    scanf("%d%d",&n,&m);
        for(i=0;i<m;i++)
        {
            scanf("%d%d%d",&a,&b,&c);
            edge[i].u=a;
            edge[i].v=b;
            edge[i].w=c;
        }
        for(i=1;i<=n;i++)
            f[i]=i;
        qsort(edge,m,sizeof(edge[0]),cmp1);
        int sum=0;
        for(i=0;i<m;i++)
        {
            int u=edge[i].u;
            int v=edge[i].v;
            if(finde(u)!=finde(v))
            {
                sum+=edge[i].w;
                make(u,v);
            }
        }
        printf("%d\n",sum);
    
    return 0;
}

J 洋灰三角
等比数列求和
f(n)=kf(n-1)+p;
设x，f(n)+x=kf(n-1)+p+x=k*[f(n-1)+p/k+x/k]
代进去，然后求出来，x等于p/(k-1) ，等比数列求和，但是有分数。求一下(k-1) % 1e9+7的逆元inv=pow(k-1,mod-2); 同时还要注意k==1的情况

#include<bits/stdc++.h>
using namespace std;
  
typedef long long ll;
typedef unsigned long long ull;
  
const int mod = 1e9 + 7;
const int maxn = 1e6 + 7;


  
ll n, k, p, ans;
  
ll Mod_Pow(ll x, ll n, ll mod) {
    ll res = 1;
    while(n) {
        if(n & 1) res = res * x % mod;
        x = x * x % mod;
        n >>= 1;
    }
    return res;
}
  
int main() {
    scanf("%lld%lld%lld", &n, &k, &p);
    if(k == 1) {
        ans = n + (((n-1) * n) / 2  % mod * p) % mod;
    } else {
        ans = ((k + p - 1) * (Mod_Pow(k, n, mod) - 1)) % mod * Mod_Pow(k * k - 2 * k + 1, mod - 2, mod) % mod - ((n * p % mod) * Mod_Pow(k - 1, mod - 2, mod)) % mod;
    }
    printf("%lld\n", (ans + mod) % mod);
    return 0;
}