codeforces 706 div2 A-C

A. Split it!

#include<bits/stdc++.h>
using namespace std;
string str;
int main()
{
	int t;
	cin>>t;
	while(t--)
	{
		int n,k;
		cin>>n>>k;
		cin>>str;
		int num=0;
		for(int i=0;i<n;i++)
		{
			if(str[i]==str[n-1-i])
			num++;
			else
			break;
		}
		if(num>=k&&k*2+1<=n)
		cout<<"YES"<<endl;
		else
		cout<<"NO"<<endl;
	}
} 

B. Max and Mex

//如何维护中间未曾出现过的最小非负数
//最大值始终不变
//一旦出现重复后面就都是重复了
#include<bits/stdc++.h>
using namespace std;
int main()
{
	int t;
	cin>>t;
	while(t--)
	{
		int n,k;
		cin>>n>>k;
		map<int,int > p;
		int ma=-1;
		for(int i=0;i<n;i++)
		{
			int x;
			cin>>x;
			ma=max(x,ma);
			p[x]++;
		}
		if(k==0)
		{
			cout<<p.size()<<endl;
			continue;	
		}
		if(p.find(0)==p.end())
		{
			int r=ma/2;
			if(ma%2==1) r++;//向上取整 
			if(p.find(r)!=p.end())
			cout<<p.size()<<endl;
			else
			cout<<p.size()+1<<endl;
		}
		else
		{
			int i;
			for(i=0;i<p.size();i++)
			{
				if(p.find(i)==p.end())
				break;
			}
			if(i>=p.size())
			cout<<p.size()+k<<endl;
			else
			{
				int r=(i+ma)/2;
				if((i+ma)%2==1) r++;
				if(p.find(r)!=p.end())
				cout<<p.size()<<endl;
				else
				cout<<p.size()+1<<endl;
			} 
		}
	}
} 
 

C. Diamond Miner

#include<bits/stdc++.h>
using namespace std;
//贪心 
//混沌条件下，正着应该是取得最小值 
typedef long long ll;
int main()
{
	int t;
	cin>>t;
	while(t--)
	{
		vector<ll > a;
		vector<ll > b;
		int n;
		scanf("%d",&n);
		double ans=0;
		for(int j=0;j<2*n;j++)
		{
			int x,y;
			scanf("%d%d",&x,&y);
			if(x==0)
			a.push_back(abs(y));//miner
			else
			b.push_back(abs(x));
		}
		sort(a.begin(),a.end());
		sort(b.begin(),b.end());
		for(int i=0;i<n;i++)
		{
			ans+=sqrt(a[i]*a[i]+b[i]*b[i]);
		}
		printf("%.20f\n",ans);
	}
}