In the first problem of this round the number of operations is the number of bags and you have to include all the indices of the bags. The order of the indices doesn't matter because every bag gets added with the number of candies of the unaffected bag, in the end filling every bag with equally n(n+1)/2 candies. This is what I understand. There is no need to minimize m operations either, so can anyone tell me why this submission is wrong?
→ Pay attention
→ Top rated
| # | 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 | Um_nik | 3396 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Um_nik | 164 |
| 2 | maomao90 | 160 |
| 3 | -is-this-fft- | 159 |
| 4 | atcoder_official | 158 |
| 4 | cry | 158 |
| 4 | awoo | 158 |
| 7 | adamant | 155 |
| 8 | nor | 154 |
| 9 | maroonrk | 151 |
| 9 | Dominater069 | 151 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Sep/28/2024 02:18:26 (h1).
Desktop version, switch to mobile version.
Supported by
The order of the indices does matter.
In the j-th operation, you will pick one bag and add j candies to all bags apart from the chosen one. What matters is the index of the operation, not the number of candies in the specified bag.Why are you writing a blog post on something that can easily be solved by rereading the question?