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

Fenced In

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

의견: 0

설명

Farmer John has realized that many of his cows are strangely agoraphobic (being
fearful of large open spaces). To try and make them less afraid of grazing, he
partitions his large field into a number of smaller regions by building vertical
(north-south) and horizontal (east-west) fences.

The large field is a rectangle with corner points at \((0,0)\) and \((A,B)\). FJ
builds \(n\) vertical fences (\(0 \leq n \leq 25,000\)) at distinct locations
\(a_1 \ldots a_n\) (\(0 < a_i < A\)); each fence runs from \((a_i, 0)\) to \((a_i, B)\).
He also builds \(m\) horizontal fences (\(0 \leq m \leq 25,000\)) at locations
\(b_1 \ldots b_m\) (\(0 < b_i < B\)); each such fence runs from \((0, b_i)\) to
\((A, b_i)\). Each vertical fence crosses through each horizontal fence,
subdividing the large field into a total of \((n+1)(m+1)\) regions.

Unfortunately, FJ completely forgot to build gates into his fences, making it
impossible for cows to leave their enclosing region and travel around the entire
field! He wants to remedy this situation by removing pieces of some of his
fences to allow cows to travel between adjacent regions. He wants to select
certain pairs of adjacent regions and remove the entire length of fence
separating them; afterwards, he wants cows to be able to wander through these
openings so they can travel anywhere in his larger field.

For example, FJ might take a fence pattern looking like this:

+---+--+
|   |  |
+---+--+
|   |  |
|   |  |
+---+--+

and open it up like so:

+---+--+
|      |
+---+  +
|      |
|      |
+---+--+

Please help FJ determine the minimum total length of fencing he must remove to
accomplish his goal.

Problem credits: Brian Dean

제약

Problem credits: Brian Dean

입력 형식

The first line of input contains \(A\), \(B\), \(n\), and \(m\)
(\(1 \leq A, B \leq 1,000,000,000\)). The next \(n\) lines contain \(a_1 \ldots a_n\),
and the next \(m\) lines after that contain \(b_1 \ldots b_m\).

출력 형식

Please write the minimum length of fencing FJ must remove. Note that this might
be too large to fit into a standard 32-bit integer, so you may need to
use 64-bit integer types (e.g., "long long" in C/C++).

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

riseoj 작성

출처 올림피아드 > USACO > 2015-2016 > February > Platinum

태그

평가 및 의견

Fenced In

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

Log in to rate problems.

개별 의견

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

풀이 제출

Fenced In

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