Codeforces Round #619 (Div. 2) Feb/13/2020 22:35UTC+8

[比赛链接 Codeforces Round #619 (Div. 2)](Codeforces Round #619 (Div. 2))
比赛记录 https://blog.csdn.net/cheng__yu_/article/details/105395197

B. Motarack’s Birthday

题意：在 -1 的位置填数，使得最大的绝对值之差最小
思路：把与 -1 相连的所有数，拿出来取平均数

#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn=1e5+5,maxm=1e5+5;
const int mod=1e9+7,inf=0x7f7f7f7f;

int t,n;
int a[maxn];

int main()
{
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        for(int i=1;i<=n;++i)
            scanf("%d",&a[i]);
        int maxx=0,minn=1e9;
        for(int i=1;i<=n;++i)
        {
            if(a[i]==-1)
            {
                if(i-1>=1&&a[i-1]!=-1)
                    maxx=max(maxx,a[i-1]),minn=min(minn,a[i-1]);
                if(i+1<=n&&a[i+1]!=-1)
                    maxx=max(maxx,a[i+1]),minn=min(minn,a[i+1]);
            }
        }
        int k=(maxx+minn)/2;
        for(int i=1;i<=n;++i)
            if(a[i]==-1)
                a[i]=k;
        int ans=0;
        for(int i=2;i<=n;++i)
            ans=max(ans,abs(a[i]-a[i-1]));
        printf("%d %d\n",ans,k);
    }
	return 0;
}

C. Ayoub’s function

#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn=1e5+5,mod=1e9+7;
const int inf=0x3f3f3f3f;
ll t,n,m;

int main()
{
	cin>>t;
	while(t--)
	{
		cin>>n>>m;
		ll k=n-m;
		ll r=k%(m+1);
		ll x=k/(m+1);
		ll cnt1=r,cnt2=m+1-r;
		ll ans=cnt1*(x+1+1)*(x+1)/2+cnt2*(x+1)*x/2;
		ans=(n+1)*n/2-ans;
		cout<<ans<<"\n";
	} 
	return 0;
}

D. Time to Run（模拟）

#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn=2e5+10,inf=1e9;

int n,m,k;
vector<pair<int,string> >ans,v;

void add(int m,string s)
{
    ans.push_back({m,s});
}

int main()
{
    cin>>n>>m>>k;
    if(k>4*n*m-2*n-2*m)
    {
        puts("NO");
        return 0;
    }
    if(m==1)
    {
        puts("YES");
        string ans(n-1,'D');
        ans+=string(n-1,'U');
        cout<<k<<"\n";
        for(int i=0;i<k;++i)
        cout<<1<<" "<<ans[i]<<"\n";
        return 0;
    }
    if(n==1)
    {
        puts("YES");
        string ans(m-1,'R');
        ans+=string(m-1,'L');
        cout<<k<<"\n";
        for(int i=0;i<k;++i)
        cout<<1<<" "<<ans[i]<<"\n";
        return 0;
    }

    add(n-1,"D");
    for(int i=1;i<=n-1;++i)
    {
        add(m-1,"R");
        add(m-1,"UDL");
        add(1,"U");
    }
    add(m-1,"R");
    add(m-1,"L");

    puts("YES");
    int p=0;
    int n=ans.size();
    while(k>0&&p<n)
    {
        auto i=ans[p];
        int t=i.first;
        string s=i.second;
        int len=s.size();
        if(k>=t*len)
        {
            v.push_back({t,s});
            k-=t*len;
        }
        else
        {
            if(k/len!=0)
            v.push_back({k/len,s});
            if(k%len!=0)
            v.push_back({1,s.substr(0,k%len)});
            k=0;
        }
        p++;
    }
    cout<<v.size()<<"\n";
    for(auto i : v)
        cout<<i.first<<" "<<i.second<<"\n";
    return 0;
}

#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn=1e5+10;

struct Node
{
	int f;
	string s;
};

vector<Node> ans;

ll n,m,k;

void add(string s,int step)
{
	if(k==0||step==0)
		return;
	
	int len=s.size();
	if(k>=len*step)
	{
		k-=len*step;
		ans.push_back({step,s});
	}
	else
	{
		if(len==1)
		{
			ans.push_back({k,s});
			k=0;
		}	
		else
		{
			if(k>=3)
			{
				ans.push_back({k/len,s});
				k%=len;				
			}
			if(k==2)
			{
				ans.push_back({1,"UD"});
			}	
			else if(k==1)
				ans.push_back({1,"U"}); 
			k=0;
		}
	}
}

int main()
{
	cin>>n>>m>>k;
	
	if(k>4*m*n-2*n-2*m)
	{
		cout<<"NO\n";
		return 0;
	}
	
	add("R",m-1);
	add("L",m-1);
	add("D",n-1);
	for(int i=1;i<=n-1;++i)
	{
		add("R",m-1);
		add("UDL",m-1);
		add("U",1);
	}
	int len=ans.size();
	cout<<"YES\n";
	cout<<len<<"\n";
	for(auto i:ans)
		cout<<i.f<<" "<<i.s<<"\n"; 
	return 0;
}