넘치게 채우기

https://codeforces.com/contest/2033/problem/DCodeforces Round 981(Div.3) - D. Kosuke's Assignment문제 유형: 부분합, 그리디, 다이나믹 프로그래밍시간 제한: 2초메모리 제한: 256MB 문제After a trip with Sakurako, Kousuke was very scared because he forgot about his programming assignment.In this assignment, the teacher gave him an array a">a of n">n integers and asked him to calculate the number of non-overlapping segments of the a..

https://codeforces.com/contest/2033/problem/CCodeforces Round 981(Div.3) - C. Sakurako's Field Trip문제 유형: 투 포인터, 그리디시간 제한: 2초메모리 제한: 256MB 문제Even in university, students need to relax. That is why Sakurakos teacher decided to go on a field trip. It is known that all of the students will be walking in one line. The student with index i">i has some topic of interest which is described as ai">a_i.A..

https://codeforces.com/contest/2033/problem/BCodeforces Round 981(Div.3) - B. Sakurako and Water문제 유형: 구현, 행렬시간 제한: 2초메모리 제한: 256MB 문제During her journey with Kosuke, Sakurako and Kosuke found a valley that can be represented as a matrix of size n×n">n×n, where at the intersection of the i">i-th row and the j">j-th column is a mountain with a height of ai,j">ai,j. If ai,j<0">ai,j0, then..

https://codeforces.com/contest/2033/problem/ACodeforces Round 981(DIv.3) - A. Sakurako and Kosuke문제 유형: 수학, 구현시간 제한: 1초메모리 제한: 256MB 문제Sakurako and Kosuke decided to play some games with a dot on a coordinate line. The dot is currently located in position x=0">x=0. They will be taking turns, and Sakurako will be the one to start.On the i">i-th move, the current player will move the dot in some d..

https://codeforces.com/contest/2013/problem/DCodeforces Round 973(Div. 2) - D. Minimize the Difference문제 유형 : 스택, 부분합, 그리디제한 시간: 2초제한 메모리: 256MB 문제Zhan, tired after the contest, gave the only task that he did not solve during the contest to his friend, Sungat. However, he could not solve it either, so we ask you to try to solve this problem.You are given an array a1,a2,…,an">𝑎1,𝑎2,…,𝑎?..

https://codeforces.com/contest/2013/problem/CCodeforces Round 973(Div. 2) - C. Password Cracking문제 유형 : 구현제한 시간: 2초제한 메모리: 256MB 문제Dimash learned that Mansur wrote something very unpleasant about him to a friend, so he decided to find out his password at all costs and discover what exactly he wrote.Believing in the strength of his password, Mansur stated that his password — is a binary string of..

https://codeforces.com/contest/2013/problem/BCodeforces Round 973(Div. 2) - B. Battle for Survive문제 유형 : 그리디제한 시간: 1초제한 메모리: 256MB 문제Eralim, being the mafia boss, manages a group of n">𝑛n fighters. Fighter i">𝑖i has a rating of ai">𝑎𝑖ai.Eralim arranges a tournament of n−1">𝑛−1n−1 battles, in each of which two not yet eliminated fighters i">𝑖i and j">𝑗j (1≤i<j≤n">1≤..

https://codeforces.com/contest/2013/problem/ACodeforces Round 973(Div. 2) - A. Zhan's Blender문제 유형 : 구현 문제time limit per test1 secondmemory limit per test256 megabytesToday, a club fair was held at "NSPhM". In order to advertise his pastry club, Zhan decided to demonstrate the power of his blender.To demonstrate the power of his blender, Zhan has n">𝑛fruits.The blender can mix up to x">𝑥 fruit..