Search found 3 matches

by dumle
Tue Sep 17, 2013 11:18 pm
Forum: Volume 4 (400-499)
Topic: 459 - Graph Connectivity
Replies: 132
Views: 24112

Re: 459 - Graph Connectivity - WA

Ok, so my second for-loop was flawed since it only checked vectors right beside eachother.
Fixed it with a nested for-loop so it passed the test above, still WA tho :/

Code: Select all

ac
by dumle
Tue Sep 17, 2013 10:04 pm
Forum: Volume 4 (400-499)
Topic: 459 - Graph Connectivity
Replies: 132
Views: 24112

Re: 459 - Graph Connectivity - WA

Pretty much: cin largest node letter, convert to int and insert into a vector repeat until empty line: { getline and split the string into int a, int b loop thru all vectors and check if a or b is in any vector if: insert the missing one into the vector if not: create a new vector with a and b (or o...
by dumle
Mon Sep 16, 2013 9:33 pm
Forum: Volume 4 (400-499)
Topic: 459 - Graph Connectivity
Replies: 132
Views: 24112

459 - Graph Connectivity - WA

Why am I getting WA? Ive tried several inputs and cant find anything wrong.

Code: Select all

removed after ac

Go to advanced search