Hello Guys ,
Today I was solving this problem : https://www.codechef.com/IARCSJUD/problems/GREATESC
This is an easy graph problem and I solved the problem and even after initializing the size of array and adjacency matrix more than the number of nodes and all I was getting Segmentation Fault ONLY on the last two testcases
And then after changing the number to more than 10^8 I am still getting segmentation fault on those two test cases only
Should i solve it without graphs ( it is a graph problem tho ) or are the testcases weak ?
Someone pls look into this
Thanks a lot !
Sudheera Y S