RiseOJ는 solved.ac와 제휴 관계가 없습니다. 티어 아이콘 © solved.ac. solved.ac
포럼
USACO0318 파일 입출력

Rest Stops

Gold V 골드 V
난이도
2s
시간 제한
256MB
메모리 제한
0
맞았습니다!!
0
제출 수
0.0%
정답률
레이팅

의견: 0

설명

Farmer John and his personal trainer Bessie are hiking up Mount Vancowver. For
their purposes (and yours), the mountain can be represented as a long straight
trail of length \(L\) meters (\(1 \leq L \leq 10^6\)). Farmer John will hike the
trail at a constant travel rate of \(r_F\) seconds per meter
(\(1 \leq r_F \leq 10^6\)). Since he is working on his stamina, he will not take
any rest stops along the way.

Bessie, however, is allowed to take rest stops, where she might find some tasty
grass. Of course, she cannot stop just anywhere! There are \(N\) rest stops along
the trail (\(1 \leq N \leq 10^5\)); the \(i\)-th stop is \(x_i\) meters from the start
of the trail (\(0 < x_i < L\)) and has a tastiness value \(c_i\)
(\(1 \leq c_i \leq 10^6\)). If Bessie rests at stop \(i\) for \(t\) seconds, she
receives \(c_i \cdot t\) tastiness units.

When not at a rest stop, Bessie will be hiking at a fixed travel rate of \(r_B\)
seconds per meter (\(1 \leq r_B \leq 10^6\)). Since Bessie is young and fit, \(r_B\)
is strictly less than \(r_F\).

Bessie would like to maximize her consumption of tasty grass. But she is worried
about Farmer John; she thinks that if at any point along the hike she is behind
Farmer John on the trail, he might lose all motivation to continue!

Help Bessie find the maximum total tastiness units she can obtain while making
sure that Farmer John completes the hike.

Problem credits: Dhruv Rohatgi

제약

Problem credits: Dhruv Rohatgi

입력 형식

The first line of input contains four integers: \(L\), \(N\), \(r_F\), and \(r_B\). The
next \(N\) lines describe the rest stops. For each \(i\) between \(1\) and \(N\), the
\(i+1\)-st line contains two integers \(x_i\) and \(c_i\), describing the position of
the \(i\)-th rest stop and the tastiness of the grass there.

It is guaranteed that \(r_F > r_B\), and \(0 < x_1 < \dots < x_N < L \). ** Note
that \(r_F\) and \(r_B\) are given in seconds per meter! **

출력 형식

A single integer: the maximum total tastiness units Bessie can obtain.

파일 입력 / 출력
이 문제는 표준 입출력을 사용하지 않습니다. 프로그램은 다음 파일을 읽고 써야 합니다:
입력을 읽을 파일 reststops.in
출력을 쓸 파일 reststops.out
예제 1
입력
10 2 4 3
7 2
8 1
출력
15
설명

In this example, it is optimal for Bessie to stop for \(7\) seconds at the \(x=7\) rest stop (acquiring \(14\) tastiness units) and then stop for an additional \(1\) second at the \(x=8\) rest stop (acquiring \(1\) more tastiness unit, for a total of \(15\) tastiness units).

문제 정보

riseoj 작성

출처 올림피아드 > USACO > 2017-2018 > February > Silver

태그

평가 및 의견

Rest Stops

개요
출제자 난이도 Gold V 골드 V 의견 0 / 50 공개 집계 (커뮤니티 난이도, 주요 주제, 품질)는 의견이 충분히 모이면 공개됩니다.

Log in to rate problems.

개별 의견

아직 의견이 없습니다. 자격이 된다면 위 양식에서 가장 먼저 평가해 보세요.

풀이 제출

Rest Stops

게스트로 둘러보고 있습니다. 로그인하면 풀이를 제출하고 진행 상황을 확인할 수 있습니다. 로그인하고 제출하기
공개
C++20 Tab 들여쓰기 · Ctrl+/ 주석 토글 · Enter 자동 들여쓰기
1 1 1 0 공백: 4 · UTF-8