Solutions are presented as using the least memory and the fastest execution time. It also takes the top 10 most recent solutions from each language. If you want to limit to a specific index, click the "Solved" button and go to that problem.
ContestId |
Name |
Phase |
Frozen |
Duration (Seconds) |
Relative Time |
Start Time |
---|---|---|---|---|---|---|
513 | Rockethon 2015 | FINISHED | False | 11700 | 308494799 | Feb. 7, 2015, 5 p.m. |
Solved$ |
Index |
Name |
Type |
Tags |
Community Tag |
Rating |
---|---|---|---|---|---|---|
( 265 ) | G3 | Inversions problem | PROGRAMMING | dp | 3200 |
B"You are given a permutation of n numbers p1, xe2 x80 x89p2, xe2 x80 x89..., xe2 x80 x89pn. We perform k operations of the following type: choose uniformly at random two indices l and r (l xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89r) and reverse the order of the elements pl, xe2 x80 x89pl xe2 x80 x89+ xe2 x80 x891, xe2 x80 x89..., xe2 x80 x89pr. Your task is to find the expected value of the number of inversions in the resulting permutation. The first line of input contains two integers n and k (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89100, 1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89k xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89109). The next line contains n integers p1, xe2 x80 x89p2, xe2 x80 x89..., xe2 x80 x89pn -- the given permutation. All pi are different and in range from 1 to n. The problem consists of three subproblems. The subproblems have different constraints on the input. You will get some score for the correct submission of the subproblem. The description of the subproblems follows. Output the answer with absolute or relative error no more than 1e xe2 x80 x89- xe2 x80 x899. Consider the first sample test. We will randomly pick an interval of the permutation (1, xe2 x80 x892, xe2 x80 x893) (which has no inversions) and reverse the order of its elements. With probability , the interval will consist of a single element and the permutation will not be altered. With probability we will inverse the first two elements' order and obtain the permutation (2, xe2 x80 x891, xe2 x80 x893) which has one inversion. With the same probability we might pick the interval consisting of the last two elements which will lead to the permutation (1, xe2 x80 x893, xe2 x80 x892) with one inversion. Finally, with probability the randomly picked interval will contain all elements, leading to the permutation (3, xe2 x80 x892, xe2 x80 x891) with 3 inversions. Hence, the expected number of inversions is equal to ."... |
16260 |
No solutions yet.