【CodeForces555A】Case of Matryoshkas 题解

最新推荐文章于 2020-03-08 11:09:19 发布

原创

最新推荐文章于 2020-03-08 11:09:19 发布 · 550 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#codeforces

这篇博客介绍了CodeForces555A题目Case of Matryoshkas，涉及如何在最短时间内将展品中的套娃重新组装成一条长链。内容包括输入输出格式、示例测试用例以及解决方案，指出这是一个可以通过暴力求解的问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Case of Matryoshkas

Andrewid the Android is a galaxy-famous detective. He is now investigating the case of vandalism at the exhibition of contemporary art.

The main exhibit is a construction of n matryoshka dolls that can be nested one into another. The matryoshka dolls are numbered from 1 to n. A matryoshka with a smaller number can be nested in a matryoshka with a higher number, two matryoshkas can not be directly nested in the same doll, but there may be chain nestings, for example, 1 → 2 → 4 → 5.

In one second, you can perform one of the two following operations:

Having a matryoshka a that isn’t nested in any other matryoshka and a matryoshka b, such that b doesn’t contain any other matryoshka and is not nested in any other matryoshka, you may put a in b;
Having a matryoshka a directly contained in matryoshka b, such that b is not nested in any other matryoshka, you may get a out of b.
According to the modern a