제출 #850020

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
850020		MinhQNgo	XORanges (eJOI19_xoranges)	Pypy 3	55 / 100	1056 ms	39140 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:
        d = y - x + 1
        total_xor_of_seq_len_d = 0
        for i in range(1, d + 1):
            cnt_in_seqs = i * (d - i + 1)
            if cnt_in_seqs % 2 == 0:
                continue
            else:
                total_xor_of_seq_len_d ^= a[i + (x - 2)]
        print(total_xor_of_seq_len_d)

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