Search found 19 matches

by sunhong
Thu Feb 17, 2005 11:50 am
Forum: Volume 108 (10800-10899)
Topic: 10810 - Ultra-QuickSort
Replies: 36
Views: 20442

I use Mergesort to solve this problem,but WA~
Can someone tell me where is wrong?thanks
by sunhong
Sat Aug 28, 2004 3:06 pm
Forum: Volume 106 (10600-10699)
Topic: 10691 - Subway
Replies: 0
Views: 1375

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...
by sunhong
Thu Aug 05, 2004 5:49 pm
Forum: Volume 106 (10600-10699)
Topic: 10693 - Traffic Volume
Replies: 12
Views: 6322

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??
by sunhong
Wed May 05, 2004 7:58 am
Forum: Volume 106 (10600-10699)
Topic: 10650 - Determinate Prime
Replies: 67
Views: 24234

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 ...
by sunhong
Fri Apr 16, 2004 7:14 am
Forum: Volume 102 (10200-10299)
Topic: 10256 - The Great Divide
Replies: 21
Views: 7175

10256-The great divide,WA

:cry:
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!
by sunhong
Wed Apr 14, 2004 2:48 pm
Forum: Volume 8 (800-899)
Topic: 820 - Internet Bandwidth
Replies: 43
Views: 20464

Thanks for your reply
I got AC now:)
I made a mistake in my code :cry:
by sunhong
Sun Apr 11, 2004 1:21 pm
Forum: Volume 8 (800-899)
Topic: 820 - Internet Bandwidth
Replies: 43
Views: 20464

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?
by sunhong
Thu Apr 01, 2004 3:10 pm
Forum: Algorithms
Topic: Bin packing
Replies: 0
Views: 883

Bin packing

I want to find some material about Bin packing.
Can anyone introduce some website about it?
Thank you!
by sunhong
Thu Mar 25, 2004 10:16 am
Forum: Volume 6 (600-699)
Topic: 681 - Convex Hull Finding
Replies: 60
Views: 20209

Can someone give me a code of this problem?
Thanks! I've tried every possible way to fix
my mistake but still get WA!!
by sunhong
Mon Mar 22, 2004 3:31 am
Forum: Volume 6 (600-699)
Topic: 681 - Convex Hull Finding
Replies: 60
Views: 20209

681

:cry:
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? :evil:
by sunhong
Fri Mar 12, 2004 4:56 pm
Forum: Off topic (General chit-chat)
Topic: Terrorism
Replies: 6
Views: 3614

Show my deepest sympathy to the victim and injured person in
this terrorism.
I'm sad to hear that!
by sunhong
Wed Mar 10, 2004 3:13 am
Forum: Volume 2 (200-299)
Topic: 270 - Lining Up
Replies: 48
Views: 15922

:(
I've got several RE on this problem, can anyone give me
some hints ?
Thank you!
by sunhong
Tue Dec 23, 2003 9:58 am
Forum: Volume 105 (10500-10599)
Topic: 10581 - Partitioning for fun and profit
Replies: 15
Views: 8368

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?
by sunhong
Thu Dec 18, 2003 3:00 am
Forum: Volume 100 (10000-10099)
Topic: 10000 - Longest Paths
Replies: 160
Views: 35496

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()...
by sunhong
Thu Sep 11, 2003 11:12 am
Forum: Volume 105 (10500-10599)
Topic: 10504 - Hidden squares
Replies: 14
Views: 6176

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!

Go to advanced search