Codeforces Round #806 (Div. 4)参考代码

最新推荐文章于 2022-09-01 16:14:48 发布

原创最新推荐文章于 2022-09-01 16:14:48 发布 · 652 阅读

1 ·

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

标签

#c++ #算法

CF 专栏收录该内容

15 篇文章

订阅专栏

这篇博客分享了Codeforces Round #806 (Div. 4)比赛中的解题思路，包括A到G共7道题目。涉及到的编程语言为C++，主要探讨了算法的应用。

Codeforces Round #806 (Div. 4)
A.YES or YES?:

#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()
{
	char a[4];
	scanf("%s",a+1);
	if((a[1]=='Y'||a[1]=='y')&&(a[2]=='E'||a[2]=='e')&&(a[3]=='s'||a[3]=='S'))cout<<"YES"<<endl;
	else cout<<"NO"<<endl;
}

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

B.ICPC Balloons

#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()
{
	map<char,int>mp;
	char a[100];
	int n=read();
	scanf("%s",a+1);
	int sum=0;
	for(int i=1;i<=n;i++)
		if(mp[a[i]]==0)mp[a[i]]=1,sum++;
	printf("%d\n",sum+n);
}

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

C.Cypher:

#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();
	int a[110];
	for(int i=1;i<=n;i++)a[i]=read();
	for(int i=1;i<=n;i++)
	{
		int m=read();
		char b[100];
		scanf("%s",b+1);
		for(int j=1;j<=m;j++)
		{
			if(b[j]=='U')
			{
				if(a[i]==0)a[i]=9;
				else a[i]--;
			}
			else
			{
				if(a[i]==9)a[i]=0;
				else a[i]++;
			}
		}
	}
	for(int i=1;i<=n;i++)printf("%d ",a[i]);
	printf("\n");
}

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

D.Double Strings:

#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=1e5+10; 
string a[N];
int v[N];
void solve()
{
	memset(v,0,sizeof(v));
	map<string,bool>mp;
	int n=read();
	for(int i=1;i<=n;i++)cin>>a[i],mp[a[i]]=true;
	
	for(int i=1;i<=n;i++)
	{
		int len=a[i].size();
		for(int j=1;j<len;j++)
		{
			string x,y;
			for(int k=0;k<j;k++)x+=a[i][k];
			for(int k=j;k<len;k++)y+=a[i][k];
			if(mp[x]&&mp[y])v[i]=1;
		}
	}
	for(int i=1;i<=n;i++)printf("%d",v[i]);
	cout<<endl;
}

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

E.Mirror Grid

#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;
}
int a[110][110],v[110][110];
void solve()
{
	memset(v,0,sizeof(v));
	int n=read();
	for(int i=1;i<=n;i++)
	{
		string x;cin>>x;
		for(int j=0;j<n;j++)a[i][j+1]=x[j]-'0';
	}
	int ans=0;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=n;j++)
		{
			if(!v[i][j])
			{
				v[i][j]=1,v[j][n-i+1]=1,v[n-i+1][n-j+1]=1,v[n-j+1][i]=1;
				int sum1=(a[i][j]==1)+(a[j][n-i+1]==1)+(a[n-i+1][n-j+1]==1)+(a[n-j+1][i]==1);
				int sum2=(a[i][j]==0)+(a[j][n-i+1]==0)+(a[n-i+1][n-j+1]==0)+(a[n-j+1][i]==0);
				ans+=min(sum1,sum2);
			}
		}
	}
	printf("%d\n",ans);
}

int main()
{
	int T=read();
	while(T--){solve();}
	return 0;
}
//(i,j)->(j,n-i+1)

F.Yet Another Problem About Pairs Satisfying an Inequality

#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;
ll a[N],v[N],s[N];
void solve()
{
	memset(s,0,sizeof(s));
	memset(v,0,sizeof(v));
	int n=read();
	for(int i=1;i<=n;i++)scanf("%lld",&a[i]);
	for(int i=1;i<=n;i++)if(i>a[i])v[i]=1;
	for(int i=1;i<=n;i++)s[i]=s[i-1]+v[i];
	ll ans=0;
	for(int i=1;i<=n;i++)
		if(v[i])ans+=s[a[i]-1];
	printf("%lld\n",ans);
}

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

G.Good Key, Bad Key:

#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=1e5+10;
ll a[N],f[N][32],p[32];
void solve()
{
	int n=read(),k=read();
	int logn=31;
	for(int i=1;i<=n;i++)a[i]=read();
	
	for(int i=0;i<=n;i++)
		for(int j=0;j<=31;j++)f[i][j]=-1e18;
	f[0][0]=0;
	
	
	ll ans=-1e18;
	for(int j=0;j<logn;j++)
	{
		for(int i=1;i<=n;i++)
		{
			f[i][j]=max(f[i-1][j]+a[i]/p[j]-k,f[i][j]);
			ans=max(ans,f[i][j]);
			if(j+1<logn)
			{
				f[i][j+1]=max(f[i-1][j]+a[i]/(ll)(p[j+1]),f[i][j+1]);
				ans=max(ans,f[i][j+1]);
			}
		}
	}
	printf("%lld\n",ans);
}

int main()
{
	p[0]=1,p[1]=2;
	for(int i=2;i<=31;i++)p[i]=p[i-1]*2;
	int T=read();
	while(T--){solve();}
	return 0;
}