FilesExpand file tree

 master

/

Solution1.java

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

46 lines (40 loc) · 1.63 KB

 master

/

Solution1.java

Top

File metadata and controls

• Code
• Blame

46 lines (40 loc) · 1.63 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

import java.io.*;

import java.util.*;

import java.text.*;

import java.math.*;

import java.util.regex.*;

public class Solution1 {

public static void main(String[] args) {

/* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */

Scanner in = new Scanner(System.in);

// Create a list, seqList, of N empty sequences, where each sequence is indexed from 0

// to N -1. The elements within each of the sequences also use 0-indexing.

int N = in.nextInt();

N = (N > (10^5)) ? 10^5 - 1 : N;

int Q = in.nextInt(); // Number of Queries

Q = (Q > (10^5)) ? 10^5 - 1: Q;

List<List<Integer>> seqList = new ArrayList<List<Integer>>(N);

for (int i = 0; i < N; i++) {

seqList.add(new ArrayList<Integer>(N));

}

// Create an integer, lastAnswer, and initialize it to 0

int lastAnswer = 0;

for (int i = 0; i < Q; i++) {

int queryType = in.nextInt();

int x = in.nextInt();

x = (x > (10^9)) ? (10^9 -1) : x;

int y = in.nextInt();

y = (y > (10^9)) ? (10^9 -1) : y;

if(queryType == 1) {

int seqIndex = (x^lastAnswer)%N;

List<Integer> seqElement = seqList.get(seqIndex);

seqElement.add(new Integer(y));

} else if(queryType == 2) {

int seq = (x^lastAnswer)%N;

int element = y%(seqList.get(seq).size());

lastAnswer = seqList.get(seq).get(element);

System.out.println(lastAnswer);

}

}

}

}