algorithms/quadtree.py at master · suewoon/algorithms · GitHub

1
2
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
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
#!/usr/bin/env python3
#  solution for  https://algospot.com/judge/problem/read/QUADTREE

import sys
input = sys.stdin.readline

class QuadTree(object):
    def __init__(self, string):
        self.quadtree = string

    def up_side_down(self):
        if len(self.quadtree) == 1:
            return self.quadtree
        else:

            def up_side_down_helper(quadtree):

                if quadtree[0] == 'b' or quadtree[0] =='w':
                    ans = quadtree[0]
                    quadtree = quadtree[1:]
                    return ans
                else:
                    quadtree = quadtree[1:]

                q1 = up_side_down_helper(quadtree)
                #print(quadtree[:])
                q2 = up_side_down_helper(quadtree[len(q1):])
                #print(quadtree[len(q1):])
                q3 = up_side_down_helper(quadtree[len(q1)+len(q2):])
                #print(quadtree[len(q1)+len(q2):])
                q4 = up_side_down_helper(quadtree[len(q1)+len(q2)+len(q3):])
                #print(quadtree[len(q1)+len(q2)+len(q3):])

                return 'x' + q3 + q4 + q1 + q2

            return up_side_down_helper(self.quadtree)


def main():
    testcases = int(input())
    for i in range(testcases):
        qt = QuadTree(input())
        print(qt.up_side_down())

if __name__ == '__main__':
    main()