Sir, what does the lines after main() " ios_base::sync_with_stdio(false);

cin.tie(NULL); " mean

/* package codechef; // don't place package name! */
 
import java.util.*;
import java.lang.*;
import java.io.*;

i am not able to pass 3 test cases, can someone explain me which test case is not valid for my solution ?

#include<bits/stdc++.h>

/* package codechef; // don't place package name! */
 
import java.util.*;
import java.lang.*;
import java.io.*;

package java102;

public class simplecalc {

public static void main(String[] args) {

t = int(input())
a,b=0,0
prevp1,prevp2 = 0,0
while(t>0):
    l = list(map(int,input().split()))

java solution without dp just for loop

import java.util.*;

import java.lang.*;

import java.io.*;

I did the exact same thing, but unfortunately the test cases are so weak that it passes. However this solution is O(n^3) and will never pass the extreme value of 2500.

On second thought, this code passes the test cases on codechef because they are weak. I came up with this solution when I was afraid of DP. This code will not pass if there are 2500 bamboo shoots.

what about this test case

10 10 80

/* This code gives me 100 score. You have to check whether the bookings are less than or equal to total seats. If it is less then everybody sits and count of people standing will be zero. */

#include <bits/stdc++.h>

this is my simple code in java

public class SeatingProblem {
public static void main(String[] args){


Scanner in = new Scanner(System.in);
...

Actually BIT supports max/min queries and continuous sum( a[i] ~ a[i+L] ==> +x) queries.

We can implement by using 2 BIT.

Oops, should have reread my reply before posting, thanks for the correction.

'Almost every solution you can do with Segment Tree can also be done with Binary Index Trees.' Its true the other way round because BIT only supports sum queries

/* package codechef; // don't place package name! */
 
import java.util.*;
import java.lang.*;
import java.io.*;

Below is my code for this problem using python.

from collections import Counter
n1,n2,n3=map(int,input().split())
VList=[]

My code complexity O(nlogn).