zoukankan      html  css  js  c++  java
  • B. Dreamoon and WiFi(Codeforces Round 272)

    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.

    Sample test(s)
    input
    ++-+-
    +-+-+
    
    output
    1.000000000000
    
    input
    +-+-
    +-??
    
    output
    0.500000000000
    
    input
    +++
    ??-
    
    output
    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.

    将全部可能的路径dfs推断一遍即可了。

    代码:

    #include <cstdio>
    #include <cstring>
    #include <algorithm>
    using namespace std;
    char s1[20],s2[20];
    int acou=0,dao=0,sum=0;
    int n1,n2;
    void solve(int n,int at)
    {
    	if(n==n2)
    	{
    		if(at==acou)
    			dao++;
             sum++;
    		return;
    	}
    	if(s2[n]=='+')
    		solve(n+1,at+1);
    	else if(s2[n]=='-')
    		solve(n+1,at-1);
    	else
    	{
    		solve(n+1,at+1);
    		solve(n+1,at-1);
    	}
    }
    
    int main()
    {
        scanf("%s",s1);
        scanf("%s",s2);
        n1=strlen(s1);
        n2=strlen(s2);
    	for(int i=0;i<n1;i++)
    		if(s1[i]=='+')
    			acou++;
    		else
    			acou--;
    	solve(0,0);
    	printf("%.12f
    ",(double)(dao)/(sum));
    	return 0;
    }
    


  • 相关阅读:
    redis缓存问题解决方案
    JVM 2-垃圾收集及内存分配策略
    JVM 1-内存管理
    mysql数据库基础
    事务学习
    使用redis分布式锁来解决集群项目的定时任务冲突问题
    Spring AOP学习
    Spring IOC
    java语言基础7--线程相关类
    多重背包的二进制优化——DP
  • 原文地址:https://www.cnblogs.com/bhlsheji/p/4533173.html
Copyright © 2011-2022 走看看