OJ Board

@Bella Swan

The output you posted is wrong, correct output is:

@kabir_iut
I used 60 x 60 x 60 x 2 Dp state and 6 recursive calls (Without Exclusion)
and my running time is .744sec

Why i am getting TLE? Any one please help me :( #include<iostream> #include<cstdio> #include<cstring> #include<cctype> #include<cstdlib> #include<cmath> #include<sstream> #include<fstream> #include<vector> #include<string> #include<stack> #include<queue> #include<set> #include<map> #include<list> #i...

I would like to clear a point about this problem. There will be only one S and one T for every test and you need to find out minimum time required to go form S to T. Input 4 7 ##....T ##.###. S..###. ##..... 4 7 ##..... ##.###. S..###. ##....T 0 0 Output Case #1 minimum time = 14 sec Case #2 minimum...

@Angeh: I think Dp will reduce your time limit surely

I think a straight Dijkstra will solve this problem with a faster time.

I just coded Kruskal's Algorithm and got Accepted in very good time .

Every one getting WA please take a look at this line:- I got wA for this.

I think BFS should solve this.
But I am very much confused with the problem description.
Any one please help me

I think this is an easy problem.
Easy recursive formula works here.
I just searched for the next match until last one.

I got compile error for this problem... code.o: In function `DFS(int)': code.cpp:(.text+0x47): relocation truncated to fit: R_X86_64_32S against symbol `visit' defined in .bss section in code.o code.cpp:(.text+0x50): relocation truncated to fit: R_X86_64_32S against symbol `visit' defined in .bss se...

You are using "long double" as data type.
But you are printing :- I think this should be changed to:-

And i think this won't be enough to solve this problem

Some one please help me to get accepted. (I am getting wa constantly!!! :( ) here is my code:- #include<iostream> #include<sstream> #include<vector> #include<cstring> #include<string> using namespace std; int c[503][503]; int lcs(vector<string>x,vector<string>y){ int i,j,max=0; for(i=0;i<x.size();i+...

n will be an integer between 1 and 12 (inclusive), and x1, ....., xn will be positive integers less than 100. So i think there is no such case as:- 999 1 999 I think it should be:- 999 1 99 Some one please help me to get Accepted. I can't find that stupid mistake. #include<iostream> #include<vector...

i got accepted taking 10$ as maximum.