Can Any one help me with my solution for GARGOYLE problem My Solution Accepted Solutions essentially , I did the same thing that others have done , i.e. counting number of truths of true speaking people and equating it to their frequency , still getting wa. Any help will be appreciated . asked 11 Jan, 07:02

What I did was this: maintain an array pos, where $pos[i] = 1$ if for every $j$ where $arr[i][j] = 'T'$ then $arr[j][i]$ should be 'T' as well. then in for every person, we check that if $j$ that he is declaring true must be possible, in other words, must not contradict himself. And count maximum truth speaking people this way. Code for Reference: Link Time Complexity: $O(n^2)$ answered 11 Jan, 15:12
