codeforces354总结

A题 ：签到
B题 ：
把t体积水往下倒，满了分两个相等的流，不能dp因为到后来水不是同时下去的。。。

#include<cstdio>
double c[110][110];
int n,t;
int main()
{
    scanf("%d%d",&n,&t);
    c[1][1] = (double)t;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=i;j++)
            if(c[i][j]>1.0)
            {
               c[i+1][j] += (c[i][j]-1.0)/2.0;
               c[i+1][j+1] += (c[i][j]-1.0)/2.0;
            }
    int sum = 0;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=i;j++)
            if(!(c[i][j]<1.0))sum++;
    printf("%d\n",sum);
    return 0;
}

c题 思维题乱搞 开个队列从前往后扫两遍一遍统计a一遍统计b，当遇到需要改变的字符时把他进队列，当等于K个改变时把队列中的队头元素和前面的元素删掉。

#include<cstdio>
#include<algorithm>
#include<string>
#include<queue>
#define LL long long
using namespace std;
int n,ma,mi,t,k;
char a[110000];
queue<int>qu;
queue<int>qu1;
int main()
{
    scanf("%d%d",&n,&k);
    scanf("%s",a);
    int pre = 0,ans = 0,re = 0,last = -1;
    for(int i=0;i<n;i++)
    {
        if(a[i]=='a')
        {
            pre++;
            ans = max(ans,pre);
        }
        else{
            if(k==0)
            {
                pre = 0;
            }
            else if(re==k){
                int w = qu.front();
                pre-=(w-last);
                pre+=1;
                qu.pop();
                qu.push(i);
                last = w;
            }
            else
            {
               re++;
               pre++;
               qu.push(i);
               ans = max(ans,pre);
            }
        }
    }
    pre = 0,re = 0,last = -1;
    for(int i=0;i<n;i++)
    {
        if(a[i]=='b')
        {
            pre++;
            ans = max(ans,pre);
        }
        else{
            if(k==0)
            {
               pre = 0;
            }
            else if(re==k){
                int w = qu1.front();
                pre-=(w-last);
                pre+=1;
                qu1.pop();
                qu1.push(i);
                last = w;
            }
            else
            {
               re++;
               pre++;
                qu1.push(i);
               ans = max(ans,pre);
            }
        }
    }
    printf("%d\n",ans);
    return 0;
}

D题 有点麻烦的考验手速的bfs,a点能到b点的定义是此时a通b且b通a,
总结下遇到这种题先捋一下思路写的简单点别写一堆否则出bug要坑队友

#include<cstdio>
#include<queue>
#include<map>
using namespace std;
int co[1005][1005][5],n,m;
char mp[1005][1005];
int step[4][2] = {0,1,1,0,0,-1,-1,0};
char s[20] = "+-|^><vLRUD*";
int can[20][4] = {
    1,1,1,1,
    1,0,1,0,
    0,1,0,1,
    0,0,0,1,
    1,0,0,0,
    0,0,1,0,
    0,1,0,0,
    1,1,0,1,
    0,1,1,1,
    1,1,1,0,
    1,0,1,1,
    0,0,0,0
};
map<char,int>mp1;
struct node{
      int x,y,sym,t;
}star,en,no1,no2;
int bfs()
{
    queue<node>qu;
    qu.push(star);
    co[star.x][star.y][star.sym] = 1;
    while(!qu.empty())
    {
        no1 = qu.front();
        qu.pop();
            int x  = no1.x,y = no1.y;
        if(no1.x==en.x&&no1.y==en.y)return no1.t;
        int j = mp1[mp[x][y]];
        for(int i=0;i<4;i++)
           if(can[j][i])
           {
                int X =x+step[(i+no1.sym)%4][0],Y = y+step[(i+no1.sym)%4][1];
                if(X>=1&&X<=n&&Y>=1&&Y<=m&&can[mp1[mp[X][Y]]][(i+2)%4]&&!co[X][Y][no1.sym])
                  {
                     no2 = no1;
                     no2.x = X;
                     no2.y = Y;
                     no2.t++;
                     qu.push(no2);
                     co[X][Y][no1.sym] = 1;     
                  }
           }
           if(!co[x][y][(no1.sym+1)%4])
            {
                no2 = no1;
                no2.t++;
                no2.sym = (no1.sym+1)%4;
                qu.push(no2);
                co[x][y][(no1.sym+1)%4] = 1;
            }
    }
    return -1;
}
int main()
{
    scanf("%d%d",&n,&m);
    for(int i=0;i<12;i++)
        mp1[s[i]] = i;
    for(int i=1;i<=n;i++)
        scanf("%s",mp[i]+1);
    scanf("%d%d",&star.x,&star.y);
    scanf("%d%d",&en.x,&en.y);
    printf("%d\n",bfs());
    return 0;
}

E题 数学题前面写题解了用了一个烂的方法，中途会超long long所以用个烂方法%mod 水过。。。太渣实在想不出更好的方法

#include<cstdio>
#include<algorithm>
#include<string>
#include<iostream>
using namespace std;
#define LL long long
#define mod 4000000017ll  //乱搞 
string a[110000];
LL n,k;
LL ans[110000];

LL transform(string a)
{
    LL l = a.size(),ans = 0,pre = 1;
    for(int i=l-1;i>=0;i--)
    {
      if(a[i]=='-')break;
      ans+=(a[i]-'0')*pre;
      pre*=10;
   }
   if(a[0]=='-')ans = -1*ans;
   return ans;
}

int main()
{
    scanf("%I64d%I64d",&n,&k);
    int sum = 0;
    for(int i=0;i<=n;i++)
    {
        cin>>a[i];
        if(a[i]=="?")sum++;
        ans[i] = transform(a[i]);
    }
    if(k==0)//k为0 
    {
        if(a[0]=="?"){
             if((n+1-sum+1)%2)printf("No\n");
             else printf("Yes\n");
        }
        else 
        {
           if(a[0]=="0")printf("Yes\n");
           else printf("No\n");
        }
    }
    else if(!sum)//无问号 
    {
       LL w = 0;
       for(int i=n;i>=1;i--)
       {
           w = k*w+ans[i];
           w%=mod;
       }
       if(-1*w%mod*k%mod==ans[0]%mod)printf("Yes\n");
       else printf("No\n");
    }
    //有问号 
    else{                          
        if((n+1)%2)printf("No\n");
        else printf("Yes\n");
    }
    return 0;
}