CodeForces - 258D Little Elephant and Broken Sorting

Discription

The Little Elephant loves permutations of integers from 1 to n very much. But most of all he loves sorting them. To sort a permutation, the Little Elephant repeatedly swaps some elements. As a result, he must receive a permutation 1, 2, 3, ..., n.

This time the Little Elephant has permutation p₁, p₂, ..., p_n. Its sorting program needs to make exactly m moves, during the i-th move it swaps elements that are at that moment located at the a_i-th and the b_i-th positions. But the Little Elephant's sorting program happened to break down and now on every step it can equiprobably either do nothing or swap the required elements.

Now the Little Elephant doesn't even hope that the program will sort the permutation, but he still wonders: if he runs the program and gets some permutation, how much will the result of sorting resemble the sorted one? For that help the Little Elephant find the mathematical expectation of the number of permutation inversions after all moves of the program are completed.

We'll call a pair of integers i, j (1 ≤ i < j ≤ n) an inversion in permutatuonp₁, p₂, ..., p_n, if the following inequality holds: p_i > p_j.

Input

The first line contains two integers n and m (1 ≤ n, m ≤ 1000, n > 1) — the permutation size and the number of moves. The second line contains n distinct integers, not exceeding n — the initial permutation. Next m lines each contain two integers: thei-th line contains integers a_i and b_i (1 ≤ a_i, b_i ≤ n, a_i ≠ b_i) — the positions of elements that were changed during the i-th move.

Output

In the only line print a single real number — the answer to the problem. The answer will be considered correct if its relative or absolute error does not exceed 10^- 6.

Examples

Input

2 1
1 2
1 2

Output

0.500000000

Input

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

Output

3.000000000

     设f[i][j] 为 a[i] 比 a[j] 大的概率，显然初始的时候 f[i][j] = [a[i] > a[j]]，并且最后答案就等于Σf[i][j] (i<j)。
    问题是怎么快速维护f[][]。
    考虑一次只涉及两个位置，我们就暴力的修改一遍和这两个位置有关的数就好啦。

#include<bits/stdc++.h>
#define ll long long
#define D double
const int maxn=1005;
D f[maxn][maxn],ans;
int a[maxn],n,m,u,v;
int main(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++) scanf("%d",a+i);
	for(int i=1;i<n;i++)
	    for(int j=i+1;j<=n;j++) if(a[i]>a[j]) f[i][j]=1; else f[j][i]=1;

	while(m--){
		scanf("%d%d",&u,&v);
		for(int i=1;i<=n;i++) if(i!=u&&i!=v){
			f[u][i]=f[v][i]=(f[u][i]+f[v][i])/2;
			f[i][u]=f[i][v]=(f[i][u]+f[i][v])/2;
		}
		f[u][v]=f[v][u]=(f[u][v]+f[v][u])/2;
	}

	for(int i=1;i<n;i++)
	    for(int j=i+1;j<=n;j++) ans+=f[i][j];
	printf("%.11lf\n",ans);
	return 0;
}