zoukankan      html  css  js  c++  java
  • HNU Knockout Racing 分类: ACM 2015-08-03 13:35 1人阅读 评论(0) 收藏

    题目链接http://acm.hnu.cn/online/?action=problem&type=show&id=13342&courseid=0
    Problem description

    The races became more popular than ever at Pandora planet. But these races are quite unusual. There are n cars participating in a race on the long straight track. Each car moves with a speed of 1 meter per second. Track has coordinates in meters.

    The car number i moves between two points on the track with coordinates ai and bi starting at the second 0 in the point ai. The car moves from ai to bi, then from bi to ai, then from ai to bi again, and so on. Handsome Mike wants to knock some cars out of the race using dynamite. Thus he has m questions. The question number j is: what is the number of cars in the coordinates between xj and yj inclusive after tj seconds from the start? Your task is to answer Mike’s questions.

    Input

    The first line of the input file contains two integers n and m (1 ≤ n,m ≤ 1000) — the number of cars in the race and the number of questions. Each of the following n lines contains a description of the car: two integers ai and bi(0 ≤ ai,bi≤ 10^9, ai ≠ bi) — the coordinates of the two points between which the car i moves. Each of the following m lines contains a description of the question: three integers xj, yj, and tj (0 ≤ xj≤ yj≤ 10^9, 0 ≤ tj≤ 10^9) — the coordinate range and the time for the question j.

    Output

    Write m lines to the output file. Each line must contain one integer — the answer to the corresponding question in order they are given in the input file.

    Sample Input
    5 5
    0 1
    0 2
    2 3
    3 5
    4 5
    0 5 0
    0 1 2
    0 2 1
    2 5 2
    2 5 3

    Sample Output
    5
    1
    2
    4
    3

    Problem Source
    NEERC 2014

    水题= =直接上代码

    #include<stdio.h>
    #include<string.h>
    #include<iostream>
    #include<algorithm>
    #define maxn 1000+100 
    using namespace std;
    struct node
    {
        int x,y;
    }a[maxn];
    int main()
    {
        int n,m;
        scanf("%d %d",&n,&m);
        for(int i=0;i<n;i++)
        {
            scanf("%d %d",&a[i].x,&a[i].y);
        }
        while(m--)
        {
            int xx,yy,t;
            scanf("%d %d %d",&xx,&yy,&t);
            int count=0;
            for(int i=0;i<n;i++)
            {
                int tx=0;
                if(t<(a[i].y-a[i].x))
                {
                    tx=a[i].x+t;
                } 
                else
                {
                     int  u=t%(a[i].y-a[i].x);
                     int  v=t/(a[i].y-a[i].x); 
                     if(v&1) 
                     tx=a[i].y-u; 
                     else
                     tx=a[i].x+u; 
                  } 
                  if(tx>=xx&&tx<=yy)
                  {
                      count++;
                  } 
            }
            printf("%d
    ",count);
        }
        return 0;
    }
    
    

    版权声明:本文为博主原创文章,未经博主允许不得转载。

  • 相关阅读:
    组装query,query汇总,query字段
    POJ 1276, Cash Machine
    POJ 1129, Channel Allocation
    POJ 2531, Network Saboteur
    POJ 1837, Balance
    POJ 3278, Catch That Cow
    POJ 2676, Sudoku
    POJ 3126, Prime Path
    POJ 3414, Pots
    POJ 1426, Find The Multiple
  • 原文地址:https://www.cnblogs.com/NaCl/p/4700584.html
Copyright © 2011-2022 走看看