[HackerRank] Dynamic Array

Problem

Code

#!/bin/python3

import math
import os
import random
import re
import sys

#
# Complete the 'dynamicArray' function below.
#
# The function is expected to return an INTEGER_ARRAY.
# The function accepts following parameters:
#  1. INTEGER n
#  2. 2D_INTEGER_ARRAY queries
#

def dynamicArray(n, queries):
    # Write your code here
    '''
    문제에 주어진 2가지 방법에 맞춰서 구현
    '''
    lastAnswer = 0
    arr = [[] for _ in range(n)]
    answer = []
    for query in queries:
        ch, x, y = query
        idx = (0 if x == lastAnswer else 1) % n
        if ch == 1:
            arr[idx].append(y)
        elif ch == 2:
            lastAnswer = arr[idx][y % (len(arr[idx]))]
            answer.append(lastAnswer)
    return answer
        
if __name__ == '__main__':
    fptr = open(os.environ['OUTPUT_PATH'], 'w')

    first_multiple_input = input().rstrip().split()

    n = int(first_multiple_input[0])

    q = int(first_multiple_input[1])

    queries = []

    for _ in range(q):
        queries.append(list(map(int, input().rstrip().split())))

    result = dynamicArray(n, queries)

    fptr.write('\n'.join(map(str, result)))
    fptr.write('\n')

    fptr.close()

Reference

Bitwise XOR Operation
HackerRank - Dynamic Array