Is not it can be called CSP-S simulates
Day1
The topic of people: liu_runda
I'm dying.
NOI More?
NEW Professional?
Not Ordinary and Interesting Programmers?
×× It's a bit ridiculous ah.
Pre-question:
T1
Precision question?
T2
Is the title sequence, only think of violence
T3
Probability problems, may be dp
Dage also like cats on campus it ......
Saying, why do not ham?
(Cat really eat snack noodle?)
Finally, what's the relationship of China and Western public?
Do questions:
T1
Precision magic
I really ......
I've thought about, but did not write.
Is removed divided by $ gcd $
complexity is $ \ Theta (\ log Nk) $ a.
$ 100 <k <$ 500
is probably the way 1e5.
$ \ log 10 ^ {100} = 100 \ log 10 $
T2
Both Red and Expert series
to violence.
We may be calculated separately for each number of legal sections,
then Intersection.
The data range is obviously $ \ Theta (N) $ of
$ \ Theta (N \ log N ) $ is also regarded as a good way
T3
Like a backpack.
Gyz disposed in the k cat of the total fragrance burst packet i with the crisp snack noodle, j package fresh curd Aberdeen maximum expected: $ dp_ {k, i, j} $
first k can roll up.
Then the probability of the probability of capture is 1- can not be captured in each cat at.
$$dp_{k,i,j}+=dp_{k-1,i+a,j+b}+1-\prod(1-qi) \times \prod(1-pi)$$
You can do some small points (the amazing complexity of $ \ Theta (N ^ 5) $).
But you can write a quick power ($ N ^ 4logN $)
4 1 3 0.100 0.500 0.500 0.600 0.100 0.500 0.900 0.400 3 2 2 1.000 0.000 0.500 0.000 1.000 0.500 3 2 0 0.412 0.198 0.599 0.612 0.987 0.443
But if the right could not pass the sample (not state)
Sample 1 idea:
I do not give first cat
Then to a second packet fresh cat Aberdeen +0.5
Then give a cat a third package fresh Aberdeen +0.9
Finally, only the fourth to the rest of + 1-0.6 × 0.4 = 0.76
Finally, I have a cat 2.16
My idea of violence program:
I do not give first cat
Then two packets to the second stiffness cat Aberdeen + 1-0.5 × 0.5 = 0.75
Then give a cat a third package fresh Aberdeen +0.9
Finally, the rest of the fourth only to +0.6
Finally, I have a 2.25 Cat (hey, I'm more than 0.09 cats
I am confused, I feel I did not examine the wrong question ah QAQ
So will ...... cat like a pack of two packets of Jin Jin Tsai and Tsai seems to be the same ......
I ×, I actually change overnight
Day2
The topic of people: ρ
Saying I really do not know who this is ......
It seems hard to look
In the words of a "---------- 1/4" is the question people say 1/4, or is this one of four sets of questions?
Sleepy (did not wake up)
Pre-question:
T1
This ...... feeling persimmon.
1s
T2
This open ×× ×× O2 have used?
2s
T3
It is a math problem sitting lotus?
0.5s, I × ¥ # ¥% ×% ×% ......
Three Issues reading, feel good authors determined (● ﹏ ●)
Each topic has a lot of feeling part of the points, but could not think of a positive solution.
Do question the process:
T1
Hit table $ \ Theta (N * M) $
Feeling like a binomial.
$$\begin{array}{rcl}f_{i,j}&=&a \times f_{i-1,j}+b \times f_{i,j-1} \\ f_{i,j}&=&a^2*f_{i-2,j}+2ab \times f_{i-1,j-1}+b^2 \times f_{i,j-2}\end{array}$$
So we now need to factor.
If there is $ \ Theta (N) coefficient of about $ solving
Then it can be $ \ Theta (N + M) $ resolved.
If Pascal's Triangle might as violence.
Factorial and inverse!
The complexity of $ \ Theta (N \ log Mod) $
solved!
Two examples are over
Crazy to beat, AAA (<Remember these words)
T2
Like a dp
We can put values into the ownership of X points.
And then pressed in the X-shaped point.
The problem here is not out of the array a $ 1 \ ll 100000 \ times 100000 $ of
(funny
20%
Or, maybe we can think about greedy? ?
With a heap optimize it, let it go back?
First put down
T3
This ×× is to say it? ?
However, ρ is very good, he believes This question is absolutely no randomized, do not hit the table, no pruning, no high-precision, without modulo.
This question is not so it is a metaphysics.
Wait, do not seem to have been ...... but still very metaphysics
Result - result
|
5
|
Miemeng | 100
03:11:32
|
30
03:11:05
|
10
03:18:42
|
140
03:18:42
|
|
43
|
Miemeng | 60
03:17:43
|
0
03:18:59
|
0
03:26:01
|
60
03:26:01
|
| Total: | 200 | ||||
Ruin.
I would like to work harder ......
The reason was actually:
I did not factorial Qiugou ......