Codeforces Round #808 (Div. 2)参考代码

Codeforces Round #808 (Div. 2)
A. Difference Operations：

#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];
void solve()
{
	int n=read();
	ll sum=0;
	for(int i=1;i<=n;i++)a[i]=read();
	for(int i=1;i<=n;i++)
	{
		if(a[i]%a[1]!=0)
		{
			printf("NO\n");
			return;
		}
	}
	printf("YES\n");
}
 
int main()
{
	int T=read();
	while(T--){solve();}
	return 0;
}

B. Difference of GCDs

#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 ans[100010];
void solve()
{
	int n=read(),l=read(),r=read();
	int id=0;
	for(int i=1;i<=n;i++)
	{
		int x=r/i;
		x*=i;
		if(x>=l&&x<=r)ans[++id]=x;
		else 
		{
			printf("NO\n");
			return;
		}
	}
	printf("YES\n");
	for(int i=1;i<=n;i++)printf("%d ",ans[i]);
	printf("\n");
}
 
int main()
{
	int T=read();
	while(T--){solve();}
	return 0;
}

C. Doremy’s IQ

#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;
int a[N];
int ans[N];
void solve()
{
	int n=read(),q=read();
	for(int i=1;i<=n;i++)a[i]=read();

	memset(ans,0,sizeof(ans));
	int sum=0;
	for(int i=n;i>=1;i--)
	{
		if(sum<q)
		{
			if(a[i]>sum)
			{
				sum++;
				ans[i]=1;
			}
			else ans[i]=1;
		}
		else
		{
			if(a[i]<=sum)ans[i]=1;
			else continue;
		}
	}
	for(int i=1;i<=n;i++)printf("%d",ans[i]);
	printf("\n");
}
 
int main()
{
	int T=read();
	while(T--){solve();}
	return 0;
}

D. Difference 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;
}
 
vector<int>a,b;
void solve()
{
	a.clear();
	int n=read();
	for(int i=1;i<=n;i++)
	{
		int x=read();
		if(x) a.push_back(x);
	}
	
	for(int i=n;i>1;i--)
	{
		b.clear();
		sort(a.begin(),a.end());
		if(a.size()<i&&!a.empty()) b.push_back(a[0]);
		for(int i=0;i+1<a.size();i++)
		{
			int x=a[i+1]-a[i];
			if(x) b.push_back(x);
		}
		a=b;
	}
	if(a.empty())printf("0\n");
	else printf("%d\n",a[0]);
}
 
int main()
{
	int T=read();
	while(T--){solve();}
	return 0;
}

E. DFS Trees

#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+5;
int n,m,tot;
int f[N],fa[N][20],dep[N],ans[N],tag[N],la[N],bz[N];
 
struct edge{int to,ne;}w[N<<1];
struct QwQ{int x,y,z;}ww[N];
bool cmp(QwQ x,QwQ y){return x.z<y.z;}
 
int get(int x){return f[x]==x?x:f[x]=get(f[x]);}
 
void dfs(int x,int ff)
{
	fa[x][0]=ff;
	dep[x]=dep[ff]+1;
	for(int i=la[x];i;i=w[i].ne)
		if(w[i].to!=ff)dfs(w[i].to,x);
}
 
int lca(int x,int y)
{
	if(dep[x]<dep[y])swap(x,y);
	for(int i=18;i>=0;i--)
		if(dep[fa[x][i]]>=dep[y])x=fa[x][i];
	if(x==y)return x;
	for(int i=18;i>=0;i--)
		if(fa[x][i]!=fa[y][i])x=fa[x][i],y=fa[y][i];
	return fa[x][0];
}
 
void sol(int x,int y)
{
	y+=tag[x];
	if(y)ans[x]=0;
	else ans[x]=1;
	for(int i=la[x];i;i=w[i].ne)
		if(w[i].to!=fa[x][0])sol(w[i].to,y);
}
 
void solve()
{
	n=read(),m=read();
	for(int i=1;i<=n;i++)f[i]=i;
	for(int i=1;i<=m;i++)ww[i].x=read(),ww[i].y=read(),ww[i].z=i;
	sort(ww+1,ww+1+m,cmp);
	
 
	for(int i=1,j=0;i<=m;i++)
	{
		int x=get(ww[i].x),y=get(ww[i].y);
		if(x==y)continue;
		j++;
		f[x]=y;
		x=ww[i].x;
		y=ww[i].y;
		w[++tot]=(edge){y,la[x]};
		la[x]=tot;
		w[++tot]=(edge){x,la[y]};
		la[y]=tot;
		bz[ww[i].z]=1;
		if(j+1==n)break;
	}
	dfs(1,0);
	for(int j=1;j<=18;j++)
		for(int i=1;i<=n;i++)fa[i][j]=fa[fa[i][j-1]][j-1];
		
	for(int i=1;i<=m;i++)
		if(!bz[i])
		{
			int x=ww[i].x,y=ww[i].y,z=lca(x,y);
			if(x!=z&&y!=z)tag[1]++,tag[x]--,tag[y]--;
			else if(x==z)
			{
				tag[y]--;
				for(int j=18;j>=0;j--)
					if(dep[fa[y][j]]>dep[x])y=fa[y][j];
				tag[y]++;
			}
			else
			{
				tag[x]--;
				for(int j=18;j>=0;j--)
					if(dep[fa[x][j]]>dep[y])x=fa[x][j];
				tag[x]++;
			}
		}
	sol(1,0);
	for(int i=1;i<=n;i++)printf("%d",ans[i]);
}
 
int main()
{
	int T=1;
	while(T--){solve();}
	return 0;
}