I used accumulate for calculating the sum of elements of the array(which got hacked) however simply calculating the sum via iteration gives the correct result.↵
↵
Am i missing something or is there any problem with using this "accumulate" thing.↵
↵
Accepted — (https://mirror.codeforces.com/contest/1985/submission/265437274)↵
,(https://mirror.codeforces.com/contest/1985/submission/265439252)↵
↵
Hacked — (https://mirror.codeforces.com/contest/1985/submission/265303752)↵
↵
update — this idea of using all the attacks at once (at 1st second) requires to calculate the sum of the array ,but this sum can overflow (long long is insufficient). Better idea is to use the ceil division in the check function like this :↵
↵
tot += ((have + cool[i] — 1)/cool[i]) * attack[i];↵
Hacker of the above solution helped me figure this out. Thanks a lot [user:sammyuri,2024-06-12] sir.
↵
Am i missing something or is there any problem with using this "accumulate" thing.↵
↵
Accepted — (https://mirror.codeforces.com/contest/1985/submission/265437274)↵
,(https://mirror.codeforces.com/contest/1985/submission/265439252)↵
↵
Hacked — (https://mirror.codeforces.com/contest/1985/submission/265303752)↵
↵
update — this idea of using all the attacks at once (at 1st second) requires to calculate the sum of the array ,but this sum can overflow (long long is insufficient). Better idea is to use the ceil division in the check function like this :↵
↵
tot += ((have + cool[i] — 1)/cool[i]) * attack[i];↵
Hacker of the above solution helped me figure this out. Thanks a lot [user:sammyuri,2024-06-12] sir.
