OJ Board

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.

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.

Hafiz in 67th line you used

if(u != v)

but it will be

if(x!=y)

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 ...