Search found 5 matches

by shibly
Mon Oct 03, 2011 6:42 pm
Forum: Volume 123 (12300-12399)
Topic: 12307 - Smallest Enclosing Rectangle
Replies: 4
Views: 2569

12307 - Smallest Enclosing Rectangle

I need some idea to solve this problem. I code the problem and got WA.

My logic is given below:

1.At first find the convex hull.
2.There is at least one edge of rectangle which will overlap with one edge of the convex hull.

Am I right ? If yes then I need some critical input output.

Thanks.
by shibly
Mon Jul 04, 2011 9:17 pm
Forum: Volume 4 (400-499)
Topic: 473 - Raucous Rockers
Replies: 16
Views: 7155

Re: 473 - Raucous Rockers

n<=800 , m<=100 and t<=100.
I got AC with this limits.
by shibly
Thu Apr 14, 2011 6:09 am
Forum: Bugs and suggestions
Topic: NO REPLAY FROM JUDGE FOR 11858 - Frosh Week
Replies: 4
Views: 2166

NO REPLAY FROM JUDGE FOR 11858 - Frosh Week

Yesterday I submitted the code of 11858 - Frosh Week. But still now I have not received any replay. After the problem I submitted another code which got AC.

Thanks.
by shibly
Thu Nov 04, 2010 6:07 am
Forum: Volume 118 (11800-11899)
Topic: 11857 - Driving Range
Replies: 21
Views: 7452

Re: 11857 - Driving Range

Hafiz in 67th line you used
if(u != v)
but it will be
if(x!=y)
by shibly
Wed Nov 03, 2010 3:22 pm
Forum: Volume 118 (11800-11899)
Topic: 11893 - Fabulous DAGy
Replies: 10
Views: 3207

11893 - Fabulous DAGy WHY WA??????

Why WA? Someone Please check my code or give me some input/output.... :oops: thanks all. #include<iostream> #include<string> #include<algorithm> #include<vector> using namespace std; vector<int>adj[400]; int col[400],dis[400],K=0,par[400]; int DFS(int u) { col[u]=1; for(int i=0;i<(int)adj[u].size();...

Go to advanced search