OJ Board

I use Mergesort to solve this problem,but WA~
Can someone tell me where is wrong?thanks

I use dynamic programming to solve this problem But got many WA~ My algorithm is below: 1.For every point on the plane, first calculate the distance from it to the origin. If this distance < d,ignore this point,if not so, store this point. 2.Sort these points by their angle(from 0 to 2*PI). 3.For ev...

Here is my code. I calculate the sample output correctly,but got WA
many times.
Can anyone point out what is wrong in my code??

I got several WA on this problem :evil: But I think I take every cases to account,please help me! [cpp]#include <stdio.h> #include <string.h> #include <stdlib.h> #include <vector> using namespace std; const int maxn=33500; vector<int> temp; bool prime[maxn]; int A,B,N,p[maxn]; int find(int sign,int ...

I think my method is right: First ,calculate the convex hull of the two
point sets. Then check if they intersect. And I take every special case
,such as one or two points into account. But still get WA!

Can anyone tell me where the trick is or give me some data to debug?
Thank you!

Thanks for your reply
I got AC now:)
I made a mistake in my code

I got WA on this problem.
I think the method is maximum flow.
Can you tell me what is the trick in this problem?

I want to find some material about Bin packing.
Can anyone introduce some website about it?
Thank you!

Can someone give me a code of this problem?
Thanks! I've tried every possible way to fix
my mistake but still get WA!!

I've got TLE,RE and WA 10+ times,but haven't got AC!
Can anyone give me some hint or test data so I can find what is wrong
int my program? Thank you!
I try to extend the array to store the points but still got wa!
What is the special judge data of this problem?

Show my deepest sympathy to the victim and injured person in
this terrorism.
I'm sad to hear that!

I've got several RE on this problem, can anyone give me
some hints ?
Thank you!

I got several WA.But I can't find any mistake in my algorithm.
Is there some trick in the problem?
Can anyone give me some testdata please?

I got several WA on this problem. I use BFS to solve it. I don't know why. Please help me, thanks. [cpp]void solve() {int u,v,k; queue.clear(); queue.push_back(s); memset(visited,0,sizeof(visited)); visited[s]=1; memset(dist,0,sizeof(dist)); while (!queue.empty()) {u=queue.front(); queue.pop_front()...

I think about this problem for a long time. But I can't find good method to solve it. I'm afraid to get time limit excceed if I check every possible square. Can someone introduce how to solve it? Thank you!