【Codeforces 713B&714D】 Searching Rectangles【贪心】
来源:互联网 发布:收银软件开发 编辑:程序博客网 时间:2024/06/06 00:30
题意:
n*n的平面上有两个矩形,让你找出矩形的位置,每次你可以输出(x1,y1,x2,y2),然后oj会返回0,1或2,表示这个坐标范围内有几个矩形
题解:
每次直接二分每个矩形顶点的坐标,处理一些小细节就好,时间复杂度O(nlogn)
#include<set>#include<map>#include<cmath>#include<stack>#include<queue>#include<bitset>#include<vector>#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>using namespace std;#define PB push_back#define MP make_pair#define ll __int64#define MS(a,b) memset(a,b,sizeof(a))#define LL (rt<<1)#define RR (rt<<1|1)#define lson l,mid,LL#define rson mid+1,r,RR#define pii pair<int,int>#define pll pair<ll,ll>#define lb(x) (x&(-x))void In(){freopen("in.in","r",stdin);}void Out(){freopen("out.out","w",stdout);}const int N=1e5+10;const int M=1e6+10;const int Mbit=1e6+10;const int inf=0x3f3f3f3f;const ll mod=1e9+7;int n,x;int main(){ scanf("%d",&n); int l=1,r=n,y2=0; while(l<=r){//y2 int mid=(l+r)>>1; printf("? %d %d %d %d\n",1,1,n,mid); fflush(stdout); scanf("%d",&x); if(x)r=mid-1,y2=mid; else l=mid+1; } l=1,r=n;int x2=0; while(l<=r){//x2 int mid=(l+r)>>1; printf("? %d %d %d %d\n",1,1,mid,y2); fflush(stdout); scanf("%d",&x); if(x)r=mid-1,x2=mid; else l=mid+1; } l=1,r=x2;int x1=0; while(l<=r){//x1 int mid=(l+r)>>1; printf("? %d %d %d %d\n",mid,1,x2,y2); fflush(stdout); scanf("%d",&x); if(x)l=mid+1,x1=mid; else r=mid-1; } l=1,r=y2;int y1=0; while(l<=r){//y1 int mid=(l+r)>>1; printf("? %d %d %d %d\n",x1,mid,x2,y2); fflush(stdout); scanf("%d",&x); if(x)l=mid+1,y1=mid; else r=mid-1; } l=1;r=n;int x4=0; while(l<=r){//x4 int mid=(l+r)>>1; printf("? %d %d %d %d\n",1,1,mid,n); fflush(stdout); scanf("%d",&x); if((x1>=1&&x1<=mid)&&(x2>=1&&x2<=mid)&&(y1>=1&&y1<=n)&&(y2>=1&&y2<=n))x--; if(x)r=mid-1,x4=mid; else l=mid+1; } l=1;r=x4;int x3=0; while(l<=r){//x3 int mid=(l+r)>>1; printf("? %d %d %d %d\n",mid,1,x4,n); fflush(stdout); scanf("%d",&x); if((x1>=mid&&x1<=x4)&&(x2>=mid&&x2<=x4)&&(y1>=1&&y1<=n)&&(y2>=1&&y2<=n))x--; if(x)l=mid+1,x3=mid; else r=mid-1; } l=1;r=n;int y4; while(l<=r){ int mid=(l+r)>>1; printf("? %d %d %d %d\n",x3,1,x4,mid); fflush(stdout); scanf("%d",&x); if((x1>=x3&&x1<=x4)&&(x2>=x3&&x2<=x4)&&(y1>=1&&y1<=mid)&&(y2>=1&&y2<=mid))x--; if(x)r=mid-1,y4=mid; else l=mid+1; } l=1;r=y4;int y3; while(l<=r){ int mid=(l+r)>>1; printf("? %d %d %d %d\n",x3,mid,x4,y4); fflush(stdout); scanf("%d",&x); if((x1>=x3&&x1<=x4)&&(x2>=x3&&x2<=x4)&&(y1>=mid&&y1<=y4)&&(y2>=mid&&y2<=y4))x--; if(x)l=mid+1,y3=mid; else r=mid-1; } printf("! %d %d %d %d %d %d %d %d\n",x1,y1,x2,y2,x3,y3,x4,y4); return 0;}
0 0
- 【Codeforces 713B&714D】 Searching Rectangles【贪心】
- CodeForces 714D Searching Rectangles
- CF371 D Searching Rectangles
- Codeforces Round #371 (Div. 2)D. Searching Rectangles交互题
- Codeforces Round #371 (Div. 1)B Searching Rectangles
- Codeforces Round #371 (Div. 2) D. Searching Rectangles 平面矩形二分法、交互题
- Codeforces 844 B Rectangles
- Codeforces 844B Rectangles
- Codeforces 333D Characteristics of Rectangles
- CodeForces 764D Timofey and rectangles【四色问题】
- Codeforces Problem 333D. Characteristics of Rectangles
- CodeForces 372B. Counting Rectangles is Fun
- Codeforces 763B-Timofey and rectangles
- 【贪心】Codeforces 704B & 705D Ant Man
- 【Codeforces Round395】 Codeforces 764D Timofey and rectangles
- CodeForces 545D贪心
- codeforces 276D 贪心
- CodeForces-748D 贪心
- KVO的基本使用
- linux关闭启动防火墙
- 使用MVC模型的用户登录及注册(注销部分)
- Fresco简单使用
- Jersey客户端API调用REST风格的Web服务
- 【Codeforces 713B&714D】 Searching Rectangles【贪心】
- turtlebot入门仿真
- NOI2014购票
- Docker Engine还有比这更棒的东西了吗?
- Java基础:String类
- SpringMVC页面向Controller提交数组+Mybatis传多个参数+MySQL一次写入多条记录
- 背包问题之一(回溯法)
- Android 中的Handler机制
- ScrollView嵌套GridView以及添加分割线