CSES - Datatähti 2018 peili - Results
Submission details
Task:Fraktaali
Sender:regnessem
Submission time:2017-10-06 18:02:37 +0300
Language:Python3
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED10
#2ACCEPTED10
#3ACCEPTED10
#4ACCEPTED10
#5ACCEPTED10
#6ACCEPTED10
#7ACCEPTED10
#8ACCEPTED10
#9ACCEPTED10
#10ACCEPTED10
Test results
testverdicttimegroup
#1ACCEPTED0.07 s1details
#2ACCEPTED0.08 s2details
#3ACCEPTED0.09 s3details
#4ACCEPTED0.07 s4details
#5ACCEPTED0.08 s5details
#6ACCEPTED0.07 s6details
#7ACCEPTED0.06 s7details
#8ACCEPTED0.10 s8details
#9ACCEPTED0.14 s9details
#10ACCEPTED0.39 s10details

Code

from itertools import product

# Deklaratiivinen rekursiivinen paradigma
def invert(f):
    f_c= {}
    for k, v in f.items():
        f_c[k]= not v
    return f_c

def G(n, g):
    n, f= 2** (n- 1), {}
    for i, j in product(range(2), range(2)):
        for k, v in g[i, j].items():
            f[i* n+ k[0], j* n+ k[1]]= v
    return f

def F(k):
    if k> 1:
        f= F(k- 1)
        return G(k- 1, {(0, 0): f, (0, 1): f, (1, 0): f, (1, 1): invert(f)})
    return {(0, 0): 1}

def p(k, g):
    o, s= {0: '.', 1: '#'}, ''
    for i in range(2** (k- 1)):
        for j in range(2** (k- 1)): s+= o[g[i, j]]
        s+= '\n'
    return s

# Objekti-orientoitunut iteratiivinen paradigma
# mikä välttämättä ole riittävän tehokas
#def _add_c(g, n):
#    n = 2** (n- 1)
#    for k, v in g.copy().items(): g[k[0], n+ k[1]]= v
#
#def _add_r(g, n):
#    n = 2** (n- 1)
#    for k, v in g.copy().items(): g[n+ k[0], k[1]]= v
#
#def _add_rc_inv(g, n):
#    n = 2** (n- 1)
#    for k, v in g.copy().items(): g[n+ k[0], n+ k[1]]= not v

def _add_c(g, n, keys):
    for k in keys: g[k[0], n+ k[1]]= g[k]

def _add_r(g, n, keys):
    for k in keys: g[n+ k[0], k[1]]= g[k]

def _add_rc_inv(g, n, keys):
    for k in keys: g[n+ k[0], n+ k[1]]= not g[k]


class Fraktaali():
    def __init__(self):
        self._g, self._max_n= {(0, 0): 1}, True

    def __call__(self, n):
        self._n= n
        for k in range(self._max_n, n):
            self._create(k)
        self._max_n= n
        return self

    def __repr__(self):
        return p(self._n, self._g)

    def _create(self, n):
        n, keys=  2** (n- 1), list(self._g.keys())
        _add_r(self._g, n, keys)
        _add_c(self._g, n, keys)
        _add_rc_inv(self._g, n, keys)
    
if __name__ == "__main__":
    n= int(input())
#    n= 4
#    print(p(n, F(n)))
#    print('---')
    print(Fraktaali()(n))

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
1

correct output
#

user output
#

Test 2

Group: 2

Verdict: ACCEPTED

input
2

correct output
##
#.

user output
##
#.

Test 3

Group: 3

Verdict: ACCEPTED

input
3

correct output
####
#.#.
##..
#..#

user output
####
#.#.
##..
#..#

Test 4

Group: 4

Verdict: ACCEPTED

input
4

correct output
########
#.#.#.#.
##..##..
#..##..#
####....
...

user output
########
#.#.#.#.
##..##..
#..##..#
####....
...

Test 5

Group: 5

Verdict: ACCEPTED

input
5

correct output
################
#.#.#.#.#.#.#.#.
##..##..##..##..
#..##..##..##..#
####....####....
...

user output
################
#.#.#.#.#.#.#.#.
##..##..##..##..
#..##..##..##..#
####....####....
...

Test 6

Group: 6

Verdict: ACCEPTED

input
6

correct output
##############################...

user output
##############################...

Test 7

Group: 7

Verdict: ACCEPTED

input
7

correct output
##############################...

user output
##############################...

Test 8

Group: 8

Verdict: ACCEPTED

input
8

correct output
##############################...

user output
##############################...

Test 9

Group: 9

Verdict: ACCEPTED

input
9

correct output
##############################...

user output
##############################...

Test 10

Group: 10

Verdict: ACCEPTED

input
10

correct output
##############################...

user output
##############################...