牛客练习赛34 ABCD题解

传送门

A

#include<cstdio>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<map>
#include<queue>
#define ll long long
#define N 0x3f3f3f3f
using namespace std;
int b[100010];
int main()
{
	int t;
	cin>>t;;
	while(t--)
	{
		string s;
		cin>>s;
		int m=s[s.size()-1]-'0';
		if(m%2!=0)
		{
			s[s.size()-1]=s[s.size()-1]-1;
		}
		cout<<s<<endl;
	
	}
	return 0;
}

B

#include<cstdio>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<map>
#include<queue>
#define ll long long
#define N 0x3f3f3f3f
using namespace std;
int b[100010];
int main()
{
	int n;
	cin>>n;
	ll h=0;
	for(int i=0;i<n;i++)
	{
		cin>>b[i];
		h+=b[i];
	}
	if(h%2==0)
	{
		int ans=0;
		for(int i=0;i<n;i++)
		{
			if(b[i]==h/2)
			ans++;
		}
		if(ans==0)
		{
			cout<<-1<<endl;
		}
		else
		cout<<ans<<endl;
	}
	else
	{
		cout<<-1<<endl;
	}
	return 0;
}

C

#include<cstdio>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<vector>
#define ll long long
#define N 0x3f3f3f3f
using namespace std;
int l[100010];
int r[100010];
int len[100010];
int s[100010];
int main()
{
	int n,m;
	cin>>n>>m;
	int ans=0;
	memset(len,0,sizeof(len));
	memset(s,0,sizeof(s));
	for(int i=1;i<=m;i++)
	{
		cin>>l[i]>>r[i];
		len[l[i]]++,len[r[i]+1]--;
	}
	for(int i=1;i<=n;i++)
	{
		len[i]+=len[i-1];
		if(len[i]==0)
		{
			ans++;
		}
	}
	for(int i=1;i<=n;i++)
	{
		if(len[i]>1)
		{
			len[i]=0;
		}
		len[i]+=len[i-1];
	}
	int pos=1;
	for(int i=1;i<=m;i++)
	{
		if(len[r[i]]-len[l[i]-1]<=len[r[pos]]-len[l[pos]-1])
		pos=i;
	}
	cout<<pos<<" "<<len[r[pos]]-len[l[pos]-1]+ans<<endl;
	return 0;
}

树状数组

#include<cstdio>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<vector>
#define ll long long
#define N 0x3f3f3f3f
using namespace std;
int n,m;
struct ac
{
	int l,r;
}a[101000];
int c[101000];
int num[101000];
int lowbit(int w)
{
	return w&(-w);
}
void updata(int x)
{
	while(x<=n)
	{
		c[x]+=1;
		x+=lowbit(x);
	}
}
int getsum(int x)
{
	int sum=0;
	while(x>0)
	{
		sum+=c[x];
		x-=lowbit(x);
	}
	return sum;
}
int main()
{
	cin>>n>>m;
	memset(num,0,sizeof(num));
	memset(c,0,sizeof(c));
	for(int i=1;i<=m;i++)
	{
		cin>>a[i].l>>a[i].r;
		num[a[i].l]++,num[a[i].r+1]--;
	}
	int ans=0;
	for(int i=1;i<=n;i++)
	{
		num[i]+=num[i-1];
		if(num[i]==0)
		ans++;
		if(num[i]==1)
		updata(i);
	}
	int sum=1e9;
	int pos;
	for(int i=1;i<=m;i++)
	{
		if(getsum(a[i].r)-getsum(a[i].l-1)<=sum)
		{
			pos=i;
			sum=getsum(a[i].r)-getsum(a[i].l-1);
		}
	}
	sum+=ans;
	cout<<pos<<" "<<sum<<endl;
	return 0;
}

D

#include<cstdio>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<vector>
#define ll long long
#define N 0x3f3f3f3f
using namespace std;
int a[1010];
int main()
{
	int n,m;
	cin>>n>>m;
	for(int i=0;i<n;i++)
	{
		cin>>a[i];
	}
	sort(a,a+n);
	int ans=0;
	for(int i=0;i<n;i++)
	{
		if(ans+1<a[i])
		{
			break;
		}
		ans+=a[i];
	}
	if(ans>=m)
	cout<<"YES"<<endl;
	else
	cout<<"NO"<<endl;
	return 0;
}