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

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

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

0 ·

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

标签

#c++ #图论 #算法

CF 同时被 2 个专栏收录

15 篇文章

订阅专栏

题解

6 篇文章

订阅专栏

A. Crossmarket

#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==1&&m==1)
	{
		printf("0\n");
		return;
	}
	if(m>n)swap(n,m);
	printf("%d\n",n-1+m-1+m);
}

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

B. Beautiful 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;
}

void solve()
{
	ll n,k,b,s;
	scanf("%lld%lld%lld%lld",&n,&k,&b,&s);
	if(k*b>s||k*b+n*(k-1)<s)
	{
		printf("-1\n");
		return;
	}
	ll ans=b*k;
	if(ans==s)
	{
		for(int i=1;i<=n-1;i++)printf("0 ");
		printf("%lld\n",s);
		return;
	}
	int sum=0;
	while(1)
	{
		if(s>=b*k&&s<k*(b+1))break;
		s-=k-1;
		sum++;
	}
	for(int i=1;i<=n-1-sum;i++)printf("0 ");
	for(int i=1;i<=sum;i++)printf("%lld ",k-1);
	printf("%lld\n",s);	
}

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

C. Monoblock

#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];
void solve()
{
	ll n,q;
	scanf("%lld%lld",&n,&q);
	for(int i=1;i<=n;i++)scanf("%lld\n",&a[i]);
	ll ans=0;
	for(int i=1;i<=n;i++)
	{
		if(a[i]!=a[i-1])ans+=i*(n-i+1);
		else ans+=n-i+1;
	}
	while(q--)
	{
		int i=read(),x=read();
		ll yy=0;
		if(a[i]==a[i-1])yy+=n-i+1;
		else yy+=i*(n-i+1);
		if(a[i]==a[i+1])yy+=n+1-(i+1);
		else yy+=(i+1)*(n+1-(i+1));
		ll zz=0;
		if(x==a[i-1])zz+=n-i+1;
		else zz=i*(n-i+1);
		if(x==a[i+1])zz+=n+1-(i+1);
		else zz+=(i+1)*(n+1-(i+1));
		ans+=zz-yy;
		a[i]=x;
		printf("%lld\n",ans);
	}
}

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

D. 2+ doors

#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;
bool a[N][31],mark[N][31];
int ans[N];
vector<int>v[N][30];
void solve()
{

	int n=read(),q=read();
	while(q--)
	{
		int x=read(),y=read(),z=read();
		if(x==y)
		{
			for(int i=29;i>=0;i--)
			{
				if((z>>i)&1)a[x][i]=1;
				else mark[x][i]=mark[y][i]=1;
			}
			continue;
		}
		for(int i=29;i>=0;i--)
		{
			if((z>>i)&1)
			{
				v[x][i].push_back(y);
				v[y][i].push_back(x);
			}
			else mark[x][i]=mark[y][i]=1;
		}
	}
	for(int i=1;i<=n;i++)
	{
		for(int j=29;j>=0;j--)
		{
			if(mark[i][j])
			{
				for(int id=0;id<v[i][j].size();id++)
				{
					int k=v[i][j][id];
					a[k][j]=1;
				}
			}
		}
	}
	for(int i=1;i<=n;i++)
	{
		for(int j=29;j>=0;j--)
		{
			if(!a[i][j])
			{
				for(int id=0;id<v[i][j].size();id++)
				{
					int k=v[i][j][id];
					a[k][j]=1;
				}
			}
			else ans[i]|=(1<<j);
		}
	}
	for(int i=1;i<=n;i++)printf("%d ",ans[i]);
	printf("\n");
}

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