onlyblues

摘要： E. Maximum Monogonosity You are given an array $a$ of length $n$ and an array $b$ of length $n$. The cost of a segment $[l, r]$, $1 \le l \le r \le n$ 阅读全文

摘要： D. Andrey and Escape from Capygrad An incident occurred in Capygrad, the capital of Tyagoland, where all the capybaras in the city went crazy and star 阅读全文

摘要： G. Vlad and the Mountains Vlad decided to go on a trip to the mountains. He plans to move between $n$ mountains, some of which are connected by roads. 阅读全文

摘要： G. Counting Graphs Given a tree consisting of $n$ vertices. A tree is a connected undirected graph without cycles. Each edge of the tree has its weigh 阅读全文

摘要： E1. PermuTree (easy version) This is the easy version of the problem. The differences between the two versions are the constraint on $n$ and the time 阅读全文

摘要： A. Vika and Her Friends Vika and her friends went shopping in a mall, which can be represented as a rectangular grid of rooms with sides of length $n$ 阅读全文

摘要： C. Particles You have discovered $n$ mysterious particles on a line with integer charges of $c_1,\dots,c_n$. You have a device that allows you to perf 阅读全文

摘要： C. No Prime Differences You are given integers $n$ and $m$. Fill an $n$ by $m$ grid with the integers $1$ through $n\cdot m$, in such a way that for a 阅读全文

摘要： Count of Integers You are given two numeric strings num1 and num2 and two integers max_sum and min_sum. We denote an integer x to be good if: num1 <= 阅读全文

摘要： Maximum Strictly Increasing Cells in a Matrix Given a 1-indexed m x n integer matrix mat, you can select any cell in the matrix as your starting cell. 阅读全文