NYOJ_5743Distribution(第八届河南省程序设计大赛)
来源:互联网 发布:淘宝店铺取名很重要么 编辑:程序博客网 时间:2024/04/28 19:57
题目描述
One day , Wang and Dong in the Dubai desertexpedition, discovered an ancient castle. Fortunately, they found a map of thecastle.The map marks the location of treasures.
They agreed to distribute the treasures according to the following rules:
Wang draws a horizontal line on the map and then Dong draws a vertical one so that the map is divided into 4 parts, as show below.
Wang will save the treasures in I and III ,while those situated in II and IV will betaken away by Dong. Wangfirst draw a horizontal line, Dong after the draw a vertical line.
They drewseveral pairs of lines. For each pair, Wangwants to know the difference between their treasures.
the first line contains two integers N and M, where N is the number of treasures on the map and M indicates how many times they are going to draw the lines. The 2nd to (N+1)-th lines Xi, Yi contain the co-ordinates of the treasures and the last M lines consist of the M pairs integers (X, Y) which means that the two splitting lines intersect at point (X, Y).
10 3
29 22
17 14
18 23
3 15
6 28
30 27
4 1
26 7
8 0
11 21
2 25
5 10
-6
4
One day , Wang and Dong in the Dubai desertexpedition, discovered an ancient castle. Fortunately, they found a map of thecastle.The map marks the location of treasures.
They agreed to distribute the treasures according to the following rules:
Wang draws a horizontal line on the map and then Dong draws a vertical one so that the map is divided into 4 parts, as show below.
Wang will save the treasures in I and III ,while those situated in II and IV will betaken away by Dong. Wangfirst draw a horizontal line, Dong after the draw a vertical line.
They drewseveral pairs of lines. For each pair, Wangwants to know the difference between their treasures.
It's guaranteed that all the reasures will lie on neither of the linesdrew by them.
the first line contains two integers N and M, where N is the number of treasures on the map and M indicates how many times they are going to draw the lines. The 2nd to (N+1)-th lines Xi, Yi contain the co-ordinates of the treasures and the last M lines consist of the M pairs integers (X, Y) which means that the two splitting lines intersect at point (X, Y).
( 0 < N, M ≤ 100, 0 ≤ Xi, Yi, X,Y ≤ 1000 )
Output contains M lines , a single line with a integer , the difference described above
10 3
29 22
17 14
18 23
3 15
6 28
30 27
4 1
26 7
8 0
11 21
2 25
5 10
19 24
-6
4
4
#include <cstdio>#include <iostream>#include <algorithm>using namespace std;struct node{ int x,y;};int main(){ int n,m,i,j,a,b,s4,s2,x,y; node mm[1100]; while(scanf("%d%d",&n,&m)!=EOF) { for(i=0;i<n;i++) { scanf("%d%d",&mm[i].x,&mm[i].y); } for(i=0;i<m;i++) { s4=s2=0; scanf("%d%d",&a,&b); for(j=0;j<n;j++) { if((mm[j].x>a&&mm[j].y>b)||(mm[j].x<a&&mm[j].y<b)) s4++; else s2++; } printf("%d\n",s4-s2); } } return 0;}
0 0
- NYOJ_5743Distribution(第八届河南省程序设计大赛)
- NYOJ_5743Distribution(第八届河南省程序设计大赛)
- 第八届河南省程序设计大赛
- 第八届河南省程序设计大赛-NYOJ-1241-Distribution(水题)
- NYIST 1238 最小换乘(第八届河南省程序设计大赛)
- 第八届河南省程序设计大赛 挑战密室(化学式模拟)
- 第八届河南省程序设计大赛 B 最大岛屿(bfs)
- 河南省第八届程序设计大赛有感
- 最少换乘 第八届河南省程序设计大赛
- 引水工程 第八届河南省程序设计大赛
- 河南省第八届程序设计大赛 最短路Dijkstra 最小换乘+
- nyoj1241 Distribution (河南省第八届acm程序设计大赛)
- nyoj 1242 Interference Signal (河南省第八届acm程序设计大赛)
- nyoj 1236 挑战密室(河南省第八届acm程序设计大赛)
- nyoj 1238 最少换乘 (河南省第八届acm程序设计大赛)
- nyoj1237 最大岛屿(河南省第八届acm程序设计大赛)
- NYOJ_5739最大岛屿(河南省第八届acm程序设计大赛)
- 第八届河南省程序设计大赛-NYOJ-1238-最少换乘
- 第三方网络支持库AFNetworking(终端搭建)
- NDK写文件到SD卡
- iOS注水动画效果以及歌词逐渐变色效果
- Android广播入门
- SPI通信接口
- NYOJ_5743Distribution(第八届河南省程序设计大赛)
- OneProxy分库分表演示--楼方鑫
- Tomcat环境变量
- php输出所有错误信息
- Android Studio常见bug
- Linux压缩命令
- EffectiveAndroidUI/UI框架
- 浏览器加载渲染网页过程解析--总结(转载)
- 【LeetCode】328. Odd Even Linked List