RiseOJ는 solved.ac와 제휴 관계가 없습니다. 티어 아이콘 © solved.ac. solved.ac
포럼
ICPC00035

C. Crane Balancing

Unrated 레이팅 미적용
난이도
1s
시간 제한
1024MB
메모리 제한
0
맞았습니다!!
0
제출 수
0.0%
정답률
레이팅

의견: 0

설명

Wherever there is lar\(ge-sc\)ale construction, you will find cranes that do the lifting. One hardly ever thinks about what marvelous examples of engineering cranes are: a structure of (relatively) little weight that can lift much heavier loads. But even the be\(st-bu\)ilt cranes may have a limit on how much weight they can lift. The Association of Crane Manufacturers (ACM) needs a program to compute the range of weights that a crane can lift. Since cranes are symmetric, ACM engineers have decided to consider only a cross section of each crane, which can be viewed as a polygon resting on the \(x-ax\)is. Figure C.1: Crane cross section Figure C.1 shows a cross section of the crane in the first sample input. Assume that every \(1 \times 1\) unit of crane cross section weighs 1 kilogram and that the weight to be lifted will be attached at one of the polygon vertices (indicated by the arrow in Figure C.1). Write a program that determines the weight range for which the crane will not topple to the left or to the right.

제약
입력 형식

The input consists of a single test case. The test case starts with a single integer \(n\) (\(3 \le n \le 100\)), the number of points of the polygon used to describe the crane’s shape. The following \(n\) pairs of integers \(xi\), y\(i\) (−\(2\,000 \le xi \le 2\,000\), \(0 \le yi \le 2\,000\)) are the coordinates of the polygon points in order. The weight is attached at the first polygon point and at least two polygon points are lying on the \(x-ax\)is.

출력 형식

Display the weight range (in kilograms) that can be attached to the crane without the crane toppling over. If the range is [a, b], display ⌊\(a\)⌋.. ⌈\(b\)⌉. For example, if the range is [1.5, 13.3], display 1 .. 14. If the range is [a, ∞), display ⌊\(a\)⌋.. inf. If the crane cannot carry any weight, display unstable instead.

예제 1
입력
7
50 50
0 50
0 0
30 0
30 30
40 40
50 40
출력
0 .. 1017
예제 2
입력
7
50 50
0 50
0 0
10 0
10 30
20 40
50 40
출력
unstable
문제 정보

생성자가 기록되지 않았습니다.

출처 ICPC World Finals 2014

평가 및 의견

C. Crane Balancing

개요
출제자 난이도 Unrated 레이팅 미적용 의견 0 / 50 공개 집계 (커뮤니티 난이도, 주요 주제, 품질)는 의견이 충분히 모이면 공개됩니다.

Log in to rate problems.

개별 의견

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

풀이 제출

C. Crane Balancing

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