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

Even More Odd Photos

Silver II 실버 II
난이도
2s
시간 제한
256MB
메모리 제한
0
맞았습니다!!
0
제출 수
0.0%
정답률
레이팅

의견: 0

설명

Farmer John is yet again trying to take a photograph of his \(N\) cows
(\(2 \leq N \leq 1000\)).

Each cow has an integer "breed ID" number in the range \(1 \ldots 100\). Farmer
John has a very peculiar idea in mind for his photo: he wants to partition all
the cows into disjoint groups (in other words, place each cow in exactly one group) and then
line up the groups so the sum of the breed IDs of the cows in the first group
is even, the sum of the IDs in the second group is odd, and so on, alternating
between even and odd.

What is the maximum possible number of groups Farmer John can form?

Problem credits: Nick Wu

제약

Problem credits: Nick Wu

입력 형식

The first line of input contains \(N\). The next line contains \(N\)
space-separated integers giving the breed IDs of the \(N\) cows.

출력 형식

The maximum possible number of groups in Farmer John's photo. It can be shown
that at least one feasible grouping exists.

예제 1
입력
7
1 3 5 7 9 11 13
출력
3
설명

In this example, one way to form the maximum number of three groups is as
follows. Place 1 and 3 in the first group, 5, 7, and 9 in the second group, and
11 and 13 in the third group.

예제 2
입력
7
11 2 17 13 1 15 3
출력
5
설명

In this example, one way to form the maximum number of five groups is as
follows. Place 2 in the first group, 11 in the second group, 13 and 1 in the
third group, 15 in the fourth group, and 17 and 3 in the fifth group.

문제 정보

riseoj 작성

출처 올림피아드 > USACO > 2020-2021 > January > Bronze

태그

평가 및 의견

Even More Odd Photos

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

Log in to rate problems.

개별 의견

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

풀이 제출

Even More Odd Photos

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