Codeforces Round 957 (Div. 3)

🚀欢迎来到本文🚀
🍉个人简介：陈童学哦，彩笔ACMer一枚。
🏀所属专栏：Codeforces
本文用于记录回顾总结个人的一些解题思路便于加深理解。

A. Only Pluses

Kmes has written three integers $a$, $b$ and $c$ in order to remember that he has to give Noobish_Monk $a\times b\times c$ bananas.

Noobish_Monk has found these integers and decided to do the following at most $5$ times:

• pick one of these integers;
• increase it by $1$.

For example, if $a=2$, $b=3$ and $c=4$, then one can increase $a$ three times by one and increase $b$ two times. After that $a=5$, $b=5$, $c=4$. Then the total number of bananas will be $5\times 5\times 4=100$.

What is the maximum value of $a\times b\times c$ Noobish_Monk can achieve with these operations?

Input

Each test contains multiple test cases. The first line of input contains a single integer $t$ ($1\le t\le 1000$) — the number of test cases. The description of the test cases follows.

The first and only line of each test case contains three integers $a$, $b$ and $c$ ($1\le a,b,c\le 10$) — Kmes’s integers.

Output

For each test case, output a single integer — the maximum amount of bananas Noobish_Monk can get.

解题思路

暴力枚举即可。

AC代码

#include<bits/stdc++.h>
#define look(x) cout << #x << " ==  " << x << "\n"
using namespace std;
using i64 = long long;
const int N = 5e5 + 10;
const int MOD1 = 1e9 + 7;
const int MOD2 = 998244353;

void solve(){
	int a,b,c;
	cin >> a >> b >> c;
	int ans = a * b * c;
	for(int i = 0;i <= 5;i ++){
		for(int j = 0;j <= 5;j ++){
			for(int k = 0;k <= 5;k ++){
				if(i + j + k <= 5){
					ans = max(ans,(a + i) * (b + j) * (c + k));
				}
			}
		}
	}	
	cout << ans << "\n";
}
int main(){	

	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	
	int t = 1;
	cin >> t;

	while(t --){
		solve();
	}
	
	return 0;
}

B. Angry Monk

To celebrate his recovery, k1o0n has baked an enormous $n$ metres long potato casserole.

Turns out, Noobish_Monk just can’t stand potatoes, so he decided to ruin k1o0n’s meal. He has cut it into $k$ pieces, of lengths $a_1,a_2,\dots ,a_k$ meters.

k1o0n wasn’t keen on that. Luckily, everything can be fixed. In order to do that, k1o0n can do one of the following operations:

• Pick a piece with length $a_i\ge 2$ and divide it into two pieces with lengths $1$ and $a_i-1$. As a result, the number of pieces will increase by $1$;
• Pick a slice $a_i$ and another slice with length $a_j=1$ ($i\ne j$) and merge them into one piece with length $a_i+1$. As a result, the number of pieces will decrease by $1$.

Help k1o0n to find the minimum number of operations he needs to do in order to merge the casserole into one piece with length $n$.

For example, if $n=5$, $k=2$ and $a=[3,2]$, it is optimal to do the following:

1. Divide the piece with length $2$ into two pieces with lengths $2-1=1$ and $1$, as a result $a=[3,1,1]$.
2. Merge the piece with length $3$ and the piece with length $1$, as a result $a=[4,1]$.
3. Merge the piece with length $4$ and the piece with length $1$, as a result $a=[5]$.

Input

Each test contains multiple test cases. The first line contains the number of test cases $t$ ($1\le t\le 10^4$).

Description of each test case consists of two lines. The first line contains two integers $n$ and $k$ ($2\le n\le 10^9$, $2\le k\le 10^5$) — length of casserole and the number of pieces.

The second line contains $k$ integers $a_1,a_2,\dots ,a_k$ ($1\le a_i\le n-1$, $\sum a_i=n$) — lengths of pieces of casserole, which Noobish_Monk has cut.

It is guaranteed that the sum of $k$ over all $t$ test cases doesn’t exceed $2\cdot 10^5$.

Output

For each test case, output the minimum number of operations K1o0n needs to restore his pie after the terror of Noobish_Monk.

解题思路

我们可以贪心的去处理，因为最终所有的土豆块要合成一块，那么我们肯定会把更小的土豆都合并到最大的那块上去。
而小的土豆块要与最大的土豆块合并的时必须先拆成长度全为1的土豆块，那么每个土豆块分解的这个操作的贡献就是$a[i]-1$了，然后我们还需要把这些分解出来1合并到最大的土豆块上去，这个操作的贡献就是$a[i]$了，所以一个土豆块合并到最大的土豆块上的总贡献就是$2a[i]-1$了。

AC代码

#include<bits/stdc++.h>
#define look(x) cout << #x << " ==  " << x << "\n"
using namespace std;
using i64 = long long;
const int N = 5e5 + 10;
const int MOD1 = 1e9 + 7;
const int MOD2 = 998244353;

void solve(){
	int n,k;
	cin >> n >> k;
	vector<int> a(k + 1);
	int ans = 0;
	for(int i = 1;i <= k;i ++){
		cin >> a[i];
	}
	sort(a.begin() + 1,a.end());
	for(int i = 1;i < k;i ++){
		if(a[i] != 1){
			ans += (2  * a[i] - 1);
		}else{
			ans ++;
		}
	}
	
	cout << ans << "\n";
	
}
int main(){	

	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	
	int t = 1;
	cin >> t;

	while(t --){
		solve();
	}
	
	return 0;
}

C. Gorilla and Permutation

Gorilla and Noobish_Monk found three numbers $n$, $m$, and $k$ (KaTeX parse error: Expected 'EOF', got '&' at position 3: m &̲lt; k). They decided to construct a permutation${}^{†}$ of length $n$.

For the permutation, Noobish_Monk came up with the following function: $g(i)$ is the sum of all the numbers in the permutation on a prefix of length $i$ that are not greater than $m$. Similarly, Gorilla came up with the function $f$, where $f(i)$ is the sum of all the numbers in the permutation on a prefix of length $i$ that are not less than $k$. A prefix of length $i$ is a subarray consisting of the first $i$ elements of the original array.

For example, if $n=5$, $m=2$, $k=5$, and the permutation is $[5,3,4,1,2]$, then:

• $f(1)=5$, because $5\ge 5$; $g(1)=0$, because KaTeX parse error: Expected 'EOF', got '&' at position 3: 5 &̲gt; 2;
• $f(2)=5$, because KaTeX parse error: Expected 'EOF', got '&' at position 3: 3 &̲lt; 5; $g(2)=0$, because KaTeX parse error: Expected 'EOF', got '&' at position 3: 3 &̲gt; 2;
• $f(3)=5$, because KaTeX parse error: Expected 'EOF', got '&' at position 3: 4 &̲lt; 5; $g(3)=0$, because KaTeX parse error: Expected 'EOF', got '&' at position 3: 4 &̲gt; 2;
• $f(4)=5$, because KaTeX parse error: Expected 'EOF', got '&' at position 3: 1 &̲lt; 5; $g(4)=1$, because $1\le 2$;
• $f(5)=5$, because KaTeX parse error: Expected 'EOF', got '&' at position 3: 2 &̲lt; 5; $g(5)=1+2=3$, because $2\le 2$.

Help them find a permutation for which the value of $\left({\sum }_{i=1}^{n}f(i)-{\sum }_{i=1}^{n}g(i)\right)$ is maximized.

${}^{†}$A permutation of length $n$ is an array consisting of $n$ distinct integers from $1$ to $n$ in any order. For example, $[2,3,1,5,4]$ is a permutation, but $[1,2,2]$ is not a permutation (as $2$ appears twice in the array) and $[1,3,4]$ is also not a permutation (as $n=3$, but $4$ appears in the array).

Input

The first line contains a single integer $t$ ($1\le t\le 10^4$) — the number of test cases.

The only line of each case contains three integers $n$, $m$, $k$ ($2\le n\le 10^5$; KaTeX parse error: Expected 'EOF', got '&' at position 9: 1 \le m &̲lt; k \le n) — the size of the permutation to be constructed and two integers.

It is guaranteed that the sum of $n$ over all test cases does not exceed $2\cdot 10^5$.

Output

For each test case, output the permutation — a set of numbers that satisfies the conditions of the problem. If there are multiple solutions, output any of them.

解题思路

要构造一个排列使得 $\left({\sum }_{i=1}^{n}f(i)-{\sum }_{i=1}^{n}g(i)\right)$ ，那么我们可以先从大到小输出$k$到$n$之间的数，因为这样的一个过程中$g(i)$的始终为0，且$f(i)$的和最大。

然后输出$m+1$到$k-1$之间的数，这里的顺序无所谓，因为对于$f(i)$和$g(i)$都没有影响。
最后从小到大输出$1$到$m$之间的数即可。因为这样的可以使得$g(i)$的和最小，结果就最大。

AC代码

#include<bits/stdc++.h>
#define look(x) cout << #x << " ==  " << x << "\n"
using namespace std;
using i64 = long long;
const int N = 5e5 + 10;
const int MOD1 = 1e9 + 7;
const int MOD2 = 998244353;

void solve(){
	int n,m,k;
	cin >> n >> m >> k;
	for(int i = n;i >= k;i --){
		cout << i << " ";
	}	
	for(int i = m + 1;i < k;i ++){
		cout << i << " ";
	}
	for(int i = 1;i <= m;i ++){
		cout << i << " ";
	}
	cout << "\n";
}
int main(){	

	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	
	int t = 1;
	cin >> t;

	while(t --){
		solve();
	}
	
	return 0;
}

D. Test of Love

ErnKor is ready to do anything for Julen, even to swim through crocodile-infested swamps. We decided to test this love. ErnKor will have to swim across a river with a width of $1$ meter and a length of $n$ meters.

The river is very cold. Therefore, in total (that is, throughout the entire swim from $0$ to $n+1$) ErnKor can swim in the water for no more than $k$ meters. For the sake of humanity, we have added not only crocodiles to the river, but also logs on which he can jump. Our test is as follows:

Initially, ErnKor is on the left bank and needs to reach the right bank. They are located at the $0$ and $n+1$ meters respectively. The river can be represented as $n$ segments, each with a length of $1$ meter. Each segment contains either a log ‘L’, a crocodile ‘C’, or just water ‘W’. ErnKor can move as follows:

• If he is on the surface (i.e., on the bank or on a log), he can jump forward for no more than $m$ ($1\le m\le 10$) meters (he can jump on the bank, on a log, or in the water).
• If he is in the water, he can only swim to the next river segment (or to the bank if he is at the $n$-th meter).
• ErnKor cannot land in a segment with a crocodile in any way.

Determine if ErnKor can reach the right bank.

Input

The first line contains a single integer $t$ ($1\le t\le 10^4$) — the number of test cases.

The first line of each test case contains three numbers $n,m,k$ ($0\le k\le 2\cdot 10^5$, $1\le n\le 2\cdot 10^5$, $1\le m\le 10$) — the length of the river, the distance ErnKor can jump, and the number of meters ErnKor can swim without freezing.

The second line of each test case contains a string $a$ of length $n$. $a_i$ denotes the object located at the $i$-th meter. ( a i ∈ { a_i \in \{ ai​∈{‘W’,‘C’,‘L’$\}$)

It is guaranteed that the sum of $n$ over all test cases does not exceed $2\cdot 10^5$.

Output

For each test case, output “YES” if ErnKor can pass the test, and output “NO” otherwise.

You can output the answer in any case (upper or lower). For example, the strings “yEs”, “yes”, “Yes”, and “YES” will be recognized as positive responses.

解题思路

考虑dp。$dp[i]$表示跳到第i个位置时需要游几米。
判断$dp[n+1]$是否大于k即可。

AC代码

#include<bits/stdc++.h>
#define look(x) cout << #x << " ==  " << x << "\n"
using namespace std;
using i64 = long long;
const int N = 2e5 + 10;
const int MOD1 = 1e9 + 7;
const int MOD2 = 998244353;

void solve(){
	int n,m,k;
	cin >> n >> m >> k;
	string s;
	cin >> s;
	s = 'L' + s + 'L';
	vector<int> dp(n + 10);
	for(int i = 1;i <= n + 1;i ++){
		dp[i] = 1e9;
	}	
	//第i个位置时的情况
	for(int i = 1;i <= n + 1;i ++){
		//从第i个位置的前面的位置转移状态
		//既不能大于目前所在位置，也不能大于能够跳跃的最大距离m
		for(int j = 1;j <= min(i,m);j ++){
			//如果只距离一格或者第i - j的位置是原木的话并且第i个位置不能有鳄鱼
			if((j == 1 || s[i - j] == 'L') && s[i] != 'C'){
				dp[i] = min(dp[i],dp[i - j] + (s[i] == 'W'));
			}
		}
	}
	if(dp[n + 1] > k){
		cout << "NO\n";
	}else{
		cout << "YES\n";
	}
}

int main(){	

	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	
	int t = 1;
	cin >> t;

	while(t --){
		solve();
	}
	
	return 0;
}

E. Novice’s Mistake

One of the first programming problems by K1o0n looked like this: “Noobish_Monk has $n$ $(1\le n\le 100)$ friends. Each of them gave him $a$ $(1\le a\le 10000)$ apples for his birthday. Delighted with such a gift, Noobish_Monk returned $b$ $(1\le b\le \min (10000,a\cdot n))$ apples to his friends. How many apples are left with Noobish_Monk?”

K1o0n wrote a solution, but accidentally considered the value of $n$ as a string, so the value of $n\cdot a-b$ was calculated differently. Specifically:

• when multiplying the string $n$ by the integer $a$, he will get the string $s=\underset{a\text{times}}{\underbrace{n+n+\cdots +n+n}}$
• when subtracting the integer $b$ from the string $s$, the last $b$ characters will be removed from it. If $b$ is greater than or equal to the length of the string $s$, it will become empty.

Learning about this, ErnKor became interested in how many pairs $(a,b)$ exist for a given $n$, satisfying the constraints of the problem, on which K1o0n’s solution gives the correct answer.

“The solution gives the correct answer” means that it outputs a non-empty string, and this string, when converted to an integer, equals the correct answer, i.e., the value of $n\cdot a-b$.

Input

The first line contains a single integer $t$ ($1\le t\le 100$) — the number of test cases.

For each test case, a single line of input contains an integer $n$ ($1\le n\le 100$).

It is guaranteed that in all test cases, $n$ is distinct.

Output

For each test case, output the answer in the following format:

In the first line, output the integer $x$ — the number of bad tests for the given $n$.

In the next $x$ lines, output two integers $a_i$ and $b_i$ — such integers that K1o0n’s solution on the test “$n$ $a_i$ $b_i$” gives the correct answer.

解题思路

要求不同计算方法下的$n\ast a-b$值相等的$a、b$的情况。
直接考虑字符串计算方式下的$n\ast a-b$好像不太好求，所以我们观察下数值计算下的$n\ast a-b$
$n<=100,a<=10000$，所以我们会发现$n\ast a$最大为1000000，那么$n\ast a-b$最大为1000000，因为b为正整数。
所以其实我们只需要考虑字符串下$n\ast a-b$长度小于7时与数值下$n\ast a-b$相等的情况即可。
因为数值下的$n\ast a-b$最多六位数，字符串下的$n\ast a-b$长度大于6的将无意义。

所以我们只需要枚举$a$的范围以及$b$的位数。

AC代码

#include<bits/stdc++.h>
#define look(x) cout << #x << " ==  " << x << "\n"
using namespace std;
using i64 = long long;
const int N = 2e5 + 10;
const int MOD1 = 1e9 + 7;
const int MOD2 = 998244353;

void solve(){
	int n;
	cin >> n;
	vector<pair<int,int>> ans;
	string s = to_string(n);
	//枚举a的范围
	for(int i = 1;i <= 10000;i ++){
		//字符串下n * a的长度
		int res = s.size() * i;
		string k = "";
		//取前6位数
		while(k.size() < 7){
			k += s;
		}
//		for(int j = max(1,res- 7);j <= min(10000,res);j ++){
//			
//			if(to_string(n * i - j) == k.substr(0,res - j)){
//				ans.push_back({i,j});
//			}	
//		}
		//枚举b的位数
		for(int j = 1;j <= 6;j ++){
			//res - j其实就是b，因为j是需要保留的位数，那么res - j
			//就是删除的位数，也就是b了。
			//还需要注意的就是所取的位数要小于字符串的长度。
			if(k.substr(0,j) == to_string(n * i - (res - j)) && res > j){
				ans.push_back({i,res - j});
			}
		}
	}
	cout << ans.size() << "\n";
	for(auto [x,y] : ans){
		cout << x << " " << y << "\n";
	}
}

int main(){	

	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	
	int t = 1;
	cin >> t;

	while(t --){
		solve();
	}
	
	return 0;
}

F. Valuable Cards

In his favorite cafe Kmes once again wanted to try the herring under a fur coat. Previously, it would not have been difficult for him to do this, but the cafe recently introduced a new purchasing policy.

Now, in order to make a purchase, Kmes needs to solve the following problem: $n$ cards with prices for different positions are laid out in front of him, on the $i$-th card there is an integer $a_i$, among these prices there is no whole positive integer $x$.

Kmes is asked to divide these cards into the minimum number of bad segments (so that each card belongs to exactly one segment). A segment is considered bad if it is impossible to select a subset of cards with a product equal to $x$. All segments, in which Kmes will divide the cards, must be bad.

Formally, the segment $(l,r)$ is bad if there are no indices KaTeX parse error: Expected 'EOF', got '&' at position 5: i_1 &̲lt; i_2 &lt; \l… such that $l\le i_1,i_k\le r$, and $a_{i_1}\cdot a_{i_2}\dots \cdot a_{i_k}=x$.

Help Kmes determine the minimum number of bad segments in order to enjoy his favorite dish.

Input

The first line contains a single integer $t$ ($1\le t\le 10^3$) — the number of test cases.

The first line of each set of input data gives you $2$ integers $n$ and $x$ ($1\le n\le 10^5,2\le x\le 10^5$) — the number of cards and the integer, respectively.

The second line of each set of input data contains $n$ integers $a_i$ ($1\le a_i\le 2\cdot 10^5,a_i\ne x$) — the prices on the cards.

It is guaranteed that the sum of $n$ over all sets of test data does not exceed $10^5$.

Output

For each set of input data, output the minimum number of bad segments.

解题思路

考虑从左往右贪心的去分段。
判断$a[i]$是否是$x$的因子，如果是话将$x/a[i]$丢在一个集合里，依次类推，如果这个集合里出现了$1$那么说明现在这个段已经无法成为坏段了，我们需要把现在的$a[i]$给单独分在另一个段里。

AC代码

#include<bits/stdc++.h>
#define look(x) cout << #x << " ==  " << x << "\n"
using namespace std;
using i64 = long long;
const int N = 2e5 + 10;
const int MOD1 = 1e9 + 7;
const int MOD2 = 998244353;

void solve(){
	int n,x;
	cin >> n >> x;
	vector<int> a(n + 1);
	for(int i = 1;i <= n;i ++){
		cin >> a[i];
	}
	set<int> st;
	//用set来去重
	st.insert(x);
	int ans = 1;
	for(int i = 1;i <= n;i ++){
		for(auto x : st){
			//丢因子。
			if(x % a[i] == 0){
				st.insert(x / a[i]);
			}
		}
		//存在1说明现在这个数a[i]使得段无法成为坏段
		if(st.find(1) != st.end()){
			//段数加1
			ans ++;
			st.clear();
			st.insert(x);
			st.insert(x / a[i]);
		}
	}
	cout << ans << "\n";
}

int main(){	

	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	
	int t = 1;
	cin >> t;

	while(t --){
		solve();
	}
	
	return 0;
}

G. Ultra-Meow

K1o0n gave you an array $a$ of length $n$, consisting of numbers $1,2,\dots ,n$. Accept it? Of course! But what to do with it? Of course, calculate $\text{MEOW}(a)$.

Let $\text{MEX}(S,k)$ be the $k$-th positive (strictly greater than zero) integer in ascending order that is not present in the set $S$. Denote $\text{MEOW}(a)$ as the sum of $\text{MEX}(b,|b|+1)$, over all distinct subsets $b$ of the array $a$.

Examples of $\text{MEX}(S,k)$ values for sets:

• MEX ( { 3 , 2 } , 1 ) = 1 \text{MEX}(\{3,2\}, 1) = 1 MEX({3,2},1)=1, because $1$ is the first positive integer not present in the set;
• MEX ( { 4 , 2 , 1 } , 2 ) = 5 \text{MEX}(\{4,2,1\}, 2) = 5 MEX({4,2,1},2)=5, because the first two positive integers not present in the set are $3$ and $5$;
• MEX ( { } , 4 ) = 4 \text{MEX}(\{\}, 4) = 4 MEX({},4)=4, because there are no numbers in the empty set, so the first $4$ positive integers not present in it are $1,2,3,4$.

Input

The first line contains a single integer $t$ ($1\le t\le 10^4$) — the number of test cases.

In a single line of each test case, an integer $n$ ($1\le n\le 5000$) is entered, the size of the array of gifted numbers.

It is guaranteed that the sum of $n^2$ over all test cases does not exceed $25\cdot 10^6$.

Output

For each test case, output a single number — $\text{MEOW}(a)$. Since it may be very large, output it modulo $10^9+7$.

解题思路

$待补$

AC代码