20240504训练题解

B. Memory

Singing a song with cups of drink, That days are short is what I think. They are like dews in morning early, Therefore, I feel suffered for time gone surely.

Little G used to be a participant in programming contests and he had attended $n$ contests in total, and for the $i$-th contest, Little G got $a_i$ happiness. However, Little G would also be influenced by past contests since memory also plays an important role to influence one’s mood. So we can use following formula to value Little G’s mood after the $i$-th contest:

$$Mood(i)=\sum _{j=1}^i{2}^{j-i}\times a_j$$

Now Little G is recalling the past and is curious about the moods after every contest, so he wants to tag the moods for every contest. Specifically, Little G will tag a positive sign (“+”) for the $i$-th contest if KaTeX parse error: Expected 'EOF', got '&' at position 9: Mood(i) &̲gt; 0, or tag a negative sign (“-”) if KaTeX parse error: Expected 'EOF', got '&' at position 9: Mood(i) &̲lt; 0, or tag a zero (“0”) if $Mood(i)=0$. But Little G is busy working and working, so he is now asking you, the best programming contestant, to help him tag the moods.
Input

The first line contains one integers $n$ ($1\le n\le 10^5$), denoting the number of contests Little G had attended.

The second line contains $n$ integers $a_1,a_2,\dots ,a_n$ ($-10^9\le a_i\le 10^9$), denoting the happiness values after every contest.
Output

Output one line containing a string which is of length $n$ and only contains “+”, “-” or “0”, denoting the mood tags after every contest.

解题思路

特别处理浮点数

AC代码

#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
double a[N],b[N];
int main()
{
	int n,x;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>x;
		int t=(int)a[i-1];
		double tt=a[i-1]-t;
		if(tt<0)	a[i-1]=t/2-0.5;
		else if(tt>0)	a[i-1]=t/2+0.5;
		else a[i-1]=(double)t/2;
		a[i]=a[i-1]+x;
		if(a[i]==0)	cout<<"0";
		else if(a[i]>0)	cout<<"+";
		else if(a[i]<0)	cout<<"-";
	}
	return 0;
}

L - Palm Island

Toph is playing a card game. She has $n$ cards and each card has a unique number of $1,2\cdots n$. In this game, Toph can operate the deck of the cards. We may wish to assume that the cards from the top to the bottom of the deck are $p_1,p_2,\cdots p_n$ (a permutation), then each operation must be one of the following two cases:

1. Place the top card at the bottom of the deck, that is, change the order of the deck into $p_2,p_3\cdots p_n,p_1$.
2. Place the second card from the top at the bottom of the deck, that is, change the order of the deck into $p_1,p_3\cdots p_n,p_2$

Now, you know that the initial order(from top to bottom) of Toph’s deck is $a_1,a_2,\cdots a_n$, and Toph wants to change the order of the deck into $b_1,b_2,\cdots b_n$ after some operations. Please construct the operation sequence to help Toph implement the change.

Toph has no patience. So the number of operations should not exceed $n^2$.

Input

The first line contains an integer $T$ , indicating the number of test cases.

For each test case:

• The first line contains an integer, $n(3\le n\le 1000)$, indicating the number of Toph’s cards.
• The second line contains $n$ integers $a_1,a_2,\cdots a_n$, a permutation indicating the order of the deck initially.
• The third line contains $n$ integers $b_1,b_2,\cdots b_n$, a permutation indicating the order of the deck want to make.

It is guaranteed that the sum of $n$ in $T$ test cases is not exceed $1000$.

Output

For each test case:

• Output a line, which contains a string s 1 s 2 … s k ( s i ∈ { 1 , 2 } ,   1 ≤ i ≤ k ) s_1s_2\dots s_k(s_i\in \{1,2\},\ 1\le i\le k) s1​s2​…sk​(si​∈{1,2}, 1≤i≤k) as your operation sequence. The length of the string should not exceed $n^2$, or you will get “Wrong Answer”.
• If there are multiple solutions, output any of them.

解题思路

冒泡排序的理解

AC代码

#include<bits/stdc++.h>
using namespace std;
const int N=1e5;
long long a[N],b[N],c[N];
int main()
{
	int t;
	cin>>t;
	while(t--)
	{
		int n;
		cin>>n;
		for(int i=1;i<=n;i++){
			cin>>a[i];
		}
		for(int i=1;i<=n;i++)
		{
			cin>>b[i];
			c[b[i]]=i;
		}
		for(int i=1;i<=n;i++)
		{
			for(int j=1;j<=n-1;j++)
			{
				if(c[a[j]]>c[a[j+1]])
				{
					cout<<"2";
					swap(a[j],a[j+1]);
				}
				else	cout<<"1";
			}
			cout<<"1";
		}
		cout<<endl;
	}
	return 0;
}

M - Painter

Little G is a painter and is painting on a 2D plane. Each integral point has a color character and the initial color characters for all integral points are “.”(ASCII = 46). Now Little G is planning to do some operations one by one, where each operation is in one of the following three types:

1. “Circle $xyrcol$”, which means to draw a circle. Formally, change the color characters to $col$ for these points $(u,v)$ that $(u-x{)}^2+(v-y{)}^2\le r^2$.
2. “Rectangle $x_1{y}_1{x}_2{y}_{2}col$”, which means to draw a rectangle. Formally, change the color characters to $col$ for these points $(u,v)$ that $x_1\le u\le x_2,y_1\le v\le y_2$.
3. “Render $x_1{y}_1{x}_2{y}_2$”, which means to render the image of given region. Formally, print the color characters for these points $(u,v)$ that $x_1\le u\le x_2,y_1\le v\le y_2$.

But now, Little G is busy replying clarifications, so could you help him and be the painter?

Little G is a painter and is painting on a 2D plane. Each integral point has a color character and the initial color characters for all integral points are “.”(ASCII = 46). Now Little G is planning to do some operations one by one, where each operation is in one of the following three types:

1. “Circle $xyrcol$”, which means to draw a circle. Formally, change the color characters to $col$ for these points $(u,v)$ that $(u-x{)}^2+(v-y{)}^2\le r^2$.
2. “Rectangle $x_1{y}_1{x}_2{y}_{2}col$”, which means to draw a rectangle. Formally, change the color characters to $col$ for these points $(u,v)$ that $x_1\le u\le x_2,y_1\le v\le y_2$.
3. “Render $x_1{y}_1{x}_2{y}_2$”, which means to render the image of given region. Formally, print the color characters for these points $(u,v)$ that $x_1\le u\le x_2,y_1\le v\le y_2$.

But now, Little G is busy replying clarifications, so could you help him and be the painter?

Output

For each rendering operation “Render $x_1{y}_1{x}_2{y}_2$”, print $y_2-y_1+1$ lines each containing one string of length $x_2-x_1+1$, denoting the region image(from row $y_2$ to row $y_1$).

解题思路

先保存更改记录，最后输出时判断

AC代码

# include <bits/stdc++.h>
using namespace std;
struct rect
{
	int x,y;
	int x1,y1;
	int r;
	int flag;
	char l;
}d[2100];
int check(int u,int v,int x,int y,int r)
{
	if((x-u)*(x-u)+(y-v)*(y-v)<=r*r)	return 1;
	else	return 0;
}
int check1(int u,int v,int x,int x1,int y,int y1)
{
	if(u>=x&&u<=x1&&v>=y&&v<=y1)    return 1;
	else    return 0;
}
signed  main()
{
	int n;
	cin>>n;
	int m=0;
	for(int i=1; i<=n; i++)
	{
		string s;
		cin>>s;
		if(s=="Circle")
		{
			cin>>d[m].x>>d[m].y>>d[m].r;
			d[m].flag=1;
			cin>>d[m].l;
			m++;
		}
		else if(s=="Rectangle")
		{
			cin>>d[m].x>>d[m].y>>d[m].x1>>d[m].y1;
			d[m].flag=2;
			cin>>d[m].l;
			m++;
		}
		else
		{
			int x,y,x1,y1;
			cin>>x>>y>>x1>>y1;
			for(int i=y1; i>=y; i--)
			{
				for(int j=x; j<=x1; j++)
				{
					char o='.';
					for(int z=m-1; z>=0; z--)
					{
						if(d[z].flag==1)
						{
							if(check(j,i,d[z].x,d[z].y,d[z].r))
							{
								o=d[z].l;
								break;
							}

						}
						else if(d[z].flag==2)
						{
							if(check1(j,i,d[z].x,d[z].x1,d[z].y,d[z].y1))
							{
								o=d[z].l;
								break;
							}
						}
					}
					cout<<o;
				}
				cout<<endl;
			}
		}
	}
    return 0;
}