schedules | brain

Practice › Codeforces Solutions › Deltix Round, Autumn 2021 (open for everyone, rated, Div. 1 + Div. 2) ›

CF 1609C - Complex Market Analysis

CF 1609C - Complex Market Analysis Rating: 1400 Tags: binary search, dp, implementation, number theory, schedules, two pointers Solve time: 1m 36s Verified: yes Solution Problem Understanding We are given an array of integers and a step size e . For each starting index i , we can form a subsequence by taking every e -th element: a[i], a[i+e], a[i+2e], ... up to the point where the index does not...

Practice › Codeforces Solutions › Codeforces Round 825 (Div. 2) ›

CF 1736C1 - Good Subarrays (Easy Version)

CF 1736C1 - Good Subarrays (Easy Version) Rating: 1300 Tags: binary search, data structures, schedules, two pointers Solve time: 2m 6s Verified: yes Solution Problem Understanding We are asked to count all contiguous subarrays of a given array where each element is at least as large as its position in the subarray. More concretely, if a subarray starts at index l and ends at index r , the first element...

Practice › Codeforces Solutions › Codeforces Round 1079 (Div. 2) ›

CF 2197B - Array and Permutation

CF 2197B - Array and Permutation Rating: 1100 Tags: implementation, schedules, sortings, two pointers Solve time: 1m 21s Verified: yes Solution Problem Understanding We are given a permutation p of length n and an array a of the same length. A permutation is an array of distinct integers from 1 to n , in some order. We want to determine if a could have been produced from p using a...

Practice › Codeforces Solutions › Codeforces Round 976 (Div. 2) and Divide By Zero 9.0 ›

CF 2020C - Bitwise Balancing

CF 2020C - Bitwise Balancing Rating: 1400 Tags: bitmasks, hashing, implementation, math, schedules, ternary search Solve time: 2m 10s Verified: no Solution Problem Understanding We are given three non-negative integers b , c , and d . We must construct a non-negative integer a such that $$(a \mid b) - (a & c) = d$$ where | is bitwise OR and & is bitwise AND. The task is not to...

Practice › Codeforces Solutions › Good Bye 2024: 2025 is NEAR ›

CF 2053D - Refined Product Optimality

CF 2053D - Refined Product Optimality Rating: 1700 Tags: binary search, data structures, greedy, math, schedules, sortings Solve time: 2m 11s Verified: no Solution Problem Understanding We are given two arrays, a and b , each of length n . The task is to compute the maximum product $$P = \prod_{i=1}^{n} \min(a_i, b_i)$$ after any rearrangement of b . Conceptually, you can think of this as pairing elements from a...

Practice › Codeforces Solutions › Squarepoint Challenge (Codeforces Round 1055, Div. 1 + Div. 2) ›

CF 2152H2 - Victorious Coloring (Hard Version)

CF 2152H2 - Victorious Coloring (Hard Version) Rating: 3500 Tags: data structures, greedy, schedules Solve time: 1m 22s Verified: no Solution Problem Understanding We are given a tree with weighted edges, and we are asked to assign nonnegative weights to vertices so that a certain “victorious coloring” has a minimum cost at least some value l , while keeping the sum of vertex weights as small as possible. A victorious...

Practice › Codeforces Solutions › Codeforces Round 1059 (Div. 3) ›

CF 2162E - Beautiful Palindromes

CF 2162E - Beautiful Palindromes Rating: 1600 Tags: constructive algorithms, greedy, schedules Solve time: 1m 32s Verified: no Solution Problem Understanding We are given an array of integers between 1 and n and an integer k. We are allowed to append exactly k numbers to the end of this array. The goal is to choose these k numbers such that, after appending, the total number of palindromic subarrays in the...

Practice › Codeforces Solutions › Codeforces Round 1079 (Div. 2) ›

CF 2197A - Friendly Numbers

CF 2197A - Friendly Numbers Rating: 800 Tags: binary search, brute force, expression parsing, math, schedules Solve time: 1m 6s Verified: yes Solution Problem Understanding We are given an integer $x$, and we want to count how many integers $y$ satisfy a very specific balancing condition: if you take $y$ and subtract the sum of its digits, you land exactly on $x$. In other words, each valid number $y$ “overpays”...

Practice › Codeforces Solutions ›

Codeforces Round 1079 (Div. 2)

Codeforces Round 1079 (Div. 2) Type: Div. 2 | Problems: 7 | Verified: 3/7 | Rating range: 800-2500 | Time: 11m 24s Problem Name Rating Tags Solve Time Verified A Friendly Numbers 800 binary-search, brute-force, expression-parsing 1m 6s ✓ B Array and Permutation 1100 implementation, schedules, sortings 1m 21s ✓ C Game with a Fraction 1200 games, greedy, math 2m 10s ✗ D Another Problem about Beautiful Pairs 1600 brute-force,...

Practice › Codeforces Solutions ›

April Fools Day Contest 2024

April Fools Day Contest 2024 April Fools | 10 problems | 5/10 verified | Difficulty - | 10m 54s # Problem Rating Tags Accepted Time ✓ A Are You a Robot, Again? *special, strings 14,101 32s ✓ B Is it stated? *special, strings 12,331 41s ✓ C They Have Fooled *special, brute-force, schedules 3,262 52s ✓ D Are You a Procrastinator? *special, implementation 5,359 43s E Sweep Line *special, combinatorics,...

Practice › Codeforces Solutions › April Fools Day Contest 2024 ›

CF 1952C - They Have Fooled

CF 1952C - They Have Fooled Rating: - Tags: *special, brute force, schedules Solve time: 52s Verified: yes Solution Problem Understanding The input to this problem is a single integer $n$, with $0 \le n \le 12$. Despite how small this looks, the task is not about iterating or simulating anything directly from this number in a naive arithmetic sense. Instead, the problem asks for a fixed value that depends...

Practice › Codeforces Solutions › Codeforces Round 938 (Div. 3) ›

CF 1955F - Unfair Game

CF 1955F - Unfair Game Rating: 1800 Tags: dp, games, greedy, math, schedules Solve time: 1m Verified: no Solution Problem Understanding We are asked to maximize the number of games Bob can win in a repeated XOR game against Alice. The game is played on a multiset of integers containing only ones, twos, threes, and fours. Alice wins if the XOR of all remaining numbers is non-zero; otherwise, Bob wins....

Practice › Codeforces Solutions ›

School Personal Contest #3 (Winter Computer School 2010/11) - Codeforces Beta Round 45 (ACM-ICPC Rules)

School Personal Contest #3 (Winter Computer School 2010/11) - Codeforces Beta Round 45 (ACM-ICPC Rules) Beta | 8 problems | 6/8 verified | Difficulty 900-2800 | 15m 12s # Problem Rating Tags Accepted Time ✓ A Rock-paper-scissors 900 implementation, schedules 7,290 1m 31s ✓ B Land Lot 1200 brute-force, implementation 3,042 1m 47s ✓ C The Race 1800 math 856 1m 54s ✓ D Permutations 1500 greedy 2,995 2m 3s...

#schedules

CF 1609C - Complex Market Analysis

CF 1736C1 - Good Subarrays (Easy Version)

CF 2197B - Array and Permutation

CF 2020C - Bitwise Balancing

CF 2053D - Refined Product Optimality

CF 2152H2 - Victorious Coloring (Hard Version)

CF 2162E - Beautiful Palindromes

CF 2197A - Friendly Numbers

Codeforces Round 1079 (Div. 2)

April Fools Day Contest 2024

CF 1952C - They Have Fooled

CF 1955F - Unfair Game

School Personal Contest #3 (Winter Computer School 2010/11) - Codeforces Beta Round 45 (ACM-ICPC Rules)