C. Annoying Present CodeForces1009C

C. Annoying Present

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Alice got an array of length nn as a birthday present once again! This is the third year in a row!

And what is more disappointing, it is overwhelmengly boring, filled entirely with zeros. Bob decided to apply some changes to the array to cheer up Alice.

Bob has chosen mm changes of the following form. For some integer numbers xx and dd, he chooses an arbitrary position ii (1≤i≤n1≤i≤n) and for every j∈[1,n]j∈[1,n] adds x+d⋅dist(i,j)x+d⋅dist(i,j) to the value of the jj-th cell. dist(i,j)dist(i,j) is the distance between positions ii and jj (i.e. dist(i,j)=|i−j|dist(i,j)=|i−j|, where |x||x| is an absolute value of xx).

For example, if Alice currently has an array [2,1,2,2][2,1,2,2] and Bob chooses position 33 for x=−1x=−1 and d=2d=2 then the array will become [2−1+2⋅2, 1−1+2⋅1, 2−1+2⋅0, 2−1+2⋅1][2−1+2⋅2, 1−1+2⋅1, 2−1+2⋅0, 2−1+2⋅1] = [5,2,1,3][5,2,1,3]. Note that Bob can't choose position ii outside of the array (that is, smaller than 11 or greater than nn).

Alice will be the happiest when the elements of the array are as big as possible. Bob claimed that the arithmetic mean value of the elements will work fine as a metric.

What is the maximum arithmetic mean value Bob can achieve?

Input

The first line contains two integers nn and mm (1≤n,m≤1051≤n,m≤105) — the number of elements of the array and the number of changes.

Each of the next mm lines contains two integers xixi and didi (−103≤xi,di≤103−103≤xi,di≤103) — the parameters for the ii-th change.

Output

Print the maximal average arithmetic mean of the elements Bob can achieve.

Your answer is considered correct if its absolute or relative error doesn't exceed 10−610−6.

Examples

input

Copy

2 3
-1 3
0 0
-1 -4

output

Copy

-2.500000000000000

input

Copy

3 2
0 2
5 0

output

Copy

7.000000000000000

 

 

#include <bits/stdc++.h>
#define ll long long 
using namespace std;
const int mn = 1e5 + 10;

ll x[mn], d[mn];
int main()
{
    ll n;
    int m;
    scanf("%lld %lld", &n, &m);
    
    for (int i = 1; i <= m; i++)
        scanf("%lld %lld", &x[i], &d[i]);
    
    ll ans = 0;
    for (int i = 1; i <= m; i++)
    {
        ans += n * x[i];
        if (d[i] < 0)   /// 最大值在中间时取到
        {
            ll t = (n + 1) / 2;
            ans +=  d[i] * (t * (t - 1) / 2 + (n - t) * (n - t + 1) / 2);
        }
        else if (d[i] > 0)  /// 最大值在端点取到
            ans += d[i] * n * (n - 1) / 2;
    }
    printf("%.7f\n", 1.00 * ans / n);
    
    return 0;
}