codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

476B.md (2457B)


      1 Source: https://codeforces.com/problemset/problem/476/B
      2 
      3 B. Dreamoon and WiFi
      4 
      5 time limit per test
      6 
      7 1 second
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 stdin
     16 
     17 output
     18 
     19 stdout
     20 
     21 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.
     22 
     23 Each command is one of the following two types:
     24 
     25 1. Go 1 unit towards the positive direction, denoted as '+'
     26 2. Go 1 unit towards the negative direction, denoted as '-'
     27 
     28 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).
     29 
     30 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?
     31 
     32 Input
     33 
     34 The first line contains a string *s*1 — the commands Drazil sends to Dreamoon, this string consists of only the characters in the set {'+', '-'}.
     35 
     36 The second line contains a string *s*2 — the commands Dreamoon's smartphone recognizes, this string consists of only the characters in the set {'+', '-', '?'}. '?' denotes an unrecognized command.
     37 
     38 Lengths of two strings are equal and do not exceed 10.
     39 
     40 Output
     41 
     42 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.
     43 
     44 Examples
     45 
     46 Input
     47 
     48 ```
     49 ++-+-  
     50 +-+-+
     51 ```
     52 
     53 Output
     54 
     55 ```
     56 1.000000000000
     57 ```
     58 
     59 Input
     60 
     61 ```
     62 +-+-  
     63 +-??
     64 ```
     65 
     66 Output
     67 
     68 ```
     69 0.500000000000
     70 ```
     71 
     72 Input
     73 
     74 ```
     75 +++  
     76 ??-
     77 ```
     78 
     79 Output
     80 
     81 ```
     82 0.000000000000
     83 ```
     84 
     85 Note
     86 
     87 For the first sample, both *s*1 and *s*2 will lead Dreamoon to finish at the same position  + 1.
     88 
     89 For the second sample, *s*1 will lead Dreamoon to finish at position 0, while there are four possibilites for *s*2: {"+-++", "+-+-", "+--+", "+---"} 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.
     90 
     91 For the third sample, *s*2 could only lead us to finish at positions {+1, -1, -3}, so the probability to finish at the correct position  + 3 is 0.