Search found 1 match

Go to advanced search

by ranger72
Fri Oct 21, 2005 10:03 pm
Forum: Volume 101 (10100-10199)
Topic: 10150 - Doublets
Replies: 46
Views: 45913

10150: Doublets -- TLE?

I have implemented this one as a BFS which tries changing each letter of each word to any of the other letters, then uses binary search to check whether it is in the word array.

However, I always get TLE with ~10 seconds. How could I optimize this further?

My code is below:

#include <iostream ...

Go to advanced search