个人积分赛2（11,24）

先谈谈自己的感觉吧，这次我感觉题比以前的要难，有些题比较坑，比如e题，下面就是题解了。

Alex and a Rhombus  签到题

这个题就是找规律：第一个是1，然后以后每一个都是前面的加上第（i-1）*4

code：

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
ll a[110];
int main()
{
	ll n;
	cin>>n;
	a[1]=1;
	ll sum=1;
	if(n==1){
		cout<<1<<endl;
		return 0;
	}
	for(int i=2;i<=n;i++){
		a[i]=(i-1)*4;
		sum+=a[i];
	}
	cout<<sum<<endl;
	
	return 0;
}

Nick and Array

 

Nick had received an awesome array of integers a=[a1,a2,…,an]a=[a1,a2,…,an] as a gift for his 55 birthday from his mother. He was already going to explore its various properties but after unpacking he was disappointed a lot because the product a1⋅a2⋅…ana1⋅a2⋅…an of its elements seemed to him not large enough.

He was ready to throw out the array, but his mother reassured him. She told him, that array would not be spoiled after the following operation: choose any index ii (1≤i≤n1≤i≤n) and do ai:=−ai−1ai:=−ai−1.

For example, he can change array [3,−1,−4,1][3,−1,−4,1] to an array [−4,−1,3,1][−4,−1,3,1] after applying this operation to elements with indices i=1i=1 and i=3i=3.

Kolya had immediately understood that sometimes it's possible to increase the product of integers of the array a lot. Now he has decided that he wants to get an array with the maximal possible product of integers using only this operation with its elements (possibly zero, one or more times, as many as he wants), it is not forbidden to do this operation several times for the same index.

Help Kolya and print the array with the maximal possible product of elements a1⋅a2⋅…ana1⋅a2⋅…an which can be received using only this operation in some order.

If there are multiple answers, print any of them.

Input

The first line contains integer nn (1≤n≤1051≤n≤105) — number of integers in the array.

The second line contains nn integers a1,a2,…,ana1,a2,…,an (−106≤ai≤106−106≤ai≤106) — elements of the array

Output

Print nn numbers — elements of the array with the maximal possible product of elements which can be received using only this operation in some order from the given array.

If there are multiple answers, print any of them.

Examples

Input

4
2 2 2 2

Output

-3 -3 -3 -3 

Input

1
0

Output

0 

Input

3
-3 -3 2

Output

-3 -3 2 

题意：给你一个数组，然后数组中的每一个数都可以进行以下操作a[i]=-a[i]-1,当然你也可以不用这样做，使得数组中数相乘最大

思：先把大于等于0的数转化为负数，然后判断负数的个数的奇偶性，如果是偶数就不用变化，如果是奇数将最小的数变为正数，当时做题找的是最大的数气死我了。

code：

#include<bits/stdc++.h> 

using namespace std;

const int maxn=1e5+10;
vector<int> v;
//vector<int> v2;
int a[maxn];
int main()
{
	int n;
	cin>>n;
	int idex1=0,idex2=0;
	for(int i=0;i<n;i++){
		cin>>a[i];
		if(a[i]>=0){
			idex1++;
			a[i]=-a[i]-1;
			v.push_back(a[i]);	
		}
		else{
			idex2++;
			v.push_back(a[i]);
		}
	}
	if((idex1+idex2)%2==1){
		sort(v.begin(),v.end());
		int len=v.size();
		int t=v[0];
//		cout<<t<<endl;
		for(int i=0;i<n;i++){
			if(t==a[i]) {
				a[i]=-a[i]-1;
				break;
			}	
		}
	}
	int flag=0;
	for(int i=0;i<n;i++){
		if(i==n-1) flag=1;
		if(!flag) cout<<a[i]<<" ";
		else cout<<a[i];
	}
	return 0;
	
}

Pairs

 

Toad Ivan has mm pairs of integers, each integer is between 11 and nn, inclusive. The pairs are (a1,b1),(a2,b2),…,(am,bm)(a1,b1),(a2,b2),…,(am,bm).

He asks you to check if there exist two integers xx and yy (1≤x<y≤n1≤x<y≤n) such that in each given pair at least one integer is equal to xx or yy.

Input

The first line contains two space-separated integers nn and mm (2≤n≤3000002≤n≤300000, 1≤m≤3000001≤m≤300000) — the upper bound on the values of integers in the pairs, and the number of given pairs.

The next mm lines contain two integers each, the ii-th of them contains two space-separated integers aiaiand bibi (1≤ai,bi≤n,ai≠bi1≤ai,bi≤n,ai≠bi) — the integers in the ii-th pair.

Output

Output "YES" if there exist two integers xx and yy (1≤x<y≤n1≤x<y≤n) such that in each given pair at least one integer is equal to xx or yy. Otherwise, print "NO". You can print each letter in any case (upper or lower).

Examples

Input

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

Output

NO

Input

5 4
1 2
2 3
3 4
4 5

Output

YES

Input

300000 5
1 2
1 2
1 2
1 2
1 2

Output

YES

Note

In the first example, you can't choose any xx, yy because for each such pair you can find a given pair where both numbers are different from chosen integers.

In the second example, you can choose x=2x=2 and y=4y=4.

In the third example, you can choose x=1x=1 and y=2y=2.

题意：给你m对数，然后让你求是否存在一对数（x，y）使得要么x等于m对中的一个数，要么y等于m对中的一个数。如果存在则输出yes否则输出no。

思路：把第一对数付给，t1，t2然后再到一对与t1和t2不同的数t3和t4，如果找不到t3，t4，就把t1给t3，t2给t4然后就有4中情况

1.（t1，t3）2.（t1，t4） 3.（t2，t3） 4.（t2，t4）

code

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
//const ll maxn=3e5+10;
vector<pair<int,int> > ve;
ll n,m;
//ll a[110];
bool check(int a ,int b){
	for(int i=0;i<m;i++){
		if(a!=ve[i].first&&a!=ve[i].second&&b!=ve[i].first&&b!=ve[i].second){
			return 0;
		}
	}
	return 1;
}
int main()
{
	pair<int,int> p;
	cin>>n>>m;
	for(int i=0;i<m;i++){
		cin>>p.first>>p.second;
		ve.push_back(p);
	}
	int t1=ve[0].first,t2=ve[0].second;
	int t3=0,t4=0;
	int flag1=0,flag=0;
	int t=0;
	for(int i=1;i<m;i++){
		if( t1==ve[i].first||ve[i].second==t1||ve[i].second==t2||ve[i].first==t2){
			flag1=0;
		} 
		else{
			t=i;
			flag1=1;
			break;
		} 
	}
	if(flag1) t3=ve[t].first,t4=ve[t].second;
	else{
		t3=t1;
		t4=t2;
	}
	if(check(t1,t3)||check(t1,t4)||check(t2,t3)||check(t2,t4)){
		flag=1;
	}
	if(flag) cout<<"YES"<<endl;
	else cout<<"NO"<<endl;
	return 0;
}

Kefa and Park 
 

Kefa decided to celebrate his first big salary by going to the restaurant.

He lives by an unusual park. The park is a rooted tree consisting of n vertices with the root at vertex 1. Vertex 1 also contains Kefa's house. Unfortunaely for our hero, the park also contains cats. Kefa has already found out what are the vertices with cats in them.

The leaf vertices of the park contain restaurants. Kefa wants to choose a restaurant where he will go, but unfortunately he is very afraid of cats, so there is no way he will go to the restaurant if the path from the restaurant to his house contains more than m consecutive vertices with cats.

Your task is to help Kefa count the number of restaurants where he can go.

Input

The first line contains two integers, n and m (2 ≤ n ≤ 105, 1 ≤ m ≤ n) — the number of vertices of the tree and the maximum number of consecutive vertices with cats that is still ok for Kefa.

The second line contains n integers a1, a2, ..., an, where each ai either equals to 0 (then vertex i has no cat), or equals to 1 (then vertex ihas a cat).

Next n - 1 lines contains the edges of the tree in the format "xi yi" (without the quotes) (1 ≤ xi, yi ≤ n, xi ≠ yi), where xi and yi are the vertices of the tree, connected by an edge.

It is guaranteed that the given set of edges specifies a tree.

Output

A single integer — the number of distinct leaves of a tree the path to which from Kefa's home contains at most m consecutive vertices with cats.

Examples

input

Copy

4 1
1 1 0 0
1 2
1 3
1 4
output

Copy

2
input

Copy

7 1
1 0 1 1 0 0 0
1 2
1 3
2 4
2 5
3 6
3 7
output

Copy

2
Note

Let us remind you that a tree is a connected graph on n vertices and n - 1 edge. A rooted tree is a tree with a special vertex called root. In a rooted tree among any two vertices connected by an edge, one vertex is a parent (the one closer to the root), and the other one is a child. A vertex is called a leaf, if it has no children.

Note to the first sample test:The vertices containing cats are marked red. The restaurants are at vertices 2, 3, 4. Kefa can't go only to the restaurant located at vertex 2.

Note to the second sample test:The restaurants are located at vertices 4, 5, 6, 7. Kefa can't go to restaurants 6, 7.

题意：给你一个n个节点的数，边有n-1条，然后是，叶子节点是餐馆，节点为1的是他的家，然后让你就他能去哪几个餐馆，但是有一个要求，他去的那条路径不能有连续n个猫。

思路：简单dfs暴力即可，注意结束的条件；

#include<bits/stdc++.h>
 
using namespace std;
 
const int maxn=2e5+10;
int vis[maxn];
vector<int> v[maxn];
int a[maxn];
int ans=0;
int n,m;
void dfs(int ve,int cnt){
	if(cnt>m) return;
	vis[ve]=1;
	if(v[ve].size()==1&&ve!=1){
		ans++;
//		cout<<ans<<endl;
		return ;
	}	
	for(int i=0;i<v[ve].size();i++){
		if(vis[v[ve][i]]) continue;
		vis[v[ve][i]]=1;
		if(a[v[ve][i]]==1) dfs(v[ve][i],cnt+1);
		else dfs(v[ve][i],0);
	}
}
int main(){
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	int x,y;
	for(int i=1;i<n;i++){
		cin>>x>>y;
		v[x].push_back(y);
		v[y].push_back(x);
	}
	if(a[1]==1) dfs(1,1);
	else dfs(1,0);
	cout<<ans<<endl;
	return 0;
}