OJ Board

@brianfry713...thank you.

@ brianfry713 ....for the test case
A 74
B 55
C 51 A
D 33
E 48 B C D
F 34 B C
Your answer is 159, but...
Critical path for A = A(74) = 74
Critical path for B = B(55) = 55
Critical path for C = A(74) + C(51) = 125
Critical path for D = D(33) = 33
Critical path for E = max(B(55),C(125)) + E(48 ...

Getting WA...plzz help

Thanks brianfry.

Getting WA...getting correct answer for all test cases given in this thread...

Thank you brianfry.

@brianfry...Why is it that I when I run only case 98, i get correct output and when i run all 100 cases together, i get a different incorrect answer for the same case. I have initialized dp array before every test case. Any help?
PS: Same with some more test cases too...

Getting WA...plzz help...

Everyone is getting submission error on this problem for the last 22 days.
929 - Number Maze

Getting WA...plzz anyone help...
Getting correct output for all of Larry's testcases...

@deadangelx....your test cases are incorrect.

Each successive word differs from the previous word in only a single character position while the word length remains the same.

You are changing the word length.

@brianfry713...i got AC using brute force as u said.

brianfry713 wrote:Try running dfs N times, once with each node turned off.

But whys is the above algorithm not working...any help with that?

Getting WA....plzz help

#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<string>
#include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<deque>
#include<queue>
#include<map>
#include<sstream>
using namespace std;

typedef long long int L ...

@brianfry713...thanks a lot for pointing out...

Getting RE....my code is working for the test cases in this discussion thread...plzz help