Comments
0

note that array b is strictly increasing
0

might as well ask them to solve the problem outright lol :))
0

it seems i cannot have my solutions judged unless i signed up for their courses, right?
0

During the contest, i had (and still have as of now) difficulties reaching the contest URL. I have to use 1.1.1.1 in order to access the site. Does anyone else face these issues?
0

strangely enough, 128 can also be formed by concatenating '1', '2', and '8', so there will be duplication during backtracking. My solution runs under 100ms still

0

Auto comment: topic has been updated by wife_nicenature (previous revision, new revision, compare).
0

Auto comment: topic has been updated by wife_nicenature (previous revision, new revision, compare).
0

https://codeforces.me/blog/entry/new/272924?locale=en : 8be51d5a3ff2a8b5 : saving a blog post draft (edited: resolved)
0

If you don't understand anything just read the offical solution :))) It's much faster, simpler and more elegant.

With the given conditions, every bridge in the graph does not belong to the cycle, and thus every non-bridge belongs to the cycle. After we traverse on the graph we will find the full set of vertices that belong to the cycle. Start traversing from Valeriu's positon until you reach one that is in the cycle (possibly Valeriu's original position itself) and calculate the distance between the vertices. As the tutorial above indicates, this is Valeriu's entry to the cycle. We then calculate the distance between that entry vertice and Marcel's. The answer is No if the former distance is not smaller that the latter, or both Valeriu and Marcel share the same starting position.

For an implementation of the bridge-finding algorithm, see https://cp-algorithms.com/graph/bridge-searching.html#implementation.
0

In hindsight my bridge-finding algorithm seems like an overkill :) 224589798