OJ Board

Hi,
I'm new to min cost flow problems and I'm getting WA. The approach I follow is this:
1. Find the augumenting path which has the shortest path (Dijkstra) . Then, I remove the used edge u-v. (However, the edge v-u remains).
2. Continue till I get the desired flow.
This works on all the test cases ...

This is one of the worst problems of this archive. What is it that they are trying to test, our problem solving ability, or our ability to parse the input?
Anyway, I keep getting WA after repeated submissions. Could anyone point out the mistake in the code, or provide me with sample I/O with which ...

Perhaps the last solution is a bit slow. But I see no reason why it shouldnt be correct. Anyway, here's the new solution. Please Please give me test cases where my program fails or point out the mistake in my code.
Here goes:

#include<iostream>
#include<cstdio>
#include<vector>
#include<string ...

Perhaps the last solution is a bit slow. But I see no reason why it shouldnt be correct. Anyway, here's the new solution. Please Please give me test cases where my program fails or point out the mistake in my code.

I am trying to solve problem 914. I am passing Jan's test cases, but still getting WA. Any more cases, or someting wrong with my code?
Here goes:

#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<list>
#include<queue>
#include<cctype ...

Hi,
I'm trying to solve 11072 and am getting WA.
My idea:
Compute the convex hull. Then, to check if the points lie inside the hull, check if the absolute value of the sum of areas formed by the triangle and 2 points of the hull is equal to the area of the convex hull. Is this correct? I think so ...

I have no clue as to why i get wa. Could anyone give me test cases for this problem?
Thanks

#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<list>
#include<queue>
#include<cctype>
#include<stack>
#include<map>
#include<set>
using ...

Also, I had tried assert(b>=1).
It gave RE.
It is completely unfair to have a test case which is contrary to problem statement.

Does anyone have any idea or test data as to why this gives WA??


#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<list>
#include<queue>
#include<cctype>
#include<stack>
#include<map>
#include<set>
#include<assert.h>
#define eps 1e ...

I have absolutely no idea why I'm getting WA.
Here's the code:

#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<list>
#include<queue>
#include<cctype>
#include<stack>
#include<map>
#include<set>
using namespace std;

int main ...

I got AC. Thanks very much for your help.

I have absolutely no idea why this gives WA. What is the point of solving problems when the problem statemant and sample I/O are contradictory?

When I used int, it gave WA. When I used long long, I got AC

I have absolutely no idea why this gives WA. It passes the test cases given above. Can anybody give me test cases with solutions?

Hi,
I have 2 doubts:
1. Can the guy visit a spot he has already visited?
2. When he walks without any treasures, he takes energy required in calories for a walk from a block to an adjacent one * distance. When carrying treasures, is this cost added?
3. If a guy passes through a point which contains ...