Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

ABC_228 - TOYOTA SYSTEMS Programming Contest 2021(AtCoder Beginner Contest 228) #40

Open
zeikar opened this issue Nov 20, 2021 · 0 comments
Assignees
Labels
rated Rated contest

Comments

@zeikar
Copy link
Owner

zeikar commented Nov 20, 2021

Contest Link

https://atcoder.jp/contests/abc228

Solved problems

A, B, C, D

Brief explanations

A, B 간단. 단, A는 처음에 이해가 안되서 1번 틀림...
C: 정렬을 한 후 자신보다 300점 높은 개수를 세고 K보다 작거나 같으면 Yes 출력. 개수를 셀 때 upper bound 이용.
D: 들어갈 수 있는 자리를 map으로 예약해두고 값이 업데이트 될 때마다 제거, 자리를 찾는 건 lower bound 이용. 단, n을 넘으면 다시 0부터 채워야 하므로 2 * n 만큼을 자리 예약을 해둠.

@zeikar zeikar added the rated Rated contest label Nov 20, 2021
@zeikar zeikar self-assigned this Nov 20, 2021
zeikar added a commit that referenced this issue Nov 20, 2021
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
rated Rated contest
Projects
None yet
Development

No branches or pull requests

1 participant