Logo
(追記) (追記ここまで)

24981번 - Counting Liars 다국어

시간 제한메모리 제한제출정답맞힌 사람정답 비율
2 초 (추가 시간 없음) 1024 MB67728925346.252%

문제

Bessie the cow is hiding somewhere along the number line. Each of Farmer John's $N$ other cows (1ドル\le N\le 1000$) have a piece of information to share: the $i$-th cow either says that Bessie is hiding at some location less than or equal to $p_i,ドル or that Bessie is hiding at some location greater than or equal to $p_i$ (0ドル\le p_i\le 10^9$).

Unfortunately, it is possible that no hiding location is consistent with the answers of all of the cows, meaning that not all of the cows are telling the truth. Count the minimum number of cows that must be lying.

입력

The first line contains $N$.

The next $N$ lines each contain either L or G, followed by an integer $p_i$. L means that the $i$-th cow says that Bessie's hiding location is less than or equal to $p_i,ドル and G means that $i$-th cow says that Bessie's hiding location is greater than or equal to $p_i$.

출력

The minimum number of cows that must be lying.

제한

예제 입력 1

2
G 3
L 5

예제 출력 1

0

It is possible that no cow is lying.

예제 입력 2

2
G 3
L 2

예제 출력 2

1

At least one of the cows must be lying.

힌트

출처

Olympiad > USA Computing Olympiad > 2021-2022 Season > USACO 2022 US Open Contest > Bronze 2번

(追記) (追記ここまで)

출처

대학교 대회

  • 사업자 등록 번호: 541-88-00682
  • 대표자명: 최백준
  • 주소: 서울시 서초구 서초대로74길 29 서초파라곤 412호
  • 전화번호: 02-521-0487 (이메일로 연락 주세요)
  • 이메일: contacts@startlink.io
  • 통신판매신고번호: 제 2017-서울서초-2193 호

AltStyle によって変換されたページ (->オリジナル) /