2018牛客网多校训练4

https://www.nowcoder.com/acm/contest/142#question

比赛就过了3题

 

F：暴力 solved by lyy

#include <bits/stdc++.h>
using namespace std;
#define ll long long
int t;
int n,m;
char s[2005][2005];
int dp[1005][1005];

int main()
{
	scanf("%d",&t);
	while (t--)
	{
		memset(dp,0,sizeof(dp));
		scanf("%d%d",&n,&m);
		for (int i=1;i<=n;i++)
		{
			scanf("%s",s[i]+1);
		}
		for (int i=1;i<=n/2;i++)
		{
			for (int j=1;j<=m/2;j++)
			{
				if (s[i][j]==s[i][m+1-j] && s[i][j]==s[n+1-i][j] && s[i][j]==s[n+1-i][m+1-j]) dp[i][j]=1;
				else dp[i][j]=0;
			}
		}
		int l=n/2;
		int h=m/2;
		for (int i=1;i<=n/2;i++)
		{
			for (int j=1;j<=m/2;j++)
			{
				if (dp[i][j]==0)
				{
					l=min(l,i);
					h=min(h,j);
				}
			}
		}
		int ans;
		if (min(l,h)==1) ans=0;
		else ans=(l-1)*(h-1);
		printf("%d\n",ans);
	}
	return 0;
}

 

D：构造 solved by wyq and sdn

#include <bits/stdc++.h>
using namespace std;
#define ll long long
int a[405][405];
int main()
{
	int T;
	scanf("%d",&T);
	a[200][200]=1;
	a[201][200]=1;
	a[200][201]=0;
	a[201][201]=-1;
	while(T--)
	{
		int n,i,j;
		scanf("%d",&n);
		if(n%2==1)printf("impossible\n");
		else
		{
			printf("possible\n");
			int nowleft=200;
			int nowright=201;
			for(i=4;i<=n;i+=2)
			{
				nowleft--;
				for(j=1;j<=i;j++)
					a[200+j-1][nowleft]=1;
				nowright++;
				for(j=1;j<i;j++)
					a[200+j-1][nowright]=-1;
				a[200+i-1][nowright]=0;
				for(j=nowleft+1;j<nowright;j++)
				{
					a[200+i-2][j]=-1;
					a[200+i-1][j]=1;
				}
			}
			for(i=200;i<=200+n-1;i++)
			{
				for(j=201-n/2;j<=200+n/2;j++)
				printf("%d ",a[i][j]);
				printf("\n");
			}
		}
	}
				
	return 0;
}

 

G：直接用STL乱搞就过了

#include <bits/stdc++.h>
using namespace std;
#define ll long long
int t;
int n,m;
int a[100005];
map<int,int> s;
map<int,int> ss;

int main()
{
	scanf("%d",&t);
	while (t--)
	{
		s.clear();
		ss.clear();
		scanf("%d%d",&n,&m);
		for (int i=1;i<=n;i++)
		{
			scanf("%d",&a[i]);
			s[a[i]]++;
		}
		for (auto x:s)
		{
			ss[x.second]++;
		}
		int p=10000000;
		for (map<int,int>::iterator it=ss.begin();it!=ss.end();it++)
		{
			int x=it->first;
			int y=it->second;
			int ans=-1;
			for (auto h:ss)
			{
				int xx=h.first;
				int yy=h.second;
				if (xx>=x) ans+=yy*(xx-x+1);
			}
			if (ans<=m)
			{
				p=x;
				break;
			}
		}
		int ans=-1;
		for (auto x:s)
		{
			if (x.second>=p) ans=max(ans,x.first);
		}
		printf("%d\n",ans);
	}
	return 0;
}