Codeforces Round #555 (Div. 3) ABC1C2DE题解

最新推荐文章于 2020-11-18 19:50:27 发布
最新推荐文章于 2020-11-18 19:50:27 发布
阅读量314 收藏
点赞数
分类专栏： codeforces
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/qq_41410799/article/details/89601911
版权

比赛链接：

http://codeforces.com/contest/1157

A. Reachable Numbers

模拟，用个vis记录下是否被访问就可以了

代码如下：

//include <bits/stdc++.h>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <stack>
#include <time.h>
#include <vector>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll MOD =  10007;
const int maxn = 1e3+5;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;
template <class T>
inline bool scan_d(T &ret) {
	char c; int sgn;
	if (c = getchar(), c == EOF) return 0;
	while (c != '-' && (c<'0' || c>'9')) c = getchar();
	sgn = (c == '-') ? -1 : 1;
	ret = (c == '-') ? 0 : (c - '0');
	while (c = getchar(), c >= '0'&&c <= '9') ret = ret * 10 + (c - '0');
	ret *= sgn;
	return 1;
}
ll n;
map<ll,int>ma;
int main()
{
    scanf("%lld",&n);
    int num=1;
    stack<ll>s;
    s.push(n);
    ma[n]=1;
    while(!s.empty())
    {
        ll t=s.top();
        s.pop();
        t++;
        while(t%10==0)
        {
            t/=10;
        }
        if(ma[t]==0)
        {
            ma[t]=1;
            s.push(t);
            num++;
        }
    }
    printf("%d\n",num);
	return 0;
}

B. Long Number 

模拟，找到第一个f(x)>x的数，然后遍历下去，直到f(x)<x的数为止。

代码如下：

//include <bits/stdc++.h>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <stack>
#include <time.h>
#include <vector>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll MOD =  10007;
const int maxn = 2*1e5+5;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;
template <class T>
inline bool scan_d(T &ret) {
	char c; int sgn;
	if (c = getchar(), c == EOF) return 0;
	while (c != '-' && (c<'0' || c>'9')) c = getchar();
	sgn = (c == '-') ? -1 : 1;
	ret = (c == '-') ? 0 : (c - '0');
	while (c = getchar(), c >= '0'&&c <= '9') ret = ret * 10 + (c - '0');
	ret *= sgn;
	return 1;
}
char a[maxn];
int n;
int f[15];
int main()
{
    scanf("%d",&n);
    scanf("%s",a);
    for (int i=1;i<=9;i++)
    {
        scanf("%d",&f[i]);
    }
    int st=0,ok=1;
    while(a[st]>=(f[a[st]-'0']+'0')&&st<n)
    {
        st++;
    }
    while(a[st]<=(f[a[st]-'0']+'0')&&st<n)
    {

        a[st]=(f[a[st]-'0']+'0');st++;
    }
    printf("%s\n",a);
	return 0;
}

C1. Increasing Subsequence (easy version)

贪心，如果左右两个数都比之前的数大，则找两个中较小的，如果两个数都小于之前的数则跳出，否则找其中较大的一个。

代码如下：

//include <bits/stdc++.h>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <stack>
#include <time.h>
#include <vector>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll MOD =  10007;
const int maxn = 2*1e5+5;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;
template <class T>
inline bool scan_d(T &ret) {
	char c; int sgn;
	if (c = getchar(), c == EOF) return 0;
	while (c != '-' && (c<'0' || c>'9')) c = getchar();
	sgn = (c == '-') ? -1 : 1;
	ret = (c == '-') ? 0 : (c - '0');
	while (c = getchar(), c >= '0'&&c <= '9') ret = ret * 10 + (c - '0');
	ret *= sgn;
	return 1;
}
int n;
int a[maxn];
vector<char>ans;
int b[maxn];
int main()
{
    scanf("%d",&n);
    for (int i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
    }
    b[0]=0;
    int num=0;
    int i=1,j=n;
    while(i<=j)
    {
        if(max(a[i],a[j])<b[num])
        {
            break;
        }
        if((a[i]<a[j]&&a[i]>b[num])||a[j]<b[num])
        {
            ans.push_back('L');
            b[++num]=a[i];
            i++;
        }
        else
        {
            ans.push_back('R');
            b[++num]=a[j];
            j--;
        }
    }
    printf("%d\n",ans.size());
    for (int i=0;i<ans.size();i++)
    {
        printf("%c",ans[i]);
    }
    printf("\n");
	return 0;
}

C2. Increasing Subsequence (hard version)

这个题在之前的基础上加了出现相同的数字，还是按上一题的贪心策略，只不过遇到相等的数字的时候只能连续选一边的，看看哪一边连续递增序列最长即可。

代码如下：

//include <bits/stdc++.h>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <stack>
#include <time.h>
#include <vector>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll MOD =  10007;
const int maxn = 2*1e5+5;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;
template <class T>
inline bool scan_d(T &ret) {
	char c; int sgn;
	if (c = getchar(), c == EOF) return 0;
	while (c != '-' && (c<'0' || c>'9')) c = getchar();
	sgn = (c == '-') ? -1 : 1;
	ret = (c == '-') ? 0 : (c - '0');
	while (c = getchar(), c >= '0'&&c <= '9') ret = ret * 10 + (c - '0');
	ret *= sgn;
	return 1;
}
int n;
int a[maxn];
vector<char>ans;
int b[maxn];
int main()
{
    scanf("%d",&n);
    for (int i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
    }
    b[0]=0;
    int num=0;
    int i=1,j=n;
    int ok=0;
    while(i<=j)
    {
        if(max(a[i],a[j])<=b[num])
        {
            break;
        }
        if(a[i]==a[j]&&i!=j)
        {
            ok=1;
            break;
        }
        if((a[i]<a[j]&&a[i]>b[num])||a[j]<=b[num])
        {
            ans.push_back('L');
            b[++num]=a[i];
            i++;
        }
        else
        {
            ans.push_back('R');
            b[++num]=a[j];
            j--;
        }
    }
    if(ok)
    {
        int num1=0,num2=0;
        int ii=i,jj=j;
        int ti=b[num],tj=b[num];
        while(a[ii]>ti&&ii<j)
        {
            num1++;
            ti=a[ii];
            ii++;
        }
        while(a[jj]>tj&&jj>i)
        {
            num2++;
            tj=a[jj];
            jj--;
        }
        if(num1>num2)
        {
            for (int i=0;i<num1;i++) ans.push_back('L');
        }
        else
        {
            for (int i=0;i<num2;i++) ans.push_back('R');
        }
    }
    printf("%d\n",ans.size());
    for (int i=0;i<ans.size();i++)
    {
        printf("%c",ans[i]);
    }
    printf("\n");
	return 0;
}

D. N Problems During K Days

先判定是否大于等于最小的情况。

然后在最小的情况下均分k个数，即每个数加上(n-(k*(k+1)/2))%k，然后在贪心把n%k加到k个数中，从后面往前面贪，遇到后面的数小于前面数的2倍就加上数使其等于前一个的数的二倍，如果n%k消耗完则符合要求，如果消耗不完则输出NO

代码如下：

//include <bits/stdc++.h>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <stack>
#include <time.h>
#include <vector>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll MOD =  10007;
const int maxn = 2*1e5+5;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;
template <class T>
inline bool scan_d(T &ret) {
	char c; int sgn;
	if (c = getchar(), c == EOF) return 0;
	while (c != '-' && (c<'0' || c>'9')) c = getchar();
	sgn = (c == '-') ? -1 : 1;
	ret = (c == '-') ? 0 : (c - '0');
	while (c = getchar(), c >= '0'&&c <= '9') ret = ret * 10 + (c - '0');
	ret *= sgn;
	return 1;
}
ll k;
ll n;
ll ans[maxn];
int main()
{
    scanf("%lld%lld",&n,&k);
    if(n<k*(1+k)/2)
    {
        printf("NO\n");
        return 0;
    }
    n-=k*(1+k)/2;
    ll t=n/k;
    n=n%k;
    for (int i=1;i<=k;i++)
    {
        ans[i]=i+t;
    }
    for (int i=k-1;i>=1;i--)
    {
        if(n==0) break;
        if(ans[i]*2>ans[i+1])
        {
            ll cha=2*ans[i]-ans[i+1];
            if(n>=cha)
            {
                ans[i+1]+=cha;
                n-=cha;
            }
            else
            {
                ans[i+1]+=n;
                n=0;
            }
        }
    }
    if(n==0)
    {
        printf("YES\n");
        for (int i=1;i<=k;i++) printf("%lld ",ans[i]);
        printf("\n");
    }
    else
    {
        printf("NO\n");
    }
	return 0;
}

E. Minimum Array

此题可以用mutliset容器来做，将所有的b[i]压入mutliset中，然后求出啊a[i]中的最优解，然后二分查找大于等于这个最优解的位置，如果没有找到的话，则直接用首部元素，因为这时候首部元素是最优解，找到之后再删除这个元素。

代码如下：

//include <bits/stdc++.h>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <stack>
#include <time.h>
#include <vector>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll MOD =  10007;
const int maxn = 2*1e5+5;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;
template <class T>
inline bool scan_d(T &ret) {
	char c; int sgn;
	if (c = getchar(), c == EOF) return 0;
	while (c != '-' && (c<'0' || c>'9')) c = getchar();
	sgn = (c == '-') ? -1 : 1;
	ret = (c == '-') ? 0 : (c - '0');
	while (c = getchar(), c >= '0'&&c <= '9') ret = ret * 10 + (c - '0');
	ret *= sgn;
	return 1;
}
int n;
int a[maxn];
int b[maxn];
int ans[maxn];
multiset<int>st;
int main()
{
    scanf("%d",&n);
    for (int i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
    }
    for (int i=1;i<=n;i++)
    {
        scanf("%d",&b[i]);
        st.insert(b[i]);
    }
    for (int i=1;i<=n;i++)
    {
        multiset<int>::iterator it;
        int yu=(n-a[i])%n;
        it=st.lower_bound(yu);
        if(it==st.end())
        {
            it=st.begin();
            ans[i]=(a[i]+(*it))%n;
            st.erase(it);
        }
        else
        {
            ans[i]=(a[i]+(*it))%n;
            st.erase(it);
        }
    }
    for (int i=1;i<=n;i++)
    {
        printf("%d ",ans[i]);
    }
    printf("\n");
	return 0;
}

 

萧瑟1
关注
专栏目录
Codeforces Round #787 (Div. 3)个人题解
weixin_51767904的博客
05-06 1133
Codeforces Round #787 (Div. 3)个人题解 Codeforces Round #787 (Div. 3) A. Food for Animals B. Make It Increasing C. Detective Task D. Vertical Paths E. Replace With the Previous, Minimize F. Vlad and Unfinished Business G. Sorting Pancakes
Codeforces Round #834 (Div. 3) A~E题解
weixin_63927680的博客
11-19 1678
题目：D. Make It Round 题意： 给定一个n和m，k的取值范围在1~m,求出最大的n*k并满足有最多的末尾0。首先10 = 2*5,所以要有末尾0，首先必须出现2和5，所以我们先分解n，看一下n有多少个5，多少个2，假设n分解之后有4个2，1个5，它本身1个2和1个5相乘等于10，所以剩下3个2，那么此时，k就先补3个5，既5*5*5 = 125，如果此时k还没有超出范围的话，就继续乘10，如果乘10后超出范围了，就在1~9之间相乘，找到最大的那个k。如果k在补5的时候超出
CodeForces 1157D N Problems During K Days 构造 贪心
Focus5679的博客
04-28 376
D. N Problems During K Days time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Polycarp has to solve exactlynnproblems to improve h...
Codeforces 1157D N Problems During K Days
ytuyzh的博客
04-29 258
题目传送门 #include<iostream> #include<cmath> using namespace std; long long a[110000]; long long s(long long m) { return m*(m+1)/2; } int main() { int n,k; cin>>n>&gt...
Codeforces Round #555 (Div. 3) D. N Problems During K Days
二营长的意大利炮友
04-27 170
题目链接：https://codeforces.com/contest/1157/problem/D 题意：现在一个人k天要做n个题，做题规则如下： 他每天至少做一个题 今天做的题至少比昨天多1道 今天做的题不能超过昨天的两倍 你个他安排每天做多少题，不能符合以上规则输出“NO”。 解题思路： 总共nnn题kkk天，平均每天做n/kn/kn/k个题。 安排肯定是做题越平均越好啊，这样才明显不超...
C1. Increasing Subsequence (easy version)
qq_43691704的博客
04-28 364
Codeforces(div. 3) C1. Increasing Subsequence (easy version) The only difference between problems C1 and C2 is that all values in input of problem C1 are distinct (this condition may be false for prob...
Codeforces Round #661 (Div. 3) 题解
qq_46365538的博客
08-06 336
Codeforces Round #661 (Div. 3) A. Remove Smallest #include<bits/stdc++.h> using namespace std; #pragma GCC optimize(2) typedef long long ll; typedef unsigned long long ull; typedef long double ld; const int N=100; int t,n,a[N]; int main() {
Codeforces Round #684 (Div. 2) A - C2 题解
avgstuBoboge的博客
11-18 1036
Codeforces Round #684 (Div. 2) A - C2 题解 A Buy the String 题意 给定一个长度为 nnn 的01串，你可以用 hhh 的代价把字符串中任意一个字符取反，最终你要把这个01串买下来，0的单价为c0c_0c0​，1的单价为 c1c_1c1​。现给你n,h,c0,c1n,h,c_0,c_1n,h,c0​,c1​以及一个01串，问你最少花多少可以买下这个串。输出最小总价。 思路 贪心，设c0<c1c_0 \lt c_1c0​<c1​，若c1−c0
Codeforces Round #723 (Div. 2).md
10-13
Codeforces Round #723 (Div. 2).md
D. N Problems During K Days(常规构造写法详解)
jziwjxjd的博客
06-15 422
传送门 初始序列最小是以1开头的公差为1的等差数列 那么后续只需要在这个序列上修修补补就行了那么后续只需要在这个序列上修修补补就行了那么后续只需要在这个序列上修修补补就行了 现在给这个序列的每一项加上n/k,序列仍然合法\color{Red}现在给这个序列的每一项加上n/k,序列仍然合法现在给这个序列的每一项加上n/k,序列仍然合法 此时,你惊讶的发现此时n还剩n%k,是一定小于k的!!此时,你惊讶的发现此时n还剩n\%k,是一定小于k的!!此时,你惊讶的发现此时n还剩n%k,是一定小于k的!! 为了方便观
CodeForces 1157D N Problems During K Days （构造）
邵光亮的博客
11-22 202
\quadPolycarp has to solve exactly n problems to improve his programming skill before an important programming competition. But this competition will be held very soon, most precisely, it will start i...
Codeforces Round #555 (Div. 3)D. N Problems During K Days
微微风簇浪，散作满河星
04-28 439
D. N Problems During K Days time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Polycarp has to solve exactlynnproblems to improve h...
N Problems During K Days
无限迭代中......
04-27 482
https://codeforces.com/contest/1157/problem/D 题意：找到一个长度为k的元素大于0的数组，并且，整个数组的和等于n 题解：因为数组严格递增，数组最小和k*(k+1)/2，而i-n的最小和为(k-i+1)*(k-i+2)/2，对于这个公式可以加上一个首项，增加i-n的和，对第i个元素在i-n的和不应该大于剩下未分配的n，当然应该满足 /* *@Au...
CF 1157D N Problems During K Days
Falling into you
05-03 294
CF 1157D N Problems During K Days题目链接题面题目大意题目分析代码 题目链接 我是题目链接戳我呀>_< 题面 题目大意 Polycarp想要在 k 天做 n 道题，并且他希望每一天做的题量大于前一天的题量并且小于前一天题量的二倍。求是否可以满足条件，若满足，每天题量是多少。 题目分析 第 i 天至少做 i 道题才可以满足每一天的做题量大于前一天。如果...
[构造]D. N Problems During K Days
Zeolim的博客
05-08 337
Polycarp has to solve exactlynnproblems to improve his programming skill before an important programming competition. But this competition will be held very soon, most precisely, it will start ink...
codeforces1157D N Problems During K Days
ACoder
05-04 180
贪心小脑洞构造题
555 div3 D. N Problems During K Days*
weixin_30920513的博客
05-16 129
　　题意：给定n和k 判断是否能用一串长度为k的a来表示 a的和为n 且满足 a[i]<a[i+1] a[i+1]<=2*a[i] 显然是等差和等比的关系 注意特判 8 3 和4 2 时无解 然后从后往前补即可 #include<bits/stdc++.h> using namespace std; //input by bx...
codeforces round #828 (div. 3)
最新发布
06-06
好的，以下是关于Codeforces Round #828 (Div. 3)的一些信息： Codeforces Round #828 (Div. 3)是Codeforces网站上的一场编程竞赛，属于Div. 3级别的比赛。该比赛于2022年3月1日 15:35 (UTC)开始，比赛时长为2个...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值