oj.uz

Submission #22636

# Submission time Handle Problem Language Result Execution time Memory
22636 2017-04-30T06:03:13 Z 이대회 트래쉬 대회에야옹(#967, dofwk1526, HUIDONG, mincl) Window Xor (KRIII5_WX) Python 3
0 / 7
 1000 ms 52 KB 
N, K, T = map(lambda x: int(x), input().split(' '))

X = list(map(lambda x: int(x), input().split(' ')))

repeat = []

def trans(X, K, N):
    X2 = [0] * N
    for i in range(0, N):
        x = 0
        for j in range(0, K):
            x = x ^ X[(i+j)%N]
        X2[i]=x
    return X2

def s(X):
    return list(map(lambda x: str(x), X))

repeat.append(s(X))
for i in range(1, T+1):
    X = trans(X, K, N)
    v = s(X)
    if v in repeat:
        st = repeat.index(v)
        # repeat st~i
        size = i - st
        ss = ""
        for r in repeat[(T-st)%size]:
            ss = ss + r + " "
        print(ss)
        break
    repeat.append(v)
    #print(X, i+1)
#print(repeat)

Subtask #1
0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 3 KB Output is correct
2 Correct 25 ms 3 KB Output is correct
3 Incorrect 34 ms 3 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1045 ms 52 KB Time limit exceeded
2 Halted 0 ms 0 KB -