Search found 6 matches

by Peter3109
Sun Apr 09, 2006 9:05 pm
Forum: Volume 110 (11000-11099)
Topic: 11015 - 05-2 Rendezvous
Replies: 48
Views: 17473

11015 - 05-2 Rendezvous

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
by Peter3109
Wed Apr 05, 2006 8:45 pm
Forum: Volume 7 (700-799)
Topic: 786 - Working with Relations
Replies: 2
Views: 2419

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

Thanks!

Peter
by Peter3109
Wed Apr 05, 2006 2:45 pm
Forum: Volume 7 (700-799)
Topic: 786 - Working with Relations
Replies: 2
Views: 2419

786 - Working with Relations

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
by Peter3109
Sun Jan 15, 2006 9:20 am
Forum: C++
Topic: #include <string>
Replies: 4
Views: 2026

Thanks!
by Peter3109
Sun Jan 15, 2006 8:12 am
Forum: C++
Topic: #include <string>
Replies: 4
Views: 2026

#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] < 'a' || inword[...
by Peter3109
Sat Jan 14, 2006 9:40 am
Forum: C++
Topic: #include <string>
Replies: 4
Views: 2026

#include <string>

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

Thx.

Peter

Go to advanced search