THRSUM - ZERO TRIPLET
The general elections are coming and so rahul and modi have started the preparations.An astrologer predicted that whoever solves the given problem first will win the elections.
The problem is as follows: Given an array
nums of n integers, are there elements a, b, c in
nums such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.
As I want modi to win,so you have to solve this problem for modi before rahul does...Good Luck
In the first line ,you will be given t the number of test cases ,for each test case you will be given n, the size of the array.In the next line you will be given n space separated elements of the array.
Input constraints :t<=10000, n<=10000 (sum of n over all test cases won't exceed 10^8)
Output the number of such triplets and subsequently print each of the triplets in a separate line in lexicographic order.
-1 0 1 2 -1
0 0 0
-1 -1 2
-1 0 1
0 0 0
@Sushovan, ah, right! Thank you. :)
1s is the time limit to solve a single file. There may be multiple input files, your 2.75s is run time of all the files which need not be less than a second.
Can anyone clarify what the 1s in time limit mean? I thought the solution should produce output for all test-cases within the set 1s limit. But my solution ran for 2.75s, yet got accepted. How come?
Slight correction - the triplets should be printed in sorted order, not lexicographically (as character sorting). Good problem
Nice problem!! Well done bro @be1035016 ;)
Finally AC, Oh gosh, pheww!
Input is badly formatted, line-based reading crashes a Python solution. Psetter, please check if there are no linebreaks between numbers of the same array. Other than that, well designed problem in that rejecting sub-optimal solutions still allows PyPy to get AC.Last edit: 2018-05-24 07:34:32
Can't think of a better sol than O(n^2*logn)...
@vipul just to avoid sub-optimal solutions