codeforces 476B Dreamoon and WiFi

标签: codeforces 模拟
33人阅读 评论(0) 收藏 举报
分类:

点击打开链接

B. Dreamoon and WiFi
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Dreamoon is standing at the position 0 on a number line. Drazil is sending a list of commands through Wi-Fi to Dreamoon's smartphone and Dreamoon follows them.

Each command is one of the following two types:

  1. Go 1 unit towards the positive direction, denoted as '+'
  2. Go 1 unit towards the negative direction, denoted as '-'

But the Wi-Fi condition is so poor that Dreamoon's smartphone reports some of the commands can't be recognized and Dreamoon knows that some of them might even be wrong though successfully recognized. Dreamoon decides to follow every recognized command and toss a fair coin to decide those unrecognized ones (that means, he moves to the 1 unit to the negative or positive direction with the same probability 0.5).

You are given an original list of commands sent by Drazil and list received by Dreamoon. What is the probability that Dreamoon ends in the position originally supposed to be final by Drazil's commands?

Input

The first line contains a string s1 — the commands Drazil sends to Dreamoon, this string consists of only the characters in the set {'+''-'}.

The second line contains a string s2 — the commands Dreamoon's smartphone recognizes, this string consists of only the characters in the set {'+''-''?'}. '?' denotes an unrecognized command.

Lengths of two strings are equal and do not exceed 10.

Output

Output a single real number corresponding to the probability. The answer will be considered correct if its relative or absolute error doesn't exceed 10 - 9.

Examples
input
Copy
++-+-
+-+-+
output
Copy
1.000000000000
input
Copy
+-+-
+-??
output
Copy
0.500000000000
input
Copy
+++
??-
output
Copy
0.000000000000
Note

For the first sample, both s1 and s2 will lead Dreamoon to finish at the same position  + 1.

For the second sample, s1 will lead Dreamoon to finish at position 0, while there are four possibilites for s2: {"+-++""+-+-""+--+""+---"} with ending position {+2, 0, 0, -2} respectively. So there are 2 correct cases out of 4, so the probability of finishing at the correct position is 0.5.

For the third sample, s2 could only lead us to finish at positions {+1, -1, -3}, so the probability to finish at the correct position  + 3 is 0.


题意看懂了,应该就能做出来了!!!高中的概率问题。

#include <bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<map>
using namespace std;
double fun(int m,int n)
{
    double w1=1.0,w2=1.0,w3=1.0;
    for(int i=1;i<=n;i++)
        w1=w1*i;
    for(int i=1;i<=m;i++)
        w2=w2*i;
    for(int i=1;i<=n-m;i++)
        w3=w3*i;
    return w1/w2/w3;
}
int main()
{
    // freopen("shuju.txt","r",stdin);
    string a,b;
    cin>>a>>b;
    int len=a.length();
    int sum1=0,sum2=0;
    for(int i=0;i<len;i++)
    {
        if(a[i]=='+')
            sum1++;
        else if(a[i]=='-')
            sum1--;
    }
    int wen=0;
    for(int i=0;i<len;i++)
    {
        if(b[i]=='+')
            sum2++;
        else if(b[i]=='-')
            sum2--;
        else if(b[i]=='?')
            wen++;
    }
    // cout<<wen<<endl;
    if(wen==0)
    {
        if(sum1!=sum2)
            printf("%.12f\n",0.0);
        else
            printf("%.12f\n",1.0);
    }
    else
    {
        int dif=abs(sum1-sum2);
        if(wen-dif<0||(wen-dif)&1)
            printf("%.12f\n",0.0);
        else
        {
            int w=(wen-dif)/2;
            double res=fun(w,wen);
            double ans=res/pow(2,wen);
            printf("%.12f\n",ans);
        }
    }
    return 0;
}



查看评论

codeforces B. Dreamoon and WiFi 组合数学求概率

点击打开链接 B. Dreamoon and WiFi time limit per test 1 second memory limit per test 256 megabytes...
  • Dinivity123
  • Dinivity123
  • 2014-11-12 20:46:00
  • 1108

Dreamoon and WiFi

 Dreamoon is standing at the position 0 on a number line. Drazil is sending a list of command...
  • Techay
  • Techay
  • 2015-06-11 20:45:41
  • 260

codeforces 476B Dreamoon and WiFi

点击打开链接 B. Dreamoon and WiFi time limit per test 1 second memory limit per test 25...
  • zhang__liuchen
  • zhang__liuchen
  • 2018-04-15 09:42:40
  • 33

Codeforces Round #272 (Div. 2) 题解

Codeforces Round #272 (Div. 2) A. Dreamoon and Stairs time limit per test 1 sec...
  • u012797220
  • u012797220
  • 2014-10-16 21:02:23
  • 1348

Codeforces Round #272 (Div. 2)

Codeforces Round #272 (Div. 2)
  • Tc_To_Top
  • Tc_To_Top
  • 2014-10-13 01:18:44
  • 2609

Codeforces Round #272 (Div. 2) B Dreamoon and WiFi(简单DP)

思路:dp[i][j]表示考虑到执行第二个串的第i位现在在j位置的概率是多少。 #include using namespace std; double dp[100][100]; cha...
  • qq_21057881
  • qq_21057881
  • 2016-08-27 13:46:53
  • 448

【Codeforces】 477C Dreamoon and Strings

dp[i][j] 记录经过i个zi
  • blankcqk
  • blankcqk
  • 2014-10-13 20:12:46
  • 484

【CODEFORCES】 B. Dreamoon and WiFi

B. Dreamoon and WiFi time limit per test 1 second memory limit per test 256 megabytes ...
  • S_Black
  • S_Black
  • 2015-07-24 20:08:35
  • 612

【Codeforces Round 272 (Div 2)B】【暴力dfs or 组合数】Dreamoon and WiFi 问号填加减方案数使得最后恰好增量为aim

B. Dreamoon and WiFi time limit per test 1 second memory limit per test 256 megabytes ...
  • snowy_smile
  • snowy_smile
  • 2015-12-25 22:23:20
  • 433

Codeforces 476B Dreamoon and WiFi

说好的用dp呢!!!结果dfs一遍就过了 题意大致是,给你两个字符串,一个字符串只由‘+’和‘-’构成,另外一个字符由‘+’、‘-’和‘?’构成,‘?’可能是‘+’也可能是‘-’,题目要求的就是如何...
  • u013617636
  • u013617636
  • 2015-04-24 13:31:54
  • 318
    new-新东西
    这个博客写的好多都是算法,现在有了新的博客,有些东西会发布在这个。。。。。。。。。。。。 访问我的新博客
    个人资料
    持之以恒
    等级:
    访问量: 3万+
    积分: 2353
    排名: 1万+
    最新评论