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

Codeforces Round #807 (Div. 2)

A. Mark the Photographer：

#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=2e3+10;
int a[N],b[N];
void solve()
{
	int n=read(),k=read();
	for(int i=1;i<=2*n;i++)a[i]=read();
	sort(a+1,a+1+2*n);
	for(int i=n+1;i<=n*2;i++)b[i-n]=a[i];
	for(int i=1;i<=n;i++)
	{
		if(b[i]-a[i]<k)
		{
			printf("No\n");
			return;
		}
	}
	printf("Yes\n");
}
 
int main()
{
	int T=read();
	while(T--){solve();}
	return 0;
}

B. Mark the Dust Sweeper：

#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();
	bool flag=1;
	ll sum=0;
	for(int i=1;i<=n;i++)
	{
		int x=read();
		if(x==0&&flag==1)continue;
		if(x!=0&&flag==1)flag=0;
		if(i==n)break;
		if(x==0)sum++;
		else sum+=x;
	}
	printf("%lld\n",sum);
}

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

C. Mark and His Unfinished Essay：

#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=4e5+10;
char a[N];
struct qwq{
	ll l,r;
	ll id;
}b[50];
ll len;
void solve()
{
	int n=read(),c=read(),q=read();
	scanf("%s",a+1);
	len=n;
	b[0].id=1,b[0].l=1;
	for(int i=1;i<=c;i++)scanf("%lld%lld",&b[i].l,&b[i].r),b[i].id=len+1,len+=b[i].r-b[i].l+1;
//	for(int i=0;i<=c;i++)cout<<b[i].id<<" ";
//	cout<<endl;
	for(int i=1;i<=q;i++)
	{
		ll x;
		scanf("%lld",&x);
		int now=-1;
		for(int i=0;i<=c;i++)
		{
			if(b[i].id<=x&&b[i+1].id>x)now=i;
			if(i==c&&now==-1)now=c;
		}

		if(now==0)
		{
			printf("%c\n",a[x]);
			continue;
		}

		while(1)
		{
			ll f;
			f=x-b[now].id;
			x=b[now].l+f;
			if(x<=n)break;
			for(int i=0;i<=c;i++)
				if(b[i].id<=x&&b[i+1].id>x)now=i;
		}
		printf("%c\n",a[x]);
	}
}

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

D. Mark and Lightbulbs：

#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;
int a[N],b[N];
int v1[N],v2[N];
void solve()
{
	int n=read();
	string x;cin>>x;
	for(int i=0;i<n;i++)a[i+1]=x[i]-'0';
	cin>>x;
	for(int i=0;i<n;i++)b[i+1]=x[i]-'0';
	
	if(a[1]!=b[1]||a[n]!=b[n])
	{
		printf("-1\n");
		return;		
	}
	for(int i=1;i<n;i++)a[i]^=a[i+1],b[i]^=b[i+1];
	

	int sum1=0,sum2=0;
	for(int i=1;i<=n;i++)sum1+=a[i],sum2+=b[i];
	if(sum1!=sum2)
	{
		printf("-1\n");
		return;
	}
	
	int id=0;
	for(int i=1;i<=n;i++)if(a[i])v1[++id]=i;
	id=0;
	for(int i=1;i<=n;i++)if(b[i])v2[++id]=i;
	
	ll ans=0;
	for(int i=1;i<=n;i++)ans+=abs(v2[i]-v1[i]);
	printf("%lld\n",ans);
}

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

E. Mark and Professor Koro：

#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=3e5+10;
int a[N],cnt[N];
int tree[4*N][2],lz[4*N];
void build(int node,int l,int r)
{
    if(l==r)
	{
        tree[node][cnt[l]]=1;
        return;
    }
    int mid=(l+r)>>1;
    build(node*2,l,mid),build(node*2+1,mid+1,r);
    tree[node][0]=tree[node*2][0]+tree[node*2+1][0];
    tree[node][1]=tree[node*2][1]+tree[node*2+1][1];
}
void pushdown(int node,int l,int r)
{
    if(lz[node]!=-1)
	{
        int mid=(l+r)>>1;
        tree[node*2][lz[node]]=mid-l+1,tree[node*2][lz[node]^1]=0;
        tree[node*2+1][lz[node]]=r-mid,tree[node*2+1][lz[node]^1]=0;
        lz[node*2]=lz[node*2+1]=lz[node],lz[node]=-1;
    }
}
void update(int node,int l,int r,int L,int R,int v)
{
    if(L>R)return;
    if(l>=L&&r<=R)
	{
        tree[node][v]=r-l+1,tree[node][v^1]=0;
        lz[node]=v;
        return;
    }
    pushdown(node,l,r);
    int mid=(l+r)>>1;
    if(mid>=L) update(node*2,l,mid,L,R,v);
    if(mid<R) update(node*2+1,mid+1,r,L,R,v);
    tree[node][0]=tree[node*2][0]+tree[node*2+1][0];
    tree[node][1]=tree[node*2][1]+tree[node*2+1][1];
}
int query(int node,int l,int r,int pos,int v)
{
    if(l>=pos&&tree[node][v]==0)return -1;
    if(l==r)
	{
        if(tree[node][v])return l;
        else return -1;
    }
    pushdown(node,l,r);
    int mid=(l+r)>>1;
    if(pos>mid)return query(node*2+1,mid+1,r,pos,v);
    else
	{
        int temp=query(node*2,l,mid,pos,v);
        if(temp!=-1)return temp;
        else return query(node*2+1,mid+1,r,pos,v);
    }
}
int query_mx(int node,int l,int r)
{
    if(l==r)return l;
    pushdown(node,l,r);
    int mid=(l+r)>>1;
    if(tree[node*2+1][1])return query_mx(node*2+1,mid+1,r);
    else return query_mx(node*2,l,mid);
}
void add(int pos)
{
    int p=query(1,1,300000,pos,0);
    //cout<<p<<endl;
    update(1,1,300000,pos,p-1,0);
    update(1,1,300000,p,p,1);
}
void mnus(int pos)
{
    int p=query(1,1,300000,pos,1);
    //cout<<p<<" ";
    update(1,1,300000,pos,p-1,1);
    update(1,1,300000,p,p,0);
}

void solve()
{
    int n=read(),q=read();
    memset(lz,-1,sizeof(lz));
    for(int i=1;i<=n;i++)scanf("%d",&a[i]),cnt[a[i]]++;
    for(int i=1;i<=300000;i++)cnt[i+1]+=cnt[i]/2,cnt[i]%=2;
    build(1,1,300000);
    //cout<<query_mx(1,1,300000)<<endl;
    for(int i=1,x,y;i<=q;i++)
	{
		scanf("%d%d",&x,&y);
		mnus(a[x]),a[x]=y,add(a[x]);
		printf("%d\n",query_mx(1,1,300000));
    }	
}
int main()
{
	int T=1;
	while(T--){solve();}
	return 0;
}