Please be advised that most content below could be considered trivial and strange and they are written simply for passionate or for its beauty behind, in a strange aspect of viewing. I am more than happy if you also enjoy their beauty.
The problem Codeforces 1620E requires you to maintain an array supporting push_back or replacing all of specific value into another (may be replacing into itself). Your task is to print the resulting array.
To move lots of elements from one place to another, why not put them in a bucket then move the bucket into another, with bucket in bucket allowed? The idea here is similar that we collect the elements or buckets since last replacement of a certain value, and then we could just put the outside bucket into the bucket representing being replaced into, and just expanding all the buckets after all operations.
For implementation, it is just pointers and vectors to simulate moving and buckets, which you could see in the submission here.
By reading the first note, you will find this page just describes trivial things and makes completely no sense.Copyright (c) ksyx 2022, licensed under CC-BY-SA.
< Back to posts