Hi everyone.
My code for problem Little Elephant and LCM has got WA on test 9. My algorithm is a bit different from the editorial.
Can you help me?
Thx all :)
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | nor | 157 |
4 | atcoder_official | 156 |
4 | cry | 156 |
6 | -is-this-fft- | 155 |
7 | maroonrk | 154 |
8 | adamant | 153 |
9 | Um_nik | 151 |
10 | djm03178 | 146 |
Hi everyone.
My code for problem Little Elephant and LCM has got WA on test 9. My algorithm is a bit different from the editorial.
Can you help me?
Thx all :)
Hi.
Can you say when is the next contest?
Wish to be a.s.a.p.
thx :)
Hi all :)
For this problem, I used ternary search to find the best point on the west for each point on the east. The best point a[j] for a specific point b[i], is the point which makes the shortest path between the villages and goes from b[i]. Then, the minimum among these numbers, is the answer. Using ternary search is appropriate because the distance between the villages using the specific point b[i] and the points on the left, make an unimodal function.
But, My code for probelem "Building Bridge" has got RE.
I couldn't understand where the problem is. This is my code. Can anyone help me?
Hi all.
I tried to solve problem #304 of acm.sgu.ru using dp. But my code got runtime error on test 9. I found what the mistake was, but I could not fix it.
Can anyone help me? I have explained completely in the code what the problem is.
This is my code : CODE
thanks :)
Hi everyone
I got WA on test 5 for problem #151.
This is my code.
Can anyone help me?
UPD: after month I tried to code this problem again, but again WA on test 5 ! :( This is my new code. Can you help me? Thx in advance :).
Name |
---|