OJ Board

With and without printing the additional blank line afer the last test case I still get WA :/

Guys, any idea why I could possibly be getting WA? I make a standard DFS backtracking for topological sorting. Tested on so many cases and I get all correct outputs. still WA though. #include <iostream> #include <string> #include <sstream> #include <vector> #include <cstring> #include <algorithm> us...

OK, I make a standard implementation of finding the articulation points with a DFS. Got correct output on the sample test cases and other I made up myseld but I still get WA. Any ideas? #include <iostream> #include <vector> #include <cstring> #include <string> #include <algorithm> #include <queue> #...

Any ideas why I'm getting WA? I'm using Floyd-Warshall's All pairs shortest paths algorithm in addition to making backtracking on the local optimal parameters #include <iostream> #include <cstring> #include <iomanip> #include <vector> #include <utility> using namespace std; typedef pair<char, char> ...

I think I wrote a correct code which solves the problem but I get TLE. Can someone explain more clearly the idea about compressing the hours into intervals? And when we compress them how are we going to extract the information in which hours every monkey is drinking?

brianfry713, you're awesome, dude. Thanks a lot . Got AC

I made some changes to my code (I updated my previous post with the code) and my program produces a correct output for your test case but I still get WA. This starts getting so annoying

Thank you, brianfry713!. I changed my code and got AC It appears that I had sorted the strings in their raw unformatted state rather than with first char uppercase and the rest lowercase .

brianfry713 wrote:If the last test case is Impossible, don't print a blank line after it.

OK, I edited my code and fixed that but I still get WA

Hi, fellas. I used Edmond-Karp's Max flow algorithm for solving the problem and hashing with open addressing for storing the strings of the clubs and parties. I solve the sample test caces correctly but I get WA on the judge. Any ideas what could be wrong?
GOT AC AND CODE REMOVED

Could I get help for my code? I keep getting WA when everything appears to be correct
GOT AC AND CODE REMOVED

Yeah, got AC after I returned the flow in the augment function.

So I got the following code which is implementation of Edmond-Karp's Max flow algorithm. The thing I cannot understand is why my augmenting function returns a randomly huge number as pushed flow when it should be always 1. For example just before returning the minEdge, I print what is the value and ...

Hi. So I constructed a graph with the standard vertex splitting technique and super source/sink. Then I made an implementation of Edmond-Karp's algorithm with O(V^3*E) I guess since I'm using a matrix for the residual graph. The problem is I keep getting TLEs and don't really know how to make the co...

So I kept getting WA when my Floyd-Warshall algorithm appeared to be correct. One of the posts pointed out that there are self loops which were the problem. I memset-ed my whole matrix to infinity and the diagonal (i, i) to 0 but since there are self loops it replaced the 0 with not the optimal valu...