OJ Board

For the test data there is only one house that is directly connected to the rest (house 1). Does this mean that house 1 is the only possible meeting place or can people travel to other houses indirectly by using a series of connected houses?

Thanks!

Peter

ok so I have optimized away some unneccesary processing and got WA. Anyone have any I/O?

Thanks!

Peter

I've got an O(n^3) algo that seems to run all of the test input I can come up with very quickly. I'm just wondering if anyone has any input that might cause my TLE or any advice on how much I need to optimize this thing.

Thanks!

Peter

Thanks!

#include <iostream>
#include <set>
#include <string>
using namespace std;

set<string> words;
string word;
string inword;

void add() {
int j = 0;

word.clear();
for(int i = 0; i < inword.size(); i++) {
if(inword[i] >= 'A' && inword[i] <= 'Z')
inword[i] += 'a' - 'A';
}

while(inword[j ...

I seem to get compile error whenever I include <string>. I am sure that I have used it before, has something changed?

Thx.

Peter