Submission #60990988

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=2e5+10;
int n,m,i,j,b[N<<2],k,c,sx[N],sy[N],tx[N],ty[N],x,y,ans,ma[N],px,py;
struct Node{
	int x,y;
}a[N];
bool cmp(Node o,Node p){return o.y<p.y||(o.y==p.y&&o.x<p.x);}
vector<Node> Gx[N<<2],Gy[N<<2];
vector<int> mx[N<<2],my[N<<2];
char op[2];
bool check1(int x,int y)
{
	int i,l,r,mid;
	if (Gx[x].size()==0) return false;
	l=0;
	r=(int)Gx[x].size()-1;
	while (l<=r)
	{
		mid=l+r>>1;
		if (Gx[x][mid].y>=x) r=mid-1;
		else l=mid+1; 
	}
	return mx[x][l]<=y;
}
bool check2(int x,int y)
{
	int i,l,r,mid;
	if (Gy[x].size()==0) return false;
	l=0;
	r=(int)Gy[x].size()-1;
	while (l<=r)
	{
		mid=l+r>>1;
		if (Gy[x][mid].y>=x) r=mid-1;
		else l=mid+1; 
	}
	return my[x][l]<=y;
}
signed main()
{
	scanf("%lld%lld%lld%lld",&n,&m,&x,&y);
	for (i=1;i<=n;i++) scanf("%lld%lld",&a[i].x,&a[i].y),b[++k]=a[i].x,b[++k]=a[i].y;
	for (i=1;i<=m;i++)
	{
		sx[i]=x;
		sy[i]=y;
		b[++k]=x;
		b[++k]=y;
		scanf("%s%lld",op,&c);
		if (op[0]=='U') y+=c;
		else if (op[0]=='D') y-=c;
		else if (op[0]=='L') x-=c;
		else x+=c;
		tx[i]=x;
		ty[i]=y;
		px=x;
		py=y;
		b[++k]=x;
		b[++k]=y;
	}
	sort(b+1,b+k+1);
	k=unique(b+1,b+k+1)-b-1;
	for (i=1;i<=n;i++) 
	{
		a[i].x=lower_bound(b+1,b+k+1,a[i].x)-b;
		a[i].y=lower_bound(b+1,b+k+1,a[i].y)-b;
	}
	for (i=1;i<=m;i++)
	{
		sx[i]=lower_bound(b+1,b+k+1,sx[i])-b;
		sy[i]=lower_bound(b+1,b+k+1,sy[i])-b;
		tx[i]=lower_bound(b+1,b+k+1,tx[i])-b;
		ty[i]=lower_bound(b+1,b+k+1,ty[i])-b;
		if (sx[i]==tx[i]) Gx[sx[i]].push_back({min(sy[i],ty[i]),max(sy[i],ty[i])});
		else Gy[sy[i]].push_back({min(sx[i],tx[i]),max(sx[i],tx[i])}); 
	}
	for (i=1;i<=n*2+m*2;i++) 
	{
		sort(Gx[i].begin(),Gx[i].end(),cmp);
		sort(Gy[i].begin(),Gy[i].end(),cmp);
		if (Gx[i].size()>0)
		{
			ma[(int)Gx[i].size()-1]=Gx[i][(int)Gx[i].size()-1].x; 
			for (j=(int)Gx[i].size()-2;j>=0;j--) ma[j]=max(Gx[i][j].x,ma[j+1]);
			for (j=0;j<=(int)Gx[i].size()-1;j++) mx[i].push_back(ma[j]);
		}
		if (Gy[i].size()>0)
		{
			ma[(int)Gy[i].size()-1]=Gy[i][(int)Gy[i].size()-1].x;
			for (j=(int)Gy[i].size()-2;j>=0;j--) ma[j]=max(Gy[i][j].x,ma[j+1]);
			for (j=0;j<=(int)Gy[i].size()-1;j++) my[i].push_back(ma[j]);
		}
	}
	for (i=1;i<=n;i++)
	{
		if (check1(a[i].x,a[i].y)||check2(a[i].y,a[i].x)) ans++;
	}
	printf("%lld %lld %lld",px,py,ans);
	return 0;
}

Submission Info

Compile Error

./Main.cpp:21:8: warning: operator '>>' has lower precedence than '+'; '+' will be evaluated first [-Wshift-op-parentheses]
                mid=l+r>>1;
                    ~^~~~
./Main.cpp:21:8: note: place parentheses around the '+' expression to silence this warning
                mid=l+r>>1;
                     ^
                    (  )
./Main.cpp:15:6: warning: unused variable 'i' [-Wunused-variable]
        int i,l,r,mid;
            ^
./Main.cpp:35:8: warning: operator '>>' has lower precedence than '+'; '+' will be evaluated first [-Wshift-op-parentheses]
                mid=l+r>>1;
                    ~^~~~
./Main.cpp:35:8: note: place parentheses around the '+' expression to silence this warning
                mid=l+r>>1;
                     ^
                    (  )
./Main.cpp:29:6: warning: unused variable 'i' [-Wunused-variable]
        int i,l,r,mid;
            ^
4 warnings generated.

Judge Result