https://codeforces.net/contest/4/submission/174376175
My code:Check if sumtime is in $$$[minsum,maxsum]$$$,minsum is the sum of all the $$$mintime$$$ and maxsum is the sum of all the $$$maxtime$$$.Then greedy for the solution.
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Dec/23/2024 03:11:02 (i1).
Desktop version, switch to mobile version.
Supported by
Not sure if greedy is applicable here, though I solved it with knapsack-like dp. Could you elaborate on your solution?
you are so close my guy. I took your code and only changed one thing. This is my submission: https://codeforces.net/contest/4/submission/178599913
can you spot what i noticed?
your first if condition in the while loop
`
when you update sumtime
you set sumtime to suntime — (maxtime[j] + mintime[j]) — why do you do this? The correct thing to do is to set sumtime to sumtime — (maxtime[j] — mintime[j]) — this is because at the start you have already taken away mintime[j] from sumtime, therefore, using maxtime[j] hours on the jth day means that you only have to takeaway (maxtime[j]-mintime[j]) more hours from sumtime.
hope this helps