넘치게 채우기

https://codeforces.com/contest/2064/problem/DCodeforces Round 1005(Div. 2) - D. Eating문제 유형: 그리디, 비트마스킹, 이진 탐색시간 제한: 5초메모리 제한: 512MB 문제There are n">n slimes on a line, the i">i-th of which has weight wi">wi. Slime i">i is able to eat another slime j">j if wi≥wj">wi≥wj; afterwards, slime j">j disappears and the weight of slime i">i becomes wi⊕wj">wi⊕wj.The King of Slimes wants to ru..

https://codeforces.com/contest/2064/problem/CCodeforces Round 1005(Div. 2) - C. Remove the ends문제 유형: 그리디, 해 구성하기, 모노토닉, 구간합, 브루트 포스시간 제한: 3초메모리 제한: 256MB 문제You have an array a">a of length n">n consisting of non-zero integers. Initially, you have 0">0 coins, and you will do the following until a">a is empty:Let m">m be the current size of a">a. Select an integer i">i where 1≤i≤m">..

https://codeforces.com/contest/2064/problem/BCodeforces Round 1005(Div. 2) - B. Variety is Discouraged문제 유형: 그리디, 해 구성하기, 슬라이딩 윈도우시간 제한: 1.5초메모리 제한: 256MB 문제Define the score of an arbitrary array b">b to be the length of b">b minus the number of distinct elements in b">b. For example:The score of [1,2,2,4]">[1,2,2,4] is 1">1, as it has length 4">4 and only 3">3 distinct elements (1">1, 2">2, 4">..

https://codeforces.com/contest/2064/problem/ACodeforces Round 1005(Div. 2) - A. Brogramming Contest문제 유형: 그리디, 문자열 처리시간 제한: 1초메모리 제한: 256MB 문제One day after waking up, your friend challenged you to a brogramming contest. In a brogramming contest, you are given a binary string∗">∗ s">s of length n">n and an initially empty binary string t">t.During a brogramming contest, you can make either..

https://codeforces.com/contest/2067/problem/DCodeforces Round 1004(Div.2)] - D. Obejct Identification문제 유형: 그래프, 생성형, 인터랙티브시간 제한: 2초메모리 제한: 256MB 문제This is an interactive problem.You are given an array x1,…,xn">x1,…,xn of integers from 1">1 to n">n. The jury also has a fixed but hidden array y1,…,yn">y1,…,yn of integers from 1">1 to n">n. The elements of array y">y are unknown to y..

https://codeforces.com/contest/2067/problem/CCodeforces Round 1004(Div.2) - C. Devyatkino문제 유형: 수학, 그리디, 탐색, 브루트 포스시간 제한: 2초메모리 제한: 256MB 문제You are given a positive integer n">n. In one operation, you can add to n">n any positive integer whose decimal representation contains only the digit 9">9, possibly repeated several times.What is the minimum number of operations needed to make the number n"..

https://codeforces.com/contest/2067/problem/BCodeforces Round 1004(Div.2) - B. Two Large Bags문제 유형: 투 포인터, 그리디, 정렬시간 제한: 1초메모리 제한: 256MB 문제You have two large bags of numbers. Initially, the first bag contains n">n numbers: a1,a2,…,an">a1,a2,…,an, while the second bag is empty. You are allowed to perform the following operations:Choose any number from the first bag and move it to the secon..

https://codeforces.com/contest/2067/problem/ACodeforces Round 1004(Div.2) - A. Adjacent Digit Sums문제 유형: 수학시간 제한: 1초메모리 제한: 256MB 문제You are given two numbers x,y">x,y. You need to determine if there exists an integer n">n such that S(n)=x">S(n)=x, S(n+1)=y">S(n+1)=y.Here, S(a)">S(a) denotes the sum of the digits of the number a">a in the decimal numeral system. 두 정수 x, y를 받습니다. 당신은 S(n) = x, S(n..

https://codeforces.com/contest/2063/problem/DCodeforces Round 1000(Div. 2) - D. Game With Triangles문제 유형: 그리디, 수학, 기하학, 삼분 탐색, 구현, 투 포인터, 브루트 포스, 부분합, 구간합시간 제한: 2초메모리 제한: 256MB 문제There are n+m">n+m distinct points (a1,0),(a2,0),…,(an,0),(b1,2),(b2,2),…,(bm,2)">(a1,0),(a2,0),…,(an,0),(b1,2),(b2,2),…,(bm,2) on the plane. Initially, your score is 0">0. To increase your score, you can ..

https://codeforces.com/contest/2063/problem/CCodeforces Round 1000(Div.2) - C. Remove Exactly Two문제 유형: 그리디, 그래프, 정렬, 트리시간 제한: 2초메모리 제한: 256MB 문제You are given a tree∗ of n vertices. You must perform the following operation exactly twice.Select a vertex v; Remove all edges incident to v, and also the vertex v. Please find the maximum number of connected components after performing the operation e..