HDU 5480:Conturbatio 前缀和
来源:互联网 发布:无线通信算法 招聘 编辑:程序博客网 时间:2024/05/16 18:10
Conturbatio
Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 232 Accepted Submission(s): 108
Problem Description
There are many rook on a chessboard, a rook can attack the row and column it belongs, including its own place.
There are also many queries, each query gives a rectangle on the chess board, and asks whether every grid in the rectangle will be attacked by any rook?
There are also many queries, each query gives a rectangle on the chess board, and asks whether every grid in the rectangle will be attacked by any rook?
Input
The first line of the input is a integer T , meaning that there are T test cases.
Every test cases begin with four integersn,m,K,Q .
K is the number of Rook, Q is the number of queries.
ThenK lines follow, each contain two integers x,y describing the coordinate of Rook.
ThenQ lines follow, each contain four integers x1,y1,x2,y2 describing the left-down and right-up coordinates of query.
1≤n,m,K,Q≤100,000 .
1≤x≤n,1≤y≤m .
1≤x1≤x2≤n,1≤y1≤y2≤m .
Every test cases begin with four integers
Then
Then
Output
For every query output "Yes" or "No" as mentioned above.
Sample Input
22 2 1 21 11 1 1 22 1 2 22 2 2 11 11 22 1 2 2
Sample Output
YesNoYesHintHuge input, scanf recommended.
题意是一个棋盘上有很多车,车可以攻击他所属的一行或一列,包括它自己所在的位置。现在有很多询问,每次询问给定一个棋盘内部的矩形,问矩形内部的所有格子是否都被车攻击到?
对自己的智商感到不断怀疑系列。。。判断中间有没有零,求和啊
代码:
#include <iostream> #include <algorithm> #include <cmath> #include <vector> #include <string> #include <cstring>#include <stack>#pragma warning(disable:4996) using namespace std;int row[100005];int column[100005];int main(){int test,i,j,flag1,flag2;int n,m,k,q,x,y,x1,x2,y1,y2;scanf("%d",&test);while(test--){scanf("%d%d%d%d",&n,&m,&k,&q);memset(row,0,sizeof(row));memset(column,0,sizeof(column));for(i=1;i<=k;i++){scanf("%d%d",&x,&y);row[x]=1;column[y]=1;}for(i=1;i<=n;i++){row[i]=row[i]+row[i-1];}for(i=1;i<=m;i++){column[i]=column[i]+column[i-1];}for(i=1;i<=q;i++){scanf("%d%d%d%d",&x1,&y1,&x2,&y2);if(x2-x1+1==row[x2]-row[x1-1]||y2-y1+1==column[y2]-column[y1-1]){puts("Yes");}else{puts("No");}}}return 0;}
0 0
- HDU 5480:Conturbatio 前缀和
- 【前缀和】hdu 5480 Conturbatio
- HDU 5480 Conturbatio (前缀和)
- 前缀和 hdu 5480 (Conturbatio)
- HDU 5480 Conturbatio(前缀和)
- hduacm 5480 Conturbatio前缀和
- HDU 5480 Conturbatio(并查集或前缀和)
- hdu 5480 Conturbatio 区间和
- HDU5480:Conturbatio(前缀和)
- HDU 5480 Conturbatio
- Hdu 5480 Conturbatio
- hdu 5480Conturbatio
- HDU 5480 Conturbatio
- hdu 5480 Conturbatio(水)
- hdu 5480 Conturbatio【模拟】
- hdu 5480 Conturbatio
- 【HDU 5480 Conturbatio】
- HDU 5480 Conturbatio
- gonna, gotta, wanna
- 判断一个数字是否为2的阶次方
- Web Service简介(一)
- 高速数字PCB设计(1)—浅析PCB层叠结构(stackup)设计
- struts2属性驱动和模型驱动
- HDU 5480:Conturbatio 前缀和
- WebView在API 17后调addJavascriptInterface方法无效的解决办法
- 12299 - RMQ with Shifts(线段树单点更新、区间求最值)
- java 快速排序
- Swift学习笔记基础语法-整数类型
- UML用例图
- JS对象序列化为JSON对象
- A. Vasya and Petya's Game
- 配置Tomcat