This is about 845B - Luba And The Ticket from educational round 27.
My code got AC for C++14 34715622 and TLE for C++11 34715609. Can anyone tell me why? Diagnostics also TLEs, so I couldn't use that to check for undefined behaviour.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | nor | 157 |
6 | maroonrk | 155 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
8 | orz | 146 |
10 | BledDest | 145 |
This is about 845B - Luba And The Ticket from educational round 27.
My code got AC for C++14 34715622 and TLE for C++11 34715609. Can anyone tell me why? Diagnostics also TLEs, so I couldn't use that to check for undefined behaviour.
I am stuck on this problem
Basically: p1 has N points, p2 has M points. They play N + M - 1 rounds. N, M ≤ 1000. The player who gets zero first loses.
p1 knows the probability of winning each round pi, the loser gets 1 point subtracted.
I can only think of dp in O((N+M)*N*M), but it gets TLE
int N, M;
cin >> N >> M;
vector<vector<double>> dp(N + 1, vector<double>(M + 1, 0.));
dp[N][M] = 1.;
for (int i = 0; i < N + M - 1; ++i) {
double p;
cin >> p;
for (int i = 0; i <= N; ++i) {
for (int j = 0; j <= M; ++j) {
if (i > 0 && j > 0) dp[i][j] = 0.;
if (j > 0 && i + 1 <= N) dp[i][j] += dp[i + 1][j] * (1. - p);
if (i > 0 && j + 1 <= M) dp[i][j] += dp[i][j + 1] * p;
}
}
}
double win = 0., lose = 0.;
for (int i = 1; i <= N; ++i) {
win += dp[i][0];
}
for (int j = 1; j <= M; ++j) {
lose += dp[0][j];
}
cout.precision(17);
cout << fixed << win / (win + lose) << "\n";
Any help is appreciated :)
Название |
---|