제출 #848441

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
848441		MinhQNgo	XORanges (eJOI19_xoranges)	Pypy 3	12 / 100	1037 ms	39084 KiB

xoranges

n, q = map(int, input().split())
a = [int(x) for x in input().split()]

for _ in range(q):
    act_type, x, y = map(int, input().split())

    if act_type == 1:
        a[x - 1] = y
    else:
        res = 0
        x -= 1
        y -= 1
        for d in range(1, y - x + 2):
            total_xor_of_seq_len_d = 0
            for i in range(x, y - d + 2):
                total_xor_of_seq = 0
                for j in range(i, i + d):
                    total_xor_of_seq ^= a[j]
                total_xor_of_seq_len_d ^= total_xor_of_seq
            res ^= total_xor_of_seq_len_d
        print(res)

• Subtask 1: 12 / 12
• Subtask 2: 0 / 18
• Subtask 3: 0 / 25
• Subtask 4: 0 / 20
• Subtask 5: 0 / 25