OJ Board

Any hints to solve this problem?

Hi, I got Time Limit Exceeded for this problem. I used dp with memoization. How to optimize this code?
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int dp[45][32010];
int N,F;
int a[45];
char path[45];
bool AccBook(int idx,int sum){
if(idx==N){
if(sum==F) return ...

Your third expression is wrong.
Take these two expressions.
-1+2-3+4+5 =7
+1+2+3-4+5 =7
You can clearly see that only second and last transactions are same in both expressions. Remaining are ambiguous to tell whether that is income or expense.

Hi, I got time limit exceeded for this problem. Please tell me how to improve solution. I used dp subset sum.
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int _min,_max;
int dp[110][110][5500];
int N,M,a[110];
int mi,totalsum;
void ExpAgain(int idx,int num,int sum ...

Hi, Can anybody tell me How to proceed to solve this problem? It looks like matching with some constraints. Please give me some hints?

It worked for RE Error. But Now I am getting Time LImit Exceeded. How to improve this solution.

@Brianfry713 : I added return 0; to the program Still It shows RE. Could you please tell me any other mistakes. I think it is out of bounds error. But I couldn't find it. Please Give me some test cases.

Hi, Can anyone tell me why my code shows RE for this problem.

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define INF 2000000000
int T1,T2,n;
int m[25];int C[50][50][2];
int memo[50][310][310];
int trace[50][310][310];
int TesttheRods(int idx,int rem1,int rem2){
if ...

Hi, Can anyone tell me how to improve my solution for this problem.
I used DP top-down But It gives me TLE. Any suggestions please?

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long int ll;
ll memo[75][75][75];
ll n,s;
ll LockDrawer(ll lst,ll id,ll nlck ...

Why Runtime Error for this code? I can't figure out.
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
#define MAX 10010
struct block{
int l;
int m;
};
block a[MAX];
int val[MAX];
bool compare(const block& lhs, const block& rhs){
return lhs.l<=rhs.l;
}
int lis(int n ...

I solved it using tarjan's algorithm for finding articulation points, jakecho1's post is very helpful.

@satirmo, your code fails on this test case Your code gives 3 but the answer is -1 . I think floodfill algorithm is more suitable for this type of implicit graphs. Although bfs will work fine.

@uradura, In set of connected components, if one component is not bipartite, your program does not give the answer of other bipartite components result
For Example take this input Your code gives 0,but the AC answer is 1

Hi, what is wrong with my solution for this problem, WA at 0.516.
#include<cstdio>
#include<vector>
#include<cstring>
using namespace std;
vector<int> A[110];
bool Visited[110];
bool Reachable[110];
bool Dominator[110][110];
void dfs(int u){
Visited[u]=true;
Reachable[u]=true;
for(int j=0;j<(int)A ...

Here is my code. It shows WA at 0.046. I can't figure out what is what is wrong here. Please help me.