Rotate Columns (hard version)
This is a harder version of the problem. The difference is only in constraints. You are given a rectangular $n \times m$ matrix $a$. In […]
Hard Version
Optimal Subsequences (Hard Version)
This is the harder version of the problem. In this version, $1 \le n, m \le 2\cdot10^5$. You can hack this problem if you locked […]
Wrong Answer on Test 233 (Hard Version)
This is the harder version of the problem. In this version, $1 \le n \le 2\cdot10^5$. You can hack this problem if you locked it. […]
Beautiful Bracket Sequence (hard version)
This is the hard version of this problem. The only difference is the limit of $n$ – the length of the input string. In this […]
Coffee Varieties (hard version)
This is the hard version of the problem. You can find the easy version in the Div. 2 contest. Both versions only differ in the […]
Prefix-Suffix Palindrome (Hard version)
This is the hard version of the problem. The difference is the constraint on the sum of lengths of strings and the number of test […]
Wise Men (Hard Version)
This is the hard version of the problem. The difference is constraints on the number of wise men and the time limit. You can make […]
