trjhtr

For this problem - https://www.hackerearth.com/practice/data-structures/advanced-data-structures/segment-trees/practice-problems/algorithm/shivam-and-expensive-birthday-gift-da58b2f0/description/, I tried different ways to solve it, but just reading the input without even performing any opreations takes a lot of time. Even using my custom Reader class doesn't help much. Can someone please check if my logic is right?

public class Solutions 
 static class Reader
 
 final private int BUFFER_SIZE = 1 << 16;
 private DataInputStream din;
 private byte buffer;
 private int bufferPointer, bytesRead;

 public Reader()
 
 din = new DataInputStream(System.in);
 buffer = new byte[BUFFER_SIZE];
 bufferPointer = bytesRead = 0;
 

 public Reader(String file_name) throws IOException
 
 din = new DataInputStream(new FileInputStream(file_name));
 buffer = new byte[BUFFER_SIZE];
 bufferPointer = bytesRead = 0;
 

 public String readLine() throws IOException
 
 byte buf = new byte[64]; // line length
 int cnt = 0, c;
 while ((c = read()) != -1)
 
 if (c == 'n')
 break;
 buf[cnt++] = (byte) c;
 
 return new String(buf, 0, cnt);
 

 public int nextInt() throws IOException
 
 int ret = 0;
 byte c = read();
 while (c <= ' ')
 c = read();
 boolean neg = (c == '-');
 if (neg)
 c = read();
 do
 
 ret = ret * 10 + c - '0';
 while ((c = read()) >= '0' && c <= '9');

 if (neg)
 return -ret;
 return ret;
 

 private void fillBuffer() throws IOException
 
 bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
 if (bytesRead == -1)
 buffer[0] = -1;
 

 private byte read() throws IOException
 
 if (bufferPointer == bytesRead)
 fillBuffer();
 return buffer[bufferPointer++];
 

 public void close() throws IOException
 
 if (din == null)
 return;
 din.close();
 
 

 private static Reader scanner = new Reader();
 static int set1s;

 static void choice1 (int a, int x) 1;
 set1s[x]++;
 

 static void choice2 (int a, int x) 
 if ((a[x] & 1) == 1)
 set1s[x]--;
 a[x] >>= 1;
 

 static int choice3 (int a, int x, int y) 
 int result = 0;

 for (int i = x; i<=y; i++) 
 result += set1s[i];
 

 return result;
 

 public static void main(String args) throws Exception 
 int n = scanner.nextInt(), q = scanner.nextInt();
 int a = new int[n+1];
 set1s = new int[n+1];
 while (q-- > 0) 
 int choice = scanner.nextInt(), x = scanner.nextInt();
 switch (choice) 
 case 1:
 choice1(a, x);
 break;
 case 2:
 choice2 (a, x);
 break;
 case 3:
 int y = scanner.nextInt();
 System.out.println(choice3(a, x, y));
 
 
 

More than half of the test cases are failing due to TLE.