Stampede
골드 I의견: 0
Farmer John's N cows (1 <= N <= 50,000) are running in a foot race. Viewed from above, each cow is a unit-length horizontal line segment, specified by the coordinates of its left corner point at time t=0. Each cow moves to the right (in the +x direction), specified by the integer amount of time it takes her to move 1 unit to the right.
FJ situates himself at (0,0) and looks along a ray extending in the +y direction. As the race unfolds, FJ sees a cow if she is ever the first cow visible along this ray. A cow might not be visible if another cow is "in front" of her during the entire time she crosses FJ's line of sight.
Please compute the number of cows FJ can see during the entire race.
Line 1: N.
Each of the following N lines describes a cow with three integers x y r: its left endpoint is at (x,y) at time t=0, moving right at 1 unit every r units of time. x is in -1000..-1, y in 1..1,000,000 (distinct for every cow), and r in 1..1,000,000.
A single integer specifying the number of cows FJ can see during the entire race (from t=0 onward).
stampede.instampede.out3
-2 1 3
-3 2 3
-5 100 12Output details: FJ can see cows 1 and 2 but not cow 3.
riseoj 작성
출처 올림피아드 > USACO > 2014-2015 > January > Silver
평가 및 의견
Stampede
아직 의견이 없습니다. 자격이 된다면 위 양식에서 가장 먼저 평가해 보세요.
풀이 제출
Stampede