I use Mergesort to solve this problem,but WA~
Can someone tell me where is wrong?thanks
Search found 19 matches
- Thu Feb 17, 2005 11:50 am
- Forum: Volume 108 (10800-10899)
- Topic: 10810 - Ultra-QuickSort
- Replies: 36
- Views: 21670
- Sat Aug 28, 2004 3:06 pm
- Forum: Volume 106 (10600-10699)
- Topic: 10691 - Subway
- Replies: 0
- Views: 1420
10691 - Subway
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...
- Thu Aug 05, 2004 5:49 pm
- Forum: Volume 106 (10600-10699)
- Topic: 10693 - Traffic Volume
- Replies: 12
- Views: 6589
- Wed May 05, 2004 7:58 am
- Forum: Volume 106 (10600-10699)
- Topic: 10650 - Determinate Prime
- Replies: 67
- Views: 26414
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 ...
- Fri Apr 16, 2004 7:14 am
- Forum: Volume 102 (10200-10299)
- Topic: 10256 - The Great Divide
- Replies: 21
- Views: 7921
10256-The great divide,WA

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!
- Wed Apr 14, 2004 2:48 pm
- Forum: Volume 8 (800-899)
- Topic: 820 - Internet Bandwidth
- Replies: 43
- Views: 21933
- Sun Apr 11, 2004 1:21 pm
- Forum: Volume 8 (800-899)
- Topic: 820 - Internet Bandwidth
- Replies: 43
- Views: 21933
820 - Internet Bandwidth
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 think the method is maximum flow.
Can you tell me what is the trick in this problem?
- Thu Apr 01, 2004 3:10 pm
- Forum: Algorithms
- Topic: Bin packing
- Replies: 0
- Views: 922
Bin packing
I want to find some material about Bin packing.
Can anyone introduce some website about it?
Thank you!
Can anyone introduce some website about it?
Thank you!
- Thu Mar 25, 2004 10:16 am
- Forum: Volume 6 (600-699)
- Topic: 681 - Convex Hull Finding
- Replies: 60
- Views: 22183
- Mon Mar 22, 2004 3:31 am
- Forum: Volume 6 (600-699)
- Topic: 681 - Convex Hull Finding
- Replies: 60
- Views: 22183
681

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?

- Fri Mar 12, 2004 4:56 pm
- Forum: Off topic (General chit-chat)
- Topic: Terrorism
- Replies: 6
- Views: 3873
- Wed Mar 10, 2004 3:13 am
- Forum: Volume 2 (200-299)
- Topic: 270 - Lining Up
- Replies: 48
- Views: 17566
- Tue Dec 23, 2003 9:58 am
- Forum: Volume 105 (10500-10599)
- Topic: 10581 - Partitioning for fun and profit
- Replies: 15
- Views: 8781
10581 - Partitioning for fun and profit
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?
Is there some trick in the problem?
Can anyone give me some testdata please?
- Thu Dec 18, 2003 3:00 am
- Forum: Volume 100 (10000-10099)
- Topic: 10000 - Longest Paths
- Replies: 160
- Views: 39550
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()...
- Thu Sep 11, 2003 11:12 am
- Forum: Volume 105 (10500-10599)
- Topic: 10504 - Hidden squares
- Replies: 14
- Views: 6535
10504-Can anyone give me some hint?
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!