1.24今日总结

上午学习了快排。

快排的平均时间复杂度：nlog2 n。

最复杂的情况：每次所选的基准数是当前序列中的最大或最小元。这样，长度为n的数据表的快速排序需要经过n趟划分，使得整个排序算法的时间复杂度为n的平方。

快排有四种优化方法。

1.取中间值

在选取基准数时，通过比较第一个元素，最后一个元素，和中间位置元素的数据，找到在两者之间的数作为基准数。

2.当分割后的数据较少时改用直接插入排序

当排序的数据过小的时候，采用直接插入排序会更简单，直接插入排序平均复杂度为n的平方。

直接插入排序模板：

	for(int i=1;i<10;i++)
	{
		j=i;
		t=a[i];
	 while(j>0&&a[j-1]>t)
	 {
	 	a[j]=a[j-1];
	 	j--;
			 }
		a[j]=t; 		
	 }

排序10个数。每次向前甄选小大于a[i]的数，并进行交换。

3.将与基准数相同的数聚集在一起

即把与基准数相同的数据放在基准数附近

排序前6 4 6 7 1 6 7 6 8 6

排序后1 4 6 6 6 6 6 7 8 7

4.优化递归操作

下午补了P7939 [B1] Alice Wins! (easy version)这个题

P7939 [B1] Alice Wins! (easy version)

题目描述

The difference between the versions is the limit of operations.

Alice is a cute girl who has a lot of dolls.

There are 4\cdot n4⋅n dolls playing rock-paper-scissors. They are divided into two teams: Team A and Team B. Each team contains 2\cdot n2⋅n dolls.

A total of 2\cdot n2⋅n rounds of the game will be played. In the ii-th round, the ii-th doll in Team A will play against the ii-th doll in Team B. If the doll in Team A wins, Team A will get 11 point. If it loses, Team A will lose 11 point. If it ties, Team A will not get points.

Alice knows all the dolls' choices in this game. To be precise, she uses two arrays aa and bb to represent the choices of the dolls in the two teams. a_iai​ means the choice of the ii-th doll in Team A, and b_ibi​ means the choice of the ii-th doll in Team B. In this question, we use 11 for rock, 22 for scissors, and 33 for paper.

Now for each team, Alice wants to change the choices of at most nn dolls to make the score of Team A as high as possible.

Find the maximum score of Team A and its construction method. If there are multiple answers print any of them (you still have to maximize the score of Team A).

输入格式

Each test contains multiple testcases. The first line contains an integer TT, the number of test cases.

For each test case, the first line contains one integer nn.

Then two lines follow, containing an array aa of length 2\cdot n2⋅n and an array bb of length 2\cdot n2⋅n, respectively.

输出格式

For each test case, print three lines.

The first line contains one integer, the maximum score of Team A.

The second line contains an array a'a′ of length 2\cdot n2⋅n, which represents the aa array after Alice's modification. For integers 11 to 2\cdot n2⋅n, if a_i \ne a'_iai​=ai′​, then it means you have modified the choice of one player in Team A.

The third line contains an array b'b′ of length 2\cdot n2⋅n, which represents the bb array after Alice's modification. For integers 11 to 2\cdot n2⋅n, if b_i \ne b'_ibi​=bi′​, then it means you have modified the choice of one player in Team B.

题意翻译

AB 每队 2n2n 人正在玩石头剪刀布。A 队第 ii 个人出 a_iai​，B 队第 ii 个人出 b_ibi​。编号相同的人会对战。若 A 队赢则加一分，平不得分，输扣一分。你可以至多改变每队 nn 个人的出拳方案，使得 A 队的得分最高。输出得分的最大值和任意一组构造方案。

本题中，我们用 11 代表石头，22 代表剪刀，33 代表布。

输入输出样例

输入 #1复制

2
1
1 2
1 2
2
2 3 1 3
1 2 2 1

输出 #1复制

2
1 1
2 2
4
3 1 1 3
1 2 2 1

说明/提示

Explanation

For the first test case, we can change a_2a2​ to 11 and b_1b1​ to 22. Then Team A can get 22 points. It can be proved that this is the maximum score that Team A can get.

For the second test case, we can change a_1a1​ to 33 and a_2a2​ to 11.

Constraints

1\le T,n \le 10^5;\ 1\le a_i,b_i \le 31≤T,n≤105; 1≤ai​,bi​≤3. The sum of nn over all test cases \le 10^5≤105.

题目意思是最多通过n次改变a中出的方式，最多改变b出的方式来达到a取得分数最多。

这个题采用我开始采用穷举法，即把每种情况列出来，但是有问题

错误代码：

#include<stdio.h>
int a[1000000];
int b[1000000];
int main()
{
	int n;
	scanf("%d",&n);
	for(int j=0;j<n;j++)
	{
		int x;
		int k=0;
		int d=0;
		int sum=0;
		scanf("%d",&x);
		for(int i=1;i<=2*x;i++)
		scanf("%d",&a[i]);
		for(int i=1;i<=2*x;i++)
		scanf("%d",&b[i]);
		for(int i=1;i<=2*x;i++)
		{
			if(k<x)
			{
				if(a[i]==b[i]&&a[i]!=1)
				{
					a[i]-=1;
					k++;
					continue;
				}
			    if(a[i]==b[i]&&a[i]==1)
			    {
			    	a[i]=3;
			    	k++;
			    	continue;
				}
				if(b[i]-a[i]==1||a[i]-b[i]==2)
				continue;
			     if(a[i]==1&&b[i]==3)
			     {
			     	a[i]=2;
			     	k++;
			     	continue;
				 }
				 if(a[i]==2&&b[i]==1)
				 {
				 	a[i]=3;
				 	k++;
				 	continue;
				  } 
				 if(a[i]==3&&b[i]==2)
				 {
				 	a[i]=1;
				 	k++;
				 	continue;
				  } 
			}
			if(k==x)
			{ 
			  if(d<x)
			  {
			  	if(a[i]==b[i]&&a[i]!=3)
				{
					b[i]+=1;
					d++;
					continue;
				}
			    if(a[i]==b[i]&&a[i]==3)
			    {
			    	b[i]=1;
			    	d++;
			    	continue;
				}
				if(b[i]-a[i]==1||a[i]-b[i]==2)
					continue;
			     if(a[i]==1&&b[i]==3)
			     {
			     	b[i]=2;
			     	d++;
			     	continue;
				 }
				 if(a[i]==2&&b[i]==1)
				 {
				 	b[i]=3;
				 	d++;
				 	continue;
				  } 
				 if(a[i]==3&&b[i]==2)
				 {
				 	b[i]=1;
				 	k++;
				 	continue;
				  } 
			  }
				}
		}
		printf("%d\n",2*x);
		for(int i=1;i<=2*x;i++)
		printf("%d ",a[i]);
		printf("\n");
		for(int i=1;i<=2*x;i++)
		printf("%d ",b[i]);
		printf("\n"); 
	}
 } 

我认为这应该没有问题，把平局，输局，赢局三种情况列举出来.

但还是不太行。

后面采用的代码才行：

#include<stdio.h>
int a[1000000];
int b[1000000];
int main()
{
	int n;
	scanf("%d",&n);
	for(int j=0;j<n;j++)
	{
		int x;
		scanf("%d",&x);
		for(int i=1;i<=2*x;i++)
		scanf("%d",&a[i]);
		for(int i=1;i<=2*x;i++)
		scanf("%d",&b[i]);
		printf("%d\n",2*x);
		for(int i=1;i<=x;i++)
		{
		if(b[i]==1)
		a[i]=3;
		if(b[i]==2)
		a[i]=1;
		if(b[i]==3)
		a[i]=2; 
	}
	     for(int i=x+1;i<=x*2;i++)
	     {
		 if(a[i]==1)
	     b[i]=2;
	     if(a[i]==2)
	     b[i]=3;
	     if(a[i]==3)
	     b[i]=1;
	}
	 for(int i=1;i<=2*x;i++)
	 printf("%d ",a[i]);
	 printf("\n"); 
	 for(int i=1;i<=x*2;i++)
	 printf("%d ",b[i]);
	 printf("\n");
 } 
}

即前n个数据，不论a中的值，判断b中的值，对a进行改变。

后n个数据，不论b中的值，判断a中的值对b进行改变。

今日总结：今天学习比较少，主要是在理解，而且复习了之前学习的直接插入排序，感觉印象更加深刻了。