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

Disruption

Platinum I 플래티넘 I
난이도
2s
시간 제한
256MB
메모리 제한
0
맞았습니다!!
0
제출 수
0.0%
정답률
레이팅

의견: 0

설명

Farmer John prides himself on running a well-connected farm. The farm is a
collection of \(N\) pastures (\(2 \leq N \leq 50,000\)), pairs of which are
connected with \(N-1\) bi-directional pathways, each having unit length. Farmer
John notices that using an appropriate series of these pathways, it is possible
to travel from any pasture to any other pasture.

Although FJ's farm is connected, he worries what might happen if one of the
pathways gets blocked, as this would effectively partition his farm into two
disjoint sets of pastures, where the cows could travel within each set but not
between the sets. FJ therefore builds a set of \(M\) additional bi-directional
pathways (\(1 \leq M \leq 50,000\)), each with a positive integer length at most
\(10^9\). The cows still only use the original pathways for transit, unless one
of these becomes blocked.

If one of the original pathways becomes blocked, the farm becomes partitioned
into two disjoint pieces, and FJ will select from among his extra pathways a
single replacement pathway that re-establishes connectivity between these two
pieces, so the cows can once again travel from any pasture to any other pasture.

For each of the original pathways on the farm, help FJ select the shortest
suitable replacement pathway.

Problem credits: Brian Dean

제약

Problem credits: Brian Dean

입력 형식

The first line of input contains \(N\) and \(M\). Each of the next \(N-1\) lines
describes an original pathway using integers \(p\), \(q\), where \(p \neq q\) are the
pastures connected by the pathway (in the range \(1 \ldots N\)). The remaining
\(M\) lines each describe an extra pathway in terms of three integers: \(p\), \(q\),
and \(r\), where \(r\) is the length of the pathway. At most one pathway runs
between any pair of pastures.

출력 형식

For each of the \(N-1\) original pathways in the order they appear in the input,
output the length of the shortest suitable replacement pathway which would
re-connect the farm if that original pathway were to be blocked. If no suitable
replacement exists, output -1.

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

riseoj 작성

출처 올림피아드 > USACO > 2017-2018 > US Open > Platinum

태그

평가 및 의견

Disruption

개요
출제자 난이도 Platinum I 플래티넘 I 의견 0 / 50 공개 집계 (커뮤니티 난이도, 주요 주제, 품질)는 의견이 충분히 모이면 공개됩니다.

Log in to rate problems.

개별 의견

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

풀이 제출

Disruption

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