https://codeforces.com/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.
# | User | Rating |
---|---|---|
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 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | nor | 157 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | Petr | 145 |
9 | pajenegod | 145 |
https://codeforces.com/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.
Name |
---|
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.com/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