Codeforces Round #819 (Div. 1 + Div. 2) 参考代码

最新推荐文章于 2023-05-12 20:57:14 发布

原创最新推荐文章于 2023-05-12 20:57:14 发布 · 454 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#c++ #算法

CF 同时被 2 个专栏收录

15 篇文章

订阅专栏

题解

6 篇文章

订阅专栏

本文分享了Codeforces Round #819比赛中的五道题目——A. Mainak and Array, B. Mainak and Interesting Sequence, C. Jatayu’s Balanced Bracket Sequence, D. Edge Split, E. Almost Perfect的参考代码和解题思路，适合算法爱好者学习和练习。" 78653491,6682711,Springboot Admin配置邮件报警,"['Springboot', '邮件服务', '监控工具', '报警机制']

A. Mainak and Array

#include<cstdio>
#include<cstring>
#include<stdlib.h>
#include<algorithm>
#include<iostream>
#include<vector>
#include<set>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<math.h>
#define ll long long
using namespace std;
const int mod=1e9+7;
const int INF=0x3f3f3f3f;

inline int read()
{
    int x=0,f=1;
    char c=getchar();
    while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
    while(c>='0'&&c<='9'){x=x*10+c-'0',c=getchar();}
    return x*f;
}
const int N=2010;
int a[N];
void solve()
{
	int n=read();

	for(int i=1;i<=n;i++)a[i]=read();
	if(n==1)
	{
		printf("0\n");
		return;
	}
	int ans=0;
	for(int i=1;i<n;i++)ans=max(ans,a[i]-a[i+1]);
	
	int max1=0,max2=1e9;
	for(int i=1;i<=n-1;i++)max2=min(max2,a[i]);
	for(int i=2;i<=n;i++)max1=max(max1,a[i]);
	ans=max(ans,max(max1-a[1],a[n]-max2));
	printf("%d\n",ans);
}

int main()
{
	int T=read();
	while(T--)solve();
	return 0;
}

B. Mainak and Interesting Sequence

#include<cstdio>
#include<cstring>
#include<stdlib.h>
#include<algorithm>
#include<iostream>
#include<vector>
#include<set>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<math.h>
#define ll long long
using namespace std;
const int mod=1e9+7;
const int INF=0x3f3f3f3f;

inline int read()
{
    int x=0,f=1;
    char c=getchar();
    while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
    while(c>='0'&&c<='9'){x=x*10+c-'0',c=getchar();}
    return x*f;
}

void solve()
{
	int n=read(),m=read();
	if(n>m)
	{
		printf("No\n");
		return;
	}
	
	if(n&1)
	{
		printf("Yes\n");
		for(int i=1;i<=n-1;i++)printf("1 ");
		printf("%d\n",m-(n-1));
		return;
	}
	if((m-n)&1)
	{
		printf("No\n");
		return;
	}
	printf("Yes\n");
	for(int i=1;i<=n-2;i++)printf("1 ");
	printf("%d %d\n",(m-n+2)/2,(m-n+2)/2);
}

int main()
{
	int T=read();
	while(T--)solve();
	return 0;
}

C. Jatayu’s Balanced Bracket Sequence

#include<cstdio>
#include<cstring>
#include<stdlib.h>
#include<algorithm>
#include<iostream>
#include<vector>
#include<set>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<math.h>
#define ll long long
using namespace std;
const int mod=1e9+7;
const int INF=0x3f3f3f3f;

inline int read()
{
    int x=0,f=1;
    char c=getchar();
    while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
    while(c>='0'&&c<='9'){x=x*10+c-'0',c=getchar();}
    return x*f;
}

void solve()
{
	int n=read();
	string a;cin>>a;
	int ans=0;
	for(int i=0;i<2*n-1;i++)if(a[i]==a[i+1]&&a[i]==')')ans++;
	printf("%d\n",ans+1);
}

int main()
{
	int T=read();
	while(T--)solve();
	return 0;
}

D. Edge Split

#include<cstdio>
#include<cstring>
#include<stdlib.h>
#include<algorithm>
#include<iostream>
#include<vector>
#include<set>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<math.h>
#define ll long long
using namespace std;
const int mod=1e9+7;
const int INF=0x3f3f3f3f;

inline int read()
{
    int x=0,f=1;
    char c=getchar();
    while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
    while(c>='0'&&c<='9'){x=x*10+c-'0',c=getchar();}
    return x*f;
}
const int N=2e5+10;
struct qwq{
	int x,y,id;
}a[N];
qwq b[N];
int id,di;
int f[N],ans[N];
int find(int x){return f[x]=x==f[x]?x:find(f[x]);}
void solve()
{
	map<int,int>mp;
	int n=read(),m=read();
	for(int i=1;i<=n;i++)f[i]=i;
	for(int i=1;i<=m;i++)ans[i]=0;
	id=0,di=0;
	int sum=0;
	for(int i=1;i<=m;i++)
	{
		int x=read(),y=read();
		int xx=find(x),yy=find(y);
		if(xx!=yy)
		{
			f[xx]=yy;
			b[++di].id=i,b[di].x=x,b[di].y=y;
		}
		else
		{
			if(mp.find(x)==mp.end())mp[x]=1,sum++;
			if(mp.find(y)==mp.end())mp[y]=1,sum++;
			ans[i]=1;
			a[++id].id=i,a[id].x=x,a[id].y=y;
		}
	}
	if(m==n+2&&sum==3)
	{
		 ans[a[1].id]=0;
		 int x=a[1].x,y=a[1].y;
		 for(int i=1;i<=di;i++)
		 	if(b[i].x==x||b[i].y==x)ans[b[i].id]=1;
	}
	for(int i=1;i<=m;i++)printf("%d",ans[i]);
	printf("\n");
}

int main()
{
	int T=read();
	while(T--)solve();
	return 0;
}

E. Almost Perfect

#include<cstdio>
#include<cstring>
#include<stdlib.h>
#include<algorithm>
#include<iostream>
#include<vector>
#include<set>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<math.h>
#define ll long long
using namespace std;
const int mod=998244353;
const int INF=0x3f3f3f3f;

inline int read()
{
    int x=0,f=1;
    char c=getchar();
    while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
    while(c>='0'&&c<='9'){x=x*10+c-'0',c=getchar();}
    return x*f;
}
ll quickpow(ll a,ll b)
{
    ll s=1;
    while(b)
    {
        if(b&1)s=s*a%mod;
        a=a*a%mod;
        b>>=1;
    }
    
    return s;
}

const int N=3e5+10;
ll f[N],in[N],nin[N];
ll C(ll n,ll m)
{
    if(n<m)return 0;
    return in[n]*nin[m]%mod*nin[n-m]%mod;
} 

void solve()
{
	int n=read();
	ll ans=0;
	for(ll i=0;i<=n/4;i++)ans=(ans+C(n-2*i,2*i)*in[2*i]%mod*nin[i]%mod*f[n-4*i]%mod)%mod;
	printf("%lld\n",ans);
}

int main()
{
	f[0]=1;
	f[1]=1;
	for(int i=2;i<=N-10;i++)f[i]=(f[i-1]+(i-1)*f[i-2]%mod)%mod;

	in[0]=1;
	in[1]=1;
	for(int i=2;i<=N-10;i++)in[i]=in[i-1]*i%mod;
	
	nin[N-10]=quickpow(in[N-10],mod-2);
	for(int i=N-11;i>=0;i--)nin[i]=nin[i+1]*(1ll+i)%mod;
	int T=read();
	while(T--)solve();
	return 0;
}