```
Topic id is a sequence <number>.<number>. ... <number>. All numbers are integers from a segment [1, 20] and have no leading zeroes. All topic id’s are unique.
```
try test:
1. graphs
1022
1065
2. geometry
1020
2.1. idea
1130
2.2. technique
1111 1065
1265
2.2.1. convex hull
1271
3. dynamic programming
1244
20. vector

the sides of the square may not be parallel to the sides of the field

you put the first parenthesis (in the wrong place

try to remove all the crutches that you wrote in your code, which are very convenient, but at the same time only slow down your code

do not be smart in the code, do not add many characters at once, try to think step by step

use sort instead of map or unordered_map, its around 10 times faster

i got WA because i don't realize that

from the upper left to the bottom right
there is no guarantee that they are connected.

Sorry, the test is not small. Now I will give a description of the test. There 5 groups with sizes: (6 1) (5 1) (4 1) (4 1) (4 1). The right answer for this test is 14:14. But the greedy program gives 15:13. I think moderators shall add this test to the test data and many solutions will be rejected.

28
21 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 0
26 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 0
26 2 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 0
26 2 3 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 0
26 2 3 4 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 0
26 2 3 4 5 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 0
26 2 3 4 5 6 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 0
22 1 2 3 4 5 6 7 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 0
26 1 2 3 4 5 6 7 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 0
26 1 2 3 4 5 6 7 9 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 0
26 1 2 3 4 5 6 7 9 10 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 0
26 1 2 3 4 5 6 7 9 10 11 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 0
26 1 2 3 4 5 6 7 9 10 11 12 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 0
23 1 2 3 4 5 6 7 8 9 10 11 12 13 19 20 21 22 23 24 25 26 27 28 0
26 1 2 3 4 5 6 7 8 9 10 11 12 13 16 17 18 19 20 21 22 23 24 25 26 27 28 0
26 1 2 3 4 5 6 7 8 9 10 11 12 13 15 17 18 19 20 21 22 23 24 25 26 27 28 0
26 1 2 3 4 5 6 7 8 9 10 11 12 13 15 16 18 19 20 21 22 23 24 25 26 27 28 0
26 1 2 3 4 5 6 7 8 9 10 11 12 13 15 16 17 19 20 21 22 23 24 25 26 27 28 0
23 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 24 25 26 27 28 0
26 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 21 22 23 24 25 26 27 28 0
26 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 20 22 23 24 25 26 27 28 0
26 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 20 21 23 24 25 26 27 28 0
26 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 20 21 22 24 25 26 27 28 0
23 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 0
26 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 26 27 28 0
26 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 25 27 28 0
26 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 25 26 28 0
26 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 25 26 27 0

1. Centipede waking up from wrong side of bed doesn't matter in this problem. Since the centipede gets the slippers randomly, the problem is asking about the worst case which results in the most time taken.

2. If the centipede finishes all the left slippers, i.e. 40 of them , there are still a-40 left slippers present under the bed. The problem doesn't even mention that after wearing 40 left slippers, these a-40 left slippers will also be thrown taking 2 seconds. Throwing is only mentioned for right slippers.

Edited by author 22.08.2023 07:39

Edited by author 22.08.2023 07:42

15 2
1 3
5 2

15 2
4 1
5 1

65 2
42 12
54 69


I think you have problems in formulas, I advise you to carefully read the articles with the theory

Edited by author 21.08.2023 22:05

Edited by author 21.08.2023 22:05

Use BINARY SEARCH, AFTER THIS TEST I GOT AC I'M SO GLAD, I'M JUST IN SHOCK. I hope all my tests will help you, I find this task very useful for number theory

if you have two progressions, one of which is with a very large step, then you can walk from the beginning of one progression to the beginning of the other

if you have two progressions, one of which is with a very large step, then you can walk from the beginning of one progression to the beginning of the other

dont use int128

This codes gives correct output in my system but submitting it shows Restricted Function.
Plz help...
**************************************
import Queue
graph={}
dic={}
to_explore=Queue.Queue()
def BFS(root):
    dic[root]=0
    to_explore.put(root)
    while not to_explore.empty():
        tmp=to_explore.get()
        for i in graph[tmp]:
            if i not in dic:
                dic[i]=dic[tmp]+1
                to_explore.put(i)
n=input()
while n:
    s=raw_input().split()
    for i in s:
        if i not in graph:
            graph[i]=[]
            for j in s:
                if j!=i:
                    if j not in graph[i]:
                        graph[i].append(j)
        else:
            for j in s:
                if j!=i:
                    if j not in graph[i]:
                        graph[i].append(j)
    n-=1
if 'Isenbaev' in graph:
    BFS('Isenbaev')
    for i in graph:
        if i not in dic:
            dic[i]='undefined'
    for i in sorted(dic):
        print i,dic[i]
else:
    for i in sorted(graph):
        print i,"undefined"

The graph is not oriented graph. It makes solution easier.

Edited by author 19.08.2023 12:29

Can be velocity lager than c?

Try to think in terms of mathematics, trying to make accurate judgments

O(n) solution exists