lbv & brianfry713, Thanks a lot.
Got AC.
Search found 20 matches
- Thu Feb 21, 2013 9:04 pm
- Forum: Volume 4 (400-499)
- Topic: 459 - Graph Connectivity
- Replies: 132
- Views: 25191
- Thu Feb 21, 2013 8:59 pm
- Forum: Volume 2 (200-299)
- Topic: 280 - Vertex
- Replies: 95
- Views: 22261
Re: 280 - Vertex
My program prints the correct result for sample inputs posted here, but still WA :( Can anyone help me please? Thanks. #include <cstdio> #include <cstring> #include <vector> using namespace std; int N; vector< int > edges[105]; bool visited[105]; void dfs(int v){ int u, i; for(i=0; i<edges[v].size()...
- Wed Feb 20, 2013 9:04 pm
- Forum: Volume 4 (400-499)
- Topic: 459 - Graph Connectivity
- Replies: 132
- Views: 25191
Re: 459 - WA
Hello.
Can anyone tell me what's wrong with my code?
Thanks.
Can anyone tell me what's wrong with my code?
Thanks.
Code: Select all
Code was deleted after getting AC.
- Thu Feb 14, 2013 10:35 am
- Forum: Volume 112 (11200-11299)
- Topic: 11284 - Shopping Trip
- Replies: 32
- Views: 13974
Re: 11284 - Shopping Trip
@felix_halim Thanks for your reply, I didn't take into account situations that he could buy sth, come back home and go for another shop!!!:) Now I handle these cases correctly but still no luck! Sorry to bother you but would you please give me another test case for which my program fails??? Thanks i...
- Wed Feb 13, 2013 11:12 am
- Forum: Volume 112 (11200-11299)
- Topic: 11284 - Shopping Trip
- Replies: 32
- Views: 13974
Re: 11284 - Shopping Trip
I used Floyd then ran tsp on this problem. I didn't use floats and only worked with integer numbers but still no luck in getting AC. :( My program outputs the correct answer for sample inputs in the forum and question. Can anyone give me some input that on which it fails or some hints on the glitch ...