Search found 8 matches

by draconian devil
Thu Aug 08, 2013 2:06 pm
Forum: Volume 11 (1100-1199)
Topic: 1112 - Mice and Maze
Replies: 13
Views: 7364

Re: 1112 - Mice and Maze

Getting WA on this problem. Used Dijkstra. I computed the cost from Source to all other nodes then I checked if the computed cost is greater than given cost. so Why wrong answer? I know this can be done by floyd warshall easily but what's the problem with Dijkstra? Here is my code #include <iostream...
by draconian devil
Thu Jul 18, 2013 10:22 am
Forum: Volume 12 (1200-1299)
Topic: 1235 - Anti Brute Force Lock
Replies: 3
Views: 2184

1235 - Anti Brute Force Lock

Getting Wrong Answer on this problem. Used Kruskal MST. At first i computed distance from every combination to other then applied MST suppose 0000 1111 2222 computed distance from 0000 1111, 0000 2222, 1111 2222 then MST. so why WA? help please #include <iostream> #include <cstring> #include <vector...
by draconian devil
Sat Jul 13, 2013 11:12 am
Forum: Volume 12 (1200-1299)
Topic: 1208 - Oreon
Replies: 2
Views: 1740

1208 - Oreon

Getting Wrong Answer on UVA 1208 Oreon. Its a straight forward MST problem i think. dont know why i got WA #include <iostream> #include <vector> #include <cstring> #include <algorithm> #define N 55000 using namespace std; int P[N]; class info { public: int p,c,guard; }; bool compare(info i1, info i2...
by draconian devil
Tue Jul 09, 2013 7:07 pm
Forum: Volume 119 (11900-11999)
Topic: 11966 - Galactic Bonding
Replies: 3
Views: 2057

Re: 11966 - Galactic Bonding Runtime

getting Wrong Answer on this Problem. Used Disjoint Set. I cant find the problem #include <iostream> #include <cstring> #include <cmath> #include <vector> #define N 1500 using namespace std; int constellation[N]; int findconst(int star) { if(constellation[star] == star) return star; return constella...
by draconian devil
Sat Jun 01, 2013 10:07 am
Forum: Volume 115 (11500-11599)
Topic: 11504 - Dominos
Replies: 55
Views: 20173

Re: 11504 - Dominos

Why Im getting WA? passed all cases above. used SCC. #include <iostream> #include <stack> #include <vector> #include <cstring> #define n 100005 using namespace std; vector <int> G[n]; vector <int> GT[n]; stack <int> s; bool visited [n]; int hit[n]; vector <int> region[n]; int regionCount,hitCount; v...
by draconian devil
Fri Mar 29, 2013 10:21 am
Forum: Volume 5 (500-599)
Topic: 540 - Team Queue
Replies: 37
Views: 15949

Re: 540- Team Queue, RTE

thanks shiam vai.
by draconian devil
Fri Mar 29, 2013 8:21 am
Forum: Volume 5 (500-599)
Topic: 540 - Team Queue
Replies: 37
Views: 15949

Re: 540- Team Queue, RTE

brianfry713, the code passes all test cases in here
by draconian devil
Thu Mar 28, 2013 10:55 pm
Forum: Volume 5 (500-599)
Topic: 540 - Team Queue
Replies: 37
Views: 15949

Re: 540- Team Queue, RTE

Getting Wrong Answer on this. Can anyone provide any test case.

Code: Select all

ACCEPTED

Go to advanced search