打卡信奥刷题（529）用C++信奥P6995[普及组/提高] [NEERC2014] Knockout Racing

[NEERC2014] Knockout Racing

题面翻译

题目简述

有$N$辆车在很长的直线赛道（可看作数轴）上行驶，每辆车在区间$[A_i,B_i]$间往返行驶，速度相同，有$M$个询问，每次询问一个区间$[X_i,Y_i]$在$T_i$时刻有多少辆车

题目描述

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 $a_i$ and $b_i$ starting at the second $0$ in the point $a_i.$ The car moves from $a_i$ to $b_i,$ then from $b_i$ to $a_i,$ then from $a_i$ to $b_i$ 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 $x_j$ and $y_j$ inclusive after $t_j$ seconds from the start?

Your task is to answer Mike’s questions.

输入格式

The first line of the input file contains two integers $n$ and $m(1\le n,m\le 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 $a_i$ and $b_i(0\le a_i,b_i\le 10^9,a_i\ne b_i)$ – 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 $x_j,y_j$ , and $t_j(0\le x_j\le y_j\le 10^9,0\le t_j\le 10^9)$ – the coordinate range and the time for the question $j$ .

输出格式

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.

样例 #1

样例输入 #1

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

样例输出 #1

5
1
2
4
3

提示

Time limit: 1 s, Memory limit: 256 MB.

C++实现

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const ll N=1010,M=1010;
struct node{
ll a,b;
}e[N];
struct qu{
ll x,y,t;
}ques[M];
ll n,m;
int main(){
cin>>n>>m;
for(ll i=1;i<=n;i++){
cin>>e[i].a>>e[i].b;
}
for(ll i=1;i<=m;i++){
cin>>ques[i].x>>ques[i].y>>ques[i].t;
ll ans=0;
for(ll j=1;j<=n;j++){
ll difference=e[j].b-e[j].a;
ll to_back=ques[i].t/difference;
ll meter=e[j].a+(to_back%2==0?ques[i].t%difference:difference-ques[i].t%difference);
if(meter>=ques[i].x&&ques[i].y>=meter) {
ans++;
}
}
cout<<ans<<endl;
}
}

后续

接下来我会不断用C++来实现信奥比赛中的算法题、GESP考级编程题实现、白名单赛事考题实现，记录日常的编程生活、比赛心得，感兴趣的请关注，我后续将继续分享相关内容