ENG  RUS Timus Online Judge
Online Judge
Problems
Authors
Online contests
Site news
Webboard
Problem set
Submit solution
Judge status
Guide
Register
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

## Discussion of Problem 1716. Alternative Solution

O(1) Formula
Posted by Sereja Slotin 19 Oct 2016 23:30
I don't know why there were so many submitted O(n^2) DP solutions. Here is a simple formula for this problem:
answer = n - (yes + yes*(yes-1) + no*(no-1))/n, where yes = s-2*n and no = n-yes are the total numbers of occurrences of corresponding strings in answer.txt.
You can easily derive this if you try to think of probability of the same verdict for two arbitrary consecutive tests.
Re: O(1) Formula
Posted by Felix_Mate 21 Jun 2017 15:06
Why this formula is right? I solved problem by DP, but i can't prove this formula.
Re: O(1) Formula
Posted by Mahilewets 28 Jul 2017 20:45
For any test,  the probability to answer correctly is:

the probability that the test is  the first test and the answer on that test is "yes"
plus
the probability that the answer is on that test is "yes" and the answer on the previous test is also "yes"
plus
the probability that the answer on that test is "no"  and the answer on previous test is also "no"

That is:
p=(1/n) *yes/n + (yes/n)*((yes-1)/n) + (no/n)*((no-1)/n)

The probability to fail the test is:

q=1-p

There are n tests,  so the expected count is:
ans=n*q=n-(yes*yes+no*(no-1))/n
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0}