UVa OJ Board

I highly doubt it's the bford. I've tried to code the SSSP part using roy-floyd, bford and now dijkstra as you've suggested (just to be on the safe side). The verdict is still WA. The new code: #include <cstdio> #include <cstring> #include <string> #include <iostream> #include <queue> #include <vect...

Can anyone help me figure out why do I get WA?? It works on every test I try. Can anyone take a look at my output formatting? Maybe there's a mistake there I can't see... Thank you in advance! #include <cstdio> #include <vector> #include <bitset> #include <algorithm> #include <cstring> #define NMAX ...

Could anyone take a look at my source code or give me some more tests? I'm passing all the test cases on those 4 pages in the forum, but I still manage to get WA. I've checked for everything I could think of (multiple edges between nodes, self loops, 0 cost edges etc). Thank you! #include <cstdio> #...

I have followed the advice in this thread, but I would still get PE. However, if I don't put a "\n" after the last testcase, I receive WA. I suspect it's supposed to be PE again. Can someone take a look at my code and tell me if there's anything strange? Thanks in advance! #include <cstdio> #include...

It makes so much more sense now (for some reason I didn't pay attention to the ^ 3 and the example test cases weren't revealing). I got accepted changing the cost of the edge accordingly.
@brianfry: Thank you!

Could anyone clarify how can a negative cycle exist in this problem? I find the statement quite confusing. Assuming we have a negative cycle with nodes x1 -> x2 -> ... xk -> x1, the sum of all edges on the cycles is val[x2] - val[x1] + val[x3] - val[x2] + ... val[xk] - val[x(k-1)] + val[x1] - val[xk...

I got accepted with a bipartite check algorithm, but I'm still rather unsure about the correctness of the algorithm. Logically, in order to prove that a solution exists iff the graph is bipartite, one would have to show that: I) if the graph is bipartite, we can indeed construct a solution II) if th...

#include <cstring> #include <algorithm> #include <iostream> #include <string> #include <cstdio> using namespace std; int t, n; string A; bool cmp(char x, char y) { if (tolower(x) == tolower(y)) return isupper(x); return tolower(x) < tolower(y); } int main() { //freopen("input", "r", stdin); cin >> ...

#include <cstdio> #include <iostream> #include <string> #define NMAX 255 using namespace std; char rev[NMAX]; int n; string A, B; void prep() { rev['E'] = '3'; rev['J'] = 'L'; rev['L'] = 'J'; rev['S'] = '2'; rev['Z'] = '5'; rev['2'] = 'S'; rev['3'] = 'E'; rev['5'] = 'Z'; } int main() { //freopen("i...

Sorry about that. I have left it unintentionally. I usually comment it before submitting ; so this is not the issue

#include <cstdio> #include <cstring> #include <vector> #include <algorithm> #include <iostream> #include <map> #include <string> #define mp make_pair #define LMAX 85 #define NMAX 1005 using namespace std; int n, p, r, no, res_no; char A[NMAX][LMAX]; char name[LMAX], word[LMAX], res_name[LMAX]; doub...