OJ Board

Whats the complexity of accepted code?
my code is O(n^2) which for the life of me i cant find anything faster and yet i get TLE... any suggestions?

#include<iostream>
#include<string>
using namespace std;
bool pallenword(const string& t) {
if(t.length() <= 4)
return false;
string otherp ...

I think it may be the problem after the calling to sites.erase(). After the call, it will invalidate all iterators that refer to the following elements. So, the call should be changed as follows:

iter = sites.erase(iter) - 1;

Shouldnt be a problem since the next statement breaks from that loop ...

You should use the <algorithm> library, as in
sort(seq,seq+slen,ch_cmp);
....
while(next_permutation(seq,seq+slen,ch_cmp))

next_permutation will permute all elements between the 2 pointers (arg0,arg1) either by operator< or by arg2 (if provided) and will return 0 when there is no lexicorgraphicly ...

Have looked at every post I could find here and tried all of the test cases and for each one someone has claimed that thier ACC code gets the same answer as mine yet, still WA when submitted, anyone have any test cases mine gets wrong that the judge could use? sugestions on how to fix my code ...

Any ideas why my attempt at 149 is so far off? (returns 88 for given test case)

Everyone loves a good precision error right?

works by breaking all points (-20, .. 21) into 4 quadrents then sorting by distance and checking each point for occlusion by all points in same quadrant with smaller ...