【比赛报告】 Codeforces Round #512 (Div. 2, based on Technocup 2019 Elimination Round 1) NOIP练习赛卷四

比赛链接

A.In Search of an Easy Problem

Description

When preparing a tournament, Codeforces coordinators try treir best to make the first problem as easy as possible. This time the coordinator had chosen some problem and asked n people about their opinions. Each person answered whether this problem is easy or hard.

If at least one of these n people has answered that the problem is hard, the coordinator decides to change the problem. For the given responses, check if the problem is easy enough.

Input

The first line contains a single integer n (1≤n≤100) — the number of people who were asked to give their opinions.

The second line contains n integers, each integer is either 0 or 1. If i-th integer is 0, then i-th person thinks that the problem is easy; if it is 1, then i-th person thinks that the problem is hard.

Output

Print one word: “EASY” if the problem is easy according to all responses, or “HARD” if there is at least one person who thinks the problem is hard.

You may print every letter in any register: “EASY”, “easy”, “EaSY” and “eAsY” all will be processed correctly.

Examples

Input

3
0 0 1

Output

HARD

Input

1
0

Output

EASY

Note

In the first example the third person says it’s a hard problem, so it should be replaced.

In the second example the problem easy for the only person, so it doesn’t have to be replaced.

---

#include<cstdio>
int main()
{
	int n,a;
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&a);
		if(a==1)return puts("HARD"),0;
	}
	return puts("EASY"),0;
}

总结

无

---

B.Vasya and Cornfield

Description

Vasya owns a cornfield which can be defined with two integers n and d. The cornfield can be represented as rectangle with vertices having Cartesian coordinates (0,d),(d,0),(n,n−d) and (n−d,n).

An example of a cornfield with n=7 and d=2.
Vasya also knows that there are m grasshoppers near the field (maybe even inside it). The i-th grasshopper is at the point (xi,yi). Vasya does not like when grasshoppers eat his corn, so for each grasshopper he wants to know whether its position is inside the cornfield (including the border) or outside.

Help Vasya! For each grasshopper determine if it is inside the field (including the border).

Input

The first line contains two integers n and d (1≤d<n≤100).

The second line contains a single integer m (1≤m≤100) — the number of grasshoppers.

The i-th of the next m lines contains two integers xi and yi (0≤xi,yi≤n) — position of the i-th grasshopper.

Output

Print m lines. The i-th line should contain “YES” if the position of the i-th grasshopper lies inside or on the border of the cornfield. Otherwise the i-th line should contain “NO”.

You can print each letter in any case (upper or lower).

Examples

Input

7 2
4
2 4
4 1
6 3
4 5

Output

YES
NO
NO
YES

Input

8 7
4
4 4
2 8
8 1
6 1

Output

YES
NO
YES
YES

Note

The cornfield from the first example is pictured above. Grasshoppers with indices 1 (coordinates (2,4)) and 4 (coordinates (4,5)) are inside the cornfield.

The cornfield from the second example is pictured below. Grasshoppers with indices 1 (coordinates (4,4)), 3 (coordinates (8,1)) and 4 (coordinates (6,1)) are inside the cornfield.

---

一道线性规划题。$\forall p(x,y)$，点 $p$ 在四条直线围成的矩形中，当且仅当 $x,y$ 满足以下约束条件：
$$\{\begin{array}{l}x+y-d\ge 0\\ x+y-2n+d\le 0\\ x-y-d\le 0\\ x-y+d\ge 0\end{array}$$
然后读入每个点判断就行了。

#include<cstdio>
int main()
{
	//freopen("in.txt","r",stdin);
	int n,d,x,y,m;
	scanf("%d%d%d",&n,&d,&m);
	while(m--)
	{
		scanf("%d%d",&x,&y);
		if(x+y-d<0||x+y-2*n+d>0||x-y-d>0||x-y+d<0)puts("NO");
		else puts("YES");
	}
	return 0;
}

总结

我不碰数学好多年

---

C.Vasya and Golden Ticket

Description

Recently Vasya found a golden ticket — a sequence which consists of $n$ digits $\overline{a_1{a}_2\cdots a_n}$. Vasya considers a ticket to be lucky if it can be divided into two or more non-intersecting segments with equal sums. For example, ticket $350178$ is lucky since it can be divided into three segments $350$, $17$ and $8$: $3+5+0=1+7=8$. Note that each digit of sequence should belong to exactly one segment.

Help Vasya! Tell him if the golden ticket he found is lucky or not.

Input

The first line contains one integer $n$ ($2\le n\le 100$) — the number of digits in the ticket.

The second line contains $n$ digits $\overline{a_1{a}_2\cdots a_n}$ ($0\le a_i\le 9$) — the golden ticket. Digits are printed without spaces.

Output

If the golden ticket is lucky then print “YES”, otherwise print “NO” (both case insensitive).

Examples

Input

5
73452

Output

YES

Input

4
1248

Output

NO

Note

In the first example the ticket can be divided into $7$, $34$ and $52$: $7=3+4=5+2$.

In the second example it is impossible to divide ticket into segments with equal sum.

---

区间DP。设 $F[pos]$ 表示 $pos$ 位是否可以作为一段的结尾。

#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
int n,sum[110];
bool f[110];
char ch;
int main()
{
    std::ios::sync_with_stdio(false);
    cin>>n;
    for(int i=1;i<=n;i++)
        cin>>ch,sum[i]=sum[i-1]+ch-'0';
    if(sum[n]==0)return puts("YES"),0;
	for(int i=0;i<sum[n];i++)
    {
    	memset(f,false,sizeof(f));
    	f[0]=true;
    	for(int t=1;t<=n;t++)
    	    for(int h=t;h;h--)
    	        if(f[h-1]&&sum[t]-sum[h-1]==i)
    	            f[t]=true;
    	if(f[n]==true)return puts("YES"),0;
	}
	return puts("NO"),0;
}

总结

原本想暴力的，结果错了……刚好写写DP

---

D.Vasya and Triangle

题目链接

Description

Vasya has got three integers $n$, $m$ and $k$. He’d like to find three integer points $(x_1,y_1)$, $(x_2,y_2)$, $(x_3,y_3)$, such that $0\le x_1,x_2,x_3\le n$, $0\le y_1,y_2,y_3\le m$ and the area of the triangle formed by these points is equal to nmk.

Help Vasya! Find such points (if it’s possible). If there are multiple solutions, print any of them.

Input

The single line contains three integers $n$, $m$, $k$ $(1\le n,m\le 10^9,2\le k\le 10^9)$.

Output

If there are no such points, print “NO”.

Otherwise print “YES” in the first line. The next three lines should contain integers $x_i,y_i$ — coordinates of the points, one point per line. If there are multiple solutions, print any of them.

You can print each letter in any case (upper or lower).

Examples

Input

4 3 3

Output

YES
1 0
2 3
4 1

Input

4 4 7

Output

NO

Note

In the first example area of the triangle should be equal to $\frac{n\times m}{k}=4$. The triangle mentioned in the output is pictured below:

In the second example there is no triangle with area $\frac{n\times m}{k}=\frac{16}{7}$.

---

让第一个点落在原点，第二个点落在 $x$ 轴，第三个点落在 $y$ 轴，即三个点的坐标为 $(0,0),(x,0),(0,y)$，面积 $S=\frac{x\times y}{2}$。化简可得 $x\times y=\frac{2\times n\times m}{k}$，即 $k\mid 2\times n\times m$，$gcd$ 即可求解。

#include<cstdio>
typedef long long ll;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
int main()
{
    ll n,m,k;bool div=false;
    scanf("%lld%lld%lld",&n,&m,&k);
    if(2*n*m%k)return puts("NO"),0;
    if(k%2==0)k/=2,div=true;
    ll g=gcd(n,k);k/=g;
    ll x=n/g,y=m/k;
    if(!div)if(2*x<n)x*=2;else y*=2;
    printf("YES\n0 0\n%lld 0\n0 %lld\n",x,y);
    return 0;
}

总结

又考数学

---

E.Vasya and Good Sequences

Description

Vasya has a sequence a consisting of $n$ integers $a_1,a_2,\cdots ,a_n$. Vasya may pefrom the following operation: choose some number from the sequence and swap any pair of bits in its binary representation. For example, Vasya can transform number $6$ $(\cdots 00000000110_2)$ into $3$ $(\cdots 00000000011_2)$, $12$ $(\cdots 000000001100_2)$, $1026$ $(\cdots 10000000010_2)$ and many others. Vasya can use this operation any (possibly zero) number of times on any number from the sequence.

Vasya names a sequence as good one, if, using operation mentioned above, he can obtain the sequence with bitwise exclusive or of all elements equal to $0$.

For the given sequence $a_1,a_2,\cdots ,a_n$ Vasya’d like to calculate number of integer pairs $(l,r)$ such that $1\le l\le r\le n$ and sequence $a_l,a_{l+1},\cdots ,a_r$ is good.

Input

The first line contains a single integer $n$ $(1\le n\le 3\times 10^5)$ — length of the sequence.

The second line contains $n$ integers $a_1,a_2,\cdots ,a_n$ $(1\le a_i\le 10^{18})$ — the sequence a.

Output

Print one integer — the number of pairs $(l,r)$ such that $1\le l\le r\le n$ and the sequence $a_l,a_{l+1},\cdots ,a_r$ is good.

Examples

Input

3
6 7 14

Output

2

Input

4
1 2 1 16

Output

4

Note

In the first example pairs $(2,3)$ and $(1,3)$ are valid. Pair $(2,3)$ is valid since $a_2=7\to 11$, $a_3=14\to 11$ and $11\oplus 11=0$, where $\oplus$ — bitwise exclusive or. Pair $(1,3)$ is valid since $a_1=6\to 3$, $a_2=7\to 13$, $a_3=14\to 14$ and $3\oplus 13\oplus 14=0$.

In the second example pairs $(1,2)$, $(2,3)$, $(3,4)$ and $(1,4)$ are valid.

---

一个区间内想要异或得到 $0$，该区间内 $1$ 要有偶数个，且 $1$ 最多的数不能超过和的一半。
记 $cnt[0][i]$ 表示 $i\sim n$中偶数个 $1$ 的后缀和， $cnt[1][i]$ 同理。

#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
const int N=3e5+10;
int n;
ll a[N],cnt[2][N];
inline int getone(ll x){int ret=0;while(x)ret++,x-=x&-x;return ret;}
int main()
{
	//freopen("in.txt","r",stdin);
    scanf("%d",&n);
    for(int i=0;i<n;i++)
        scanf("%lld",&a[i]),a[i]=getone(a[i]);
    cnt[0][n]=1;
    ll ans=0,sum=0;
    for(int i=n-1;i>=0;i--)
    {
    	ll onesum=0,maxn=0,pir=0;
    	for(int j=i;j<n&&j-i<65;j++)
    	{
    		onesum+=a[j];maxn=max(maxn,a[j]);
    		if(maxn*2>onesum&&onesum%2==0)pir--;
		}
		sum+=a[i];pir+=cnt[sum&1][i+1];ans+=pir;
		cnt[0][i]=cnt[0][i+1];
		cnt[1][i]=cnt[1][i+1];
		if(sum&1)cnt[1][i]++;
		else cnt[0][i]++;
	}
	printf("%lld\n",ans);
	return 0;
}

总结

学了一波骚操作

---

F.Putting Boxes Together

题目链接

Description

There is an infinite line consisting of cells. There are n boxes in some cells of this line. The $i_{th}$ box stands in the cell $a_i$ and has weight $w_i$. All $a_i$ are distinct, moreover, $a_{i-1}<a_i$ holds for all valid $i$.

You would like to put together some boxes. Putting together boxes with indices in the segment $[l,r]$ means that you will move some of them in such a way that their positions will form some segment 4[x,x+(r−l)]$.

In one step you can move any box to a neighboring cell if it isn’t occupied by another box (i.e. you can choose $i$ and change $a_i$ by $1$, all positions should remain distinct). You spend $w_i$ units of energy moving the box $i$ by one cell. You can move any box any number of times, in arbitrary order.

Sometimes weights of some boxes change, so you have queries of two types:

$id$ $nw$ — weight $w_{id}$ of the box $id$ becomes $nw$.
$l$ $r$ — you should compute the minimum total energy needed to put together boxes with indices in $[l,r]$. Since the answer can be rather big, print the remainder it gives when divided by $1000000007=10^9+7$. Note that the boxes are not moved during the query, you only should compute the answer.
Note that you should minimize the answer, not its remainder modulo $10^9+7$. So if you have two possible answers $2\cdot 10^9+13$ and $2\cdot 10^9+14$, you should choose the first one and print $10^9+6$, even though the remainder of the second answer is $0$.

Input

The first line contains two integers $n$ and $q$ $(1\le n,q\le 2\times 10^5)$ — the number of boxes and the number of queries.

The second line contains $n$ integers $a_1,a_2,\cdots ,a_n$ $(1\le a_i\le 10^9)$ — the positions of the boxes. All ai are distinct, $a_{i-1}<a_i$ holds for all valid $i$.

The third line contains $n$ integers $w_1,w_2,\cdots ,w_n$ $(1\le w_i\le 10^9)$ — the initial weights of the boxes.

Next $q$ lines describe queries, one query per line.

Each query is described in a single line, containing two integers $x$ and $y$. If $x<0$, then this query is of the first type, where $id=-x$, $nw=y$ $(1\le id\le n,1\le nw\le 10^9)$. If $x>0$, then the query is of the second type, where $l=x$ and $r=y$ $(1\le l_j\le r_j\le n)$. $x$ can not be equal to $0$.

Output

For each query of the second type print the answer on a separate line. Since answer can be large, print the remainder it gives when divided by $1000000007=10^9+7$.

Example

Input

5 8
1 2 6 7 10
1 1 1 1 2
1 1
1 5
1 3
3 5
-3 5
-1 10
1 4
2 5

Output

0
10
3
4
18
7

Note

Let’s go through queries of the example:

$11$ — there is only one box so we don’t need to move anything.
$15$ — we can move boxes to segment $[4,8]:1\times |1-4|+1\times |2-5|+1\times |6-6|+1\times |7-7|+2\times |10-8|=10$.
$13$ — we can move boxes to segment $[1,3]$.
$35$ — we can move boxes to segment $[7,9]$.
$-35$ — $w_3$ is changed from $1$ to $5$.
$-110$ — $w_1$ is changed from $1$ to $10$. The weights are now equal to $w=[10,1,5,1,2]$.
$14$ — we can move boxes to segment $[1,4]$.
$25$ — we can move boxes to segment $[5,8]$.

---

第一次遇到带权中位数的题，学习了大佬博客

#include<cstdio>
#include<cmath>
using namespace std;
typedef long long ll;
const int N=2e5+10;
const int mod=1e9+7;
int n,q;
ll a[N],w[N],c[N<<1][2];
inline void add(int x,ll v,int id)
{
	if(!id)for(;x<=n;x+=x&-x)c[x][id]+=v;
	else for(;x<=n;x+=x&-x)c[x][id]=(c[x][id]+v+mod)%mod;
}
inline ll ask(int x,int id)
{
	ll ret=0;
	if(!id)for(;x;x-=x&-x)ret+=c[x][id];
	else for(;x;x-=x&-x)ret=(ret+c[x][id]+mod)%mod;
	return ret;
}
inline ll gets(int x,int y,int id)
{
	if(!id)return y>=x?ask(y,id)-ask(x-1,id):0;
	else return (ask(y,id)-ask(x-1,id)+mod)%mod;
}
inline int bsearch(int x,int y)
{
	int l=x,r=y,mid;
	while(l<r)
	{
		mid=(l+r)/2;
		if(gets(x,mid,0)>=gets(mid+1,y,0))r=mid;
		else l=mid+1;
	}
	return r;
}
int main()
{
	//freopen("in.txt","r",stdin);
    scanf("%d%d",&n,&q);
    for(register int i=1;i<=n;i++)scanf("%lld",&a[i]);
    for(register int i=1;i<=n;i++)scanf("%lld",&w[i]),add(i,w[i],0),add(i,w[i]*(a[i]-i),1);
    while(q--)
    {
    	int x,y;
    	scanf("%d%d",&x,&y);
    	if(x<0)
    	{
    		x=-x;
			add(x,-w[x],0);add(x,-w[x]*(a[x]-x),1);
    		w[x]=y;
    		add(x,w[x],0);add(x,w[x]*(a[x]-x),1);
		}
		else
		{
			if(x==y){puts("0");continue;}
			ll pos=bsearch(x,y),ans=0;
			ans=(ans+(gets(x,pos,0)%mod)*(int)abs(a[pos]-pos)%mod-gets(x,pos,1)+mod)%mod;
		    ans=(ans-(gets(pos,y,0)%mod)*(int)abs(a[pos]-pos)%mod+gets(pos,y,1)+mod)%mod;
		    printf("%lld\n",ans);
		}
	}
	return 0;
}

总结

第一次遇到带权中位数的题，好好学学。

---

G.Linear Congruential Generator

Description

You are given a tuple generator $f^{(k)}=(f_1^{(k)},f_2^{(k)},\cdots ,f_n^{(k)})$, where $f_i^{(k)}=(a_i\cdot f_i^{(k-1)}+b_i)\mathrm{m}\mathrm{o}\mathrm{d}{p}_i$ and $f^{(0)}=(x_1,x_2,\cdots ,x_n)$. Here $x\mathrm{m}\mathrm{o}\mathrm{d}y$ denotes the remainder of $x$ when divided by $y$. All $p_i$ are primes.

One can see that with fixed sequences $x_i,y_i,a_i$ the tuples $f^{(k)} starting from some index will repeat tuples with smaller indices. Calculate the maximum number of different tuples (from all $f^{(k)}$ for $k\ge 0$) that can be produced by this generator, if $x_i,a_i,b_i$ are integers in the range $[0,p_i-1]$ and can be chosen arbitrary. The answer can be large, so print the remainder it gives when divided by $10^9+7$

Input

The first line contains one integer $n$ $(1\le n\le 2\times 105)$ — the number of elements in the tuple.

The second line contains $n$ space separated prime numbers — the modules $p_1,p_2,\cdots ,p_n$ $(2\le p_i\le 2\times 10^6)$.

Output

Print one integer — the maximum number of different tuples modulo $10^9+7$.

Examples

Input

4
2 3 5 7

Output

210

Input

3
5 3 3

Output

30

Note

In the first example we can choose next parameters: $a=[1,1,1,1],b=[1,1,1,1],x=[0,0,0,0]$, then $f_i^{(k)}=k\mathrm{m}\mathrm{o}\mathrm{d}{p}_i$.

In the second example we can choose next parameters: $a=[1,1,2],b=[1,1,0],x=[0,0,1]$.

---

感觉整道题非常玄学。在围观大佬题解和官方题解后，大概明白了啥意思。这个函数图像是一个圆圈还有圈外的一部分。最后答案是$lc{m}_{i=1\cdots n}(c_i)$+$\underset{i=1\cdots n}{\max }(p{p}_i)$。中间噼里啪啦一堆公式看的我酸爽，反正就证明了 $\underset{i=1\cdots n}{\max }(p{p}_i)=1$以及我们需要 $p_i-1$ 的因子。然后就是求一个 $lcm$，如果 $p_i$ 加过了就加 $p_i-1$，然后就稀里糊涂写（抄）一遍就过了。

#include<cstdio>
#include<algorithm>
using namespace std;
const int N=2e6+10;
const int mod=1e9+7;
int prime[N],pp,pri[N],ans=1,p[N],n,cnt[N],mx[N];
bool iscomp[N];
void primetable()
{
	for(int i=2;i<N;i++)
	{
		if(!iscomp[i])prime[pp++]=i,pri[i]=i;
		for(int j=0;j<pp&&1ll*i*prime[j]<N;j++)
		{
			iscomp[i*prime[j]]=1;
			pri[i*prime[j]]=prime[j];
			if(i%prime[j]==0)break;
		}
	}
}
int main()
{
	//freopen("in.txt","r",stdin);
	primetable();
	scanf("%d\n",&n);
	for(int i=1;i<=n;i++)scanf("%d",&p[i]);
    sort(p+1,p+n+1);
    for(int i=n;i;i--)
    {
    	if(!cnt[p[i]])cnt[p[i]]++,mx[p[i]]=1,ans=(1ll*ans*p[i])%mod;
    	else
    	{
    		int v=--p[i];
    		while(v!=1)
    		{
    			int u=pri[v],ci=0;
    			while(v%u==0)v/=u,ci++;
    			if(cnt[u]<ci)
    			{
    				for(int j=cnt[u]+1;j<=ci;j++)ans=(1ll*ans*u)%mod;
    				cnt[u]=ci;mx[u]=1;
				}
				else mx[u]+=(cnt[u]==ci);
			}
		}
	}
	for(int i=1;i<=n;i++)
	{
		int v=p[i],flag=0;
		while(v!=1)
		{
			int u=pri[v],ci=0;
			while(v%u==0)v/=u,ci++;
			if(cnt[u]==ci&&mx[u]==1)flag=1;
		}
		if(!flag)
		{
			ans++;break;
		}
	}
	printf("%d\n",ans);
	return 0;
}

总结

玄学数论，还有那个啥拉格朗日定理是啥……

---

比赛总结

Div.2的比赛题比Div.3要难上不少。感觉这场比赛考了贼多数学知识。带权中位数啥的东西要好好掌握，还有一些别的骚操作啥的。