最新文章专题视频专题问答1问答10问答100问答1000问答2000关键字专题1关键字专题50关键字专题500关键字专题1500TAG最新视频文章推荐1 推荐3 推荐5 推荐7 推荐9 推荐11 推荐13 推荐15 推荐17 推荐19 推荐21 推荐23 推荐25 推荐27 推荐29 推荐31 推荐33 推荐35 推荐37视频文章20视频文章30视频文章40视频文章50视频文章60 视频文章70视频文章80视频文章90视频文章100视频文章120视频文章140 视频2关键字专题关键字专题tag2tag3文章专题文章专题2文章索引1文章索引2文章索引3文章索引4文章索引5123456789101112131415文章专题3
当前位置: 首页 - 科技 - 知识百科 - 正文

CodeforcesRound#112(Div.2)-A.SupercentralPoint_html/css

来源:动视网 责编:小采 时间:2020-11-27 15:57:35
文档

CodeforcesRound#112(Div.2)-A.SupercentralPoint_html/css

CodeforcesRound#112(Div.2)-A.SupercentralPoint_html/css_WEB-ITnose:Supercentral Point time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output One day Vasya painted a Cartesian coordinate system on a piece of paper and marked some se
推荐度:
导读CodeforcesRound#112(Div.2)-A.SupercentralPoint_html/css_WEB-ITnose:Supercentral Point time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output One day Vasya painted a Cartesian coordinate system on a piece of paper and marked some se


Supercentral Point

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

One day Vasya painted a Cartesian coordinate system on a piece of paper and marked some set of points (x1,?y1),?(x2,?y2),?...,?(xn,?yn). Let's define neighbors for some fixed point from the given set (x,?y):

  • point (x',?y') is (x,?y)'s right neighbor, if x'?>?x and y'?=?y
  • point (x',?y') is (x,?y)'s left neighbor, if x'?
  • point (x',?y') is (x,?y)'s lower neighbor, if x'?=?x and y'?
  • point (x',?y') is (x,?y)'s upper neighbor, if x'?=?x and y'?>?y
  • We'll consider point (x,?y) from the given set supercentral, if it has at least one upper, at least one lower, at least one left and at least one right neighbor among this set's points.

    Vasya marked quite many points on the paper. Analyzing the picture manually is rather a challenge, so Vasya asked you to help him. Your task is to find the number of supercentral points in the given set.

    Input

    The first input line contains the only integer n (1?≤?n?≤?200) ? the number of points in the given set. Next n lines contain the coordinates of the points written as "x y" (without the quotes) (|x|,?|y|?≤?1000), all coordinates are integers. The numbers in the line are separated by exactly one space. It is guaranteed that all points are different.

    Output

    Print the only number ? the number of supercentral points of the given set.

    Sample test(s)

    input

    81 14 23 11 20 20 11 01 3

    output

    input

    50 00 11 00 -1-1 0

    output

    Note

    In the first sample the supercentral points are only points (1,?1) and (1,?2).

    In the second sample there is one supercental point ? point (0,?0).






    解题思路:没什么说的,直接暴力搞了。遍历每个点,看是否符合要求。为了省时间,我们可以在输入的时候把x的上限,下限,和y的上限和下限先记录一下,在判断每个点的时候会用到。





    AC代码:

    #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;#define INF 0x7fffffffint x[205], y[205], a[2005][2005];int main(){ #ifdef sxk freopen("in.txt","r",stdin); #endif int n, xx, yy, xxx, yyy, flag0, flag1, flag2, flag3; while(scanf("%d",&n)!=EOF) { memset(a, 0, sizeof(a)); xx = yy = -12345; xxx= yyy = 12345; for(int i=0; i x[i]) xxx = x[i]; if(yy < y[i]) yy = y[i]; if(yyy > y[i]) yyy = y[i]; } int ans = 0; for(int i=0; i

    文档

    CodeforcesRound#112(Div.2)-A.SupercentralPoint_html/css

    CodeforcesRound#112(Div.2)-A.SupercentralPoint_html/css_WEB-ITnose:Supercentral Point time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output One day Vasya painted a Cartesian coordinate system on a piece of paper and marked some se
    推荐度:
    • 热门焦点

    最新推荐

    猜你喜欢

    热门推荐

    专题
    Top