ATCoder Beginner Contest 281

最新推荐文章于 2024-05-22 23:16:34 发布

fddwd

最新推荐文章于 2024-05-22 23:16:34 发布

阅读量234

点赞数 1

分类专栏： ATcoder 文章标签：算法 c++

本文链接：https://blog.csdn.net/m0_74946315/article/details/128376507

版权

ATcoder 专栏收录该内容

8 篇文章 1 订阅

订阅专栏

ATCoder Beginner Contest 281

A - Count Down

Problem Statement

Print all non-negative integers less than or equal to $N$ in descending order.

Constraints

$\leq N \leq 100$
$N$ is an integer.

Input

The input is given from Standard Input in the following format:

$N$

Output

Print $X$ lines, where $X$ is the number of non-negative integers less than or equal to $N$ .
For each $\ldots, X$ , the $i$ -th line should contain the $i$ -th greatest non-negative integer less than or equal to $N$ .

Sample Input 1

Sample Output 1

We have four non-negative integers less than or equal to $3$ , which are $0$ , $1$ , $2$ , and $3$ .
To print them in descending order, print $3$ in the first line, $2$ in the second, $1$ in the third, and $0$ in the fourth.

Sample Input 2

Sample Output 2

题目大意：

给出一个正整数 $N$ ，要求输出 $N$ 到 $0$ 。

分析：

直接输出。

#include<bits/stdc++.h>
using namespace std;
int n;
int main(){
	cin>>n;
	for(int i=n;i>=0;--i)
		cout<<i<<endl;
	return 0;
}

B - Sandwich Number

Problem Statement

You are given a string $S$ consisting of uppercase English letters and digits. Determine whether $S$ satisfies the following condition.

$S$ is a concatenation of the following characters and string in the order listed.
- An uppercase English letter
- A string of length $6$ that is a decimal representation of an integer between $100000$ and $999999$ , inclusive
- An uppercase English letter

Constraints

$S$ consists of uppercase English letters and digits.
The length of $S$ is between $1$ and $10$ , inclusive.

Input

The input is given from Standard Input in the following format:

$S$

Output

If $S$ satisfies the condition in the problem statement, print Yes; otherwise, print No.

Sample Input 1

Q142857Z

Sample Output 1

Yes

SS is a concatenation of Q, 142857, and Z in this order.
Q and Z are uppercase English letters, and 142857 is a string of length $6$ that is a decimal representation of an integer between $100000$ and $999999$ , so $S$ satisfies the condition.

Sample Input 2

AB912278C

Sample Output 2

No

AB is not an uppercase English letter, so $S$ does not satisfy the condition.

Sample Input 3

X900000

Sample Output 3

No

The last character of $S$ is not an uppercase English letter, so $S$ does not satisfy the condition.

Sample Input 4

K012345K

Sample Output 4

No

012345 is not a string of length $6$ that is a decimal representation of an integer between $100000$ and $999999$ , so $S$ does not satisfy the condition.

题目大意：

给定一个字符串，需满足下列条件：

字符串长度为 $8$ 。
首位是大写字母。
$\sim 7$ 位可以组成一个六位数。（注意六位数首位不能为 $0$ ）
末位是大写字母。

判断给定的字符串是否满足要求。

分析：

判断。（下面的有点丑）

#include<bits/stdc++.h>
using namespace std;
string s;
bool check(char ch){
	return 'A'<=ch&&ch<='Z';//判断是否是大写字母
}
int main(){
	cin>>s;
	if(s.length()!=8)
		cout<<"No"<<endl;
	else{
		if(check(s[0])){//首位为大写字母
			if(check(s[1]))//第二位为数字
				cout<<"No"<<endl;
			else{
				if(s[1]=='0')//第二位不为0
					cout<<"No"<<endl;
				else{
					if(check(s[7])){//末位为大写字母
						bool flag=false;
						for(int i=1;i<=6;++i)
							if(check(s[i]))
								flag=true;
						if(flag)//中六位为数字
							cout<<"No"<<endl;
						else
							cout<<"Yes"<<endl;
					}else
						cout<<"No"<<endl;
				}
			}
		}else
			cout<<"No"<<endl;
	}
	return 0;
}

C - Circular Playlist

Problem Statement

We have a playlist with NN songs numbered $\dots, N$ .
Song $i$ lasts $A_i$ seconds.

When the playlist is played, song $1$ , song $2$ , $\ldots…$ , and song $N$ play in this order. When song $N$ ends, the playlist repeats itself, starting from song $1$ again. While a song is playing, the next song does not play; when a song ends, the next song starts immediately.

At exactly $T$ seconds after the playlist starts playing, which song is playing? Also, how many seconds have passed since the start of that song?
There is no input where the playlist changes songs at exactly $T$ seconds after it starts playing.

Constraints

$\leq N \leq 10^5$
$\leq T \leq 10^{18}$
$\leq A_i \leq 10^9$
The playlist does not change songs at exactly $T$ seconds after it starts playing.
All values in the input are integers.

Input

The input is given from Standard Input in the following format:

$N$ $T$

$A_1$ $\ldots$ $A_N$

Output

Print an integer representing the song that is playing at exactly $T$ seconds after the playlist starts playing, and an integer representing the number of seconds that have passed since the start of that song, separated by a space.

Sample Input 1

3 600
180 240 120

Sample Output 1

1 60

When the playlist is played, the following happens. (Assume that it starts playing at time $0$ .)

From time $0$ to time $180$ , song $1$ plays.
From time $180$ to time $420$ , song $2$ plays.
From time $420$ to time $540$ , song $3$ plays.
From time $540$ to time $720$ , song $1$ plays.
From time $720$ to time $960$ , song $2$ plays.
$\qquad\vdots$

At time $600$ , song $1$ is playing, and $60$ seconds have passed since the start of that song.

Sample Input 2

3 281
94 94 94

Sample Output 2

3 93

Sample Input 3

10 5678912340
1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000

Sample Output 3

6 678912340

题目大意：

给定 $n$ 首歌曲，每首歌的时间是 $a_i$ 秒。从 $a_1$ 开始循环播放（ $a_1 \to \cdots \to a_n \to a_1 \to \cdots$ ）。

求 $T$ 秒后正在播哪首曲子，同时已经播了多长时间。

分析：

取模。

#include<bits/stdc++.h>
using namespace std;
#define MAXN 100010
#define ll long long
int n;
ll t,a[MAXN];
int main(){
	cin>>n>>t;
	for(int i=1;i<=n;++i)
		cin>>a[i],a[i]+=a[i-1];
	t%=a[n];
	for(int i=1;i<=n;++i)
		if(t<=a[i]){
			cout<<i<<" "<<t-a[i-1]<<endl;
			break;
		}
	return 0;
}

D - Max Multiple

Problem Statement

You are given a sequence of non-negative integers $A=(a_1,a_2,\ldots,a_N)$ .

Let $S$ be the set of non-negative integers that can be the sum of $K$ terms in $A$ (with distinct indices).

Find the greatest multiple of $D$ in $S$ . If there is no multiple of $D$ in $S$ , print -1 instead.

Constraints

$\leq K \leq N \leq 100$
$\leq D \leq 100$
$\leq a_i \leq 10^9$
All values in the input are integers.

Input

The input is given from Standard Input in the following format:

$N$ $K$ $D$

$a_1$ $\ldots$ $a_N$

Output

Print the answer.

Sample Input 1

4 2 2
1 2 3 4

Sample Output 1

Here are all the ways to choose two terms in $A$ .

Choose $a_1$ and $a_2$ , whose sum is $1 + 2 = 3$ .
Choose $a_1$ and $a_3$ , whose sum is $1 + 3 = 4$ .
Choose $a_1$ and $a_4$ , whose sum is $1 + 4 = 5$ .
Choose $a_2$ and $a_3$ , whose sum is $2 + 3 = 5$ .
Choose $a_2$ and $a_4$ , whose sum is $2 + 4 = 6$ .
Choose $a_3$ and $a_4$ , whose sum is $3 + 4 = 7$ .

Thus, we have $S=\{3,4,5,6,7\}$ . The greatest multiple of $2$ in $S$ is $6$ , so you should print $6$ .

Sample Input 2

3 1 2
1 3 5

Sample Output 2

-1

In this example, we have $S=\{1,3,5\}$ . Nothing in $S$ is a multiple of $2$ , so you should print -1.

题目大意：

给定 $n$ 个数。现在可以从中选 $k$ 个数，需满足他们的和为 $d$ 的倍数。求最大和值。

分析：

日常前三红题第四黄题。

动规，参数一为 $i d$ ，参数二为“当前已经选择了多少个数”（不包括自己），参数三为“所需要的余数”（详见代码）。

二进制枚举:

$14/29$

#include<bits/stdc++.h>
using namespace std;
#define ll long long
int k,n,d;
ll a[105];
int main(){
	cin>>n>>k>>d;
	for(int i=1;i<=n;++i)
		cin>>a[i];
	ll ans=-1;
	bool vh[105];
	memset(vh,false,sizeof(vh));
	for(int i=n-k+1;i<=n;++i)
		vh[i]=true;
	do{
		ll x=0;
		for(int i=1;i<=n;++i)
			if(vh[i])
				x+=a[i];
		if(x%d==0)
			ans=max(ans,x);
	}while(next_permutation(vh+1,vh+1+n));
	cout<<ans<<endl;
	return 0;
}

动规：

#include<bits/stdc++.h>
using namespace std;
#define ll long long
int n,k,d,a[105];
ll dp[105][105][105];
ll dfs(int id,int al,int re){
	if(al==k){//已经选完了
		if(re==0)//如果正好找到结束点re==0的，则表明结果是d的倍数
			return 0;
		return -1;//返回-1表示“此路不通”
	}if(id+k-al-1>n)//超出范围了，则返回-1
		return -1;
	if(dp[id][al][re]!=-2)
		return dp[id][al][re];
	ll v1=dfs(id+1,al,re);//如果不选自己
	ll v2=dfs(id+1,al+1,((re-a[id])%d+d)%d);//选了自己，则下一个数所需要的余数为((re-a[id])%d+d)%d
	if(v1==-1){//不选自己“此路不通”
		if(v2==-1)//选了自己还是“此路不通”
			return dp[id][al][re]=-1;//整个“此路不通”
		else//选了自己“可行”
			return dp[id][al][re]=v2+a[id];//记得加上自己a[id]
	}else{//不选自己“可行”
		if(v2==-1)//选了自己"此路不通"
			return dp[id][al][re]=v1;//返回不选自己的v1
		else//选了自己也是"可行"
			return dp[id][al][re]=max(v1,v2+a[id]);//返回两者较大的一个
	}
}
int main(){
	cin>>n>>k>>d;
	for(int i=1;i<=n;++i)
		cin>>a[i];
	for(int i=1;i<=n;++i)
	for(int j=0;j<=k;++j)
	for(int l=0;l<d;++l)
		dp[i][j][l]=-2;//初始化为-2
	cout<<dfs(1,0,0)<<endl;//输出
	return 0;
}

E - Least Elements

Problem Statement

You are given an integer sequence $(A_1, \dots, A_N)$ of length $N$ , and integers $M$ and $K$ .
For each $\dots, N - M + 1$ , solve the following independent problem.

Find the sum of the first $K$ values in the sorted list of the $M$ integers $A_i, A_{i + 1}, \dots, A_{i + M - 1}$ in ascending order.

Constraints

$\leq K \leq M \leq N \leq 2 \times 10^5$
$\leq A_i \leq 10^9$
All values in the input are integers.

Input

The input is given from Standard Input in the following format:

$N$ $M$ $K$

$A_1$ $A_2$ $\ldots$ $A_N$

Output

Let $\mathrm{answer}_k$ be the answer to the problem for $i = k$ , and print them in the following format:

$\mathrm{answer}_1$ $\mathrm{answer}_2$ $\ldots$ $\mathrm{answer}_{N-M+1}$

Sample Input 1

6 4 3
3 1 4 1 5 9

Sample Output 1

5 6 10

For $i = 1$ , sorting $A_i, A_{i+1}, A_{i+2}, A_{i+3}$ in ascending order yields $1, 1, 3, 4$ , where the sum of the first three values is $5$ .
For $i = 2$ , sorting $A_i, A_{i+1}, A_{i+2}, A_{i+3}$ in ascending order yields $1, 1, 4, 5$ , where the sum of the first three values is $6$ .
For $i = 3$ , sorting $A_i, A_{i+1}, A_{i+2}, A_{i+3}$ in ascending order yields $1, 4, 5, 9$ , where the sum of the first three values is $10$ .

Sample Input 2

10 6 3
12 2 17 11 19 8 4 3 6 20

Sample Output 2

21 14 15 13 13

题目大意：

给定一个序列 $A$ ，对于每个 $\le i \le N - M + 1$ ，将 $A_i A_{i + 1} \cdots A_{i + M - 1}$ 从小到大排序后（不影响原序列），求出 $\mathrm{ans}_i = \sum\limits_{i=1}^{K}$ 。

分析：

nth硬核找

$O(n^2logn),8/21$

#include<bits/stdc++.h>
using namespace std;
#define MAXN 200010
#define ll long long
int n,m,k,a[MAXN];
ll ans;
int main(){
	cin>>n>>m>>k;
	for(int i=1;i<=n;++i)
		cin>>a[i];
	int t[m+1];
	for(int i=1;i<=n-m+1;++i){
		ans=0;
		for(int j=i;j<=i+m-1;++j)
			t[j-i+1]=a[j];
		nth_element(t+1,t+k,t+m+1);
		for(int j=1;j<=k;++j)
			ans+=t[j];
		cout<<ans<<" ";
	}cout<<endl;
	return 0;
}

multiset硬核找

$11/21$

#include<bits/stdc++.h>
using namespace std;
#define MAXN 200010
#define ll long long
int n,m,k,a[MAXN];
multiset<int>seq;
int main(){
	cin>>n>>m>>k;
	for(int i=1;i<=n;++i)
		cin>>a[i];
	for(int i=0;i<m;++i)
		seq.insert(a[i]);
	for(int i=1;i<=n-m+1;++i){
		seq.erase(seq.find(a[i-1]));
		seq.insert(a[i+m-1]);
		ll ans=0;
		int j=0;
		multiset<int>::iterator it=seq.begin();
		while(++j<=k){
			ans+=*it;
			++it;
		}cout<<ans<<" ";
	}cout<<endl;
	return 0;
}

双multiset不清空查找

一开始试图用一个整体 $(i\sim i+m-1)$ 一个局部 $(i\sim i+k-1)$ 的集合，但是就是做不出来（渣）。

后来用两个局部的集合很快就做出来了 ~~（0.5s就做出来了，你说效率高不高）~~ 。

#include<bits/stdc++.h>
using namespace std;
#define MAXN 200010
#define ll long long
int k,m,n,a[MAXN];
ll ans=0;
multiset<int>Le,El;//其实是从题目"Least Elements"中截下来的，看上去舒服（咳）
int main(){
	cin>>n>>m>>k;
	for(int i=1;i<=n;++i)
		cin>>a[i];
	int b[m+1];
	for(int i=1;i<=m;++i)
		b[i]=a[i];
	sort(b+1,b+1+m);
	for(int i=1;i<=k;++i)//先把最先的做出来
		Le.insert(b[i]),ans+=b[i];//Le集合表示(i~(i+k-1))的数
	for(int i=k+1;i<=m;++i)//先把最先的做出来
		El.insert(b[i]);//El集合表示(i~(i+m-1))中除去Le的部分数
	cout<<ans<<" ";
	for(int i=2;i<=n-m+1;++i){//a[i-1]是整个里面需要删除的，a[i+m-1]是需要添加的
		if(El.find(a[i-1])!=El.end())//如果要删除的数在“非”部分能找到，则删El的
			El.erase(El.find(a[i-1]));
		else//如果找不到，则在“ans范围”内，删除Le的
			Le.erase(Le.find(a[i-1])),ans-=a[i-1];//tips:"对Le增减时，ans也要同时增减"
		if(Le.size()==0||a[i+m-1]>*Le.rbegin())//如果ans部分没数||要插入的数比ans部分的每个数都大，插入El中
			El.insert(a[i+m-1]);
		else//如果a[i+m-1]不大于ans中的最大数，则插入Le中
			Le.insert(a[i+m-1]),ans+=a[i+m-1];
		if(Le.size()>k){//如果Le超量，则尾巴放到El中
			int x=*Le.rbegin();
			Le.erase(--Le.end());
			El.insert(x);
			ans-=x;
		}if(Le.size()<k){//如果Le缺了，则El的头放到Le中
			int x=*El.begin();
			El.erase(El.begin());
			Le.insert(x);
			ans+=x;
		}cout<<ans<<" ";
	}
	return 0;
}