Codeforces Gym100425 A. Luggage Distribution

A. Luggage Distribution

time limit per test

1 second

memory limit per test

128 megabytes

input

standard input

output

standard output

All provident tourists know about low-cost airlines. Those who used them at least once also know that their airfare usually includes neither lunch nor luggage.

Naturally, tourists don’t want to overpay luggage fee, therefore they distribute their luggage so that it satisfies all airline requirements.

A certain tourist prepaid three luggage slots. Then he calculated the number of different ways K to distribute weight N among these three slots so that all luggage is packed, none of the slots are empty and all weights are integers. The order of the slots does not matter, so, for example, two distributions 2,  2,  1 and 2,  1,  2 are considered the same.

After landing, the tourist realised that the airline lost all his luggage! And while filling in a lost and found application, he found out that he does not remember the weight of each slot. He remembered only the fact that the number of ways K to pack the luggage was at least L and did not exceed R.

You need to calculate number of possible integer total weights N that could have been in the tourist’s luggage.

Input

The single line of input holds two integer numbers L and R (1 ≤ L ≤ R ≤ 10¹⁷): the minimum and maximum number of ways to distribule the luggage in three slots.

Output

Output a single integer: the number of possible total weigths N that could have been carried by the tourist.

Sample test(s)

Input

2 4

Output

3

Note

In the example, the tourist could have carried the total weight of 5, 6 or 7.

题意

把总量$X$的行李分成三份，有$N$种分法，现在给出$N$的范围$L,R$，问所有可能的$X$($\{1,2,3\},\{1,3,2\},\{2,1,3\}...$)看作一种分法

题解

看起来似乎是个dp。。对于$N$件物品，每个位置最少分1件，还剩$N-3$件，这$N-3$件可以放在一个位置上，就是1种分法，可以放在2个位置上，有$[\frac{N-3}{2}]$种分法，分在3个位置就是$dp[N-3]$，也就是说$dp[N]=1+[\frac{N-3}{2}]+dp[N-3]$，带入之后就是$dp[N]=1+[\frac{N-3}{2}]+1+[\frac{N-6}{2}]+...$,整理之后就是$[\frac N3]+sum([\frac{x-3}2])+sum([\frac{x-6}2])$，其中$sum(x)$是公差为$3$的，首相为$1$或$2$或$3$末项为$x$的等差数列前$n$项和。查询一件行李分法的操作时间复杂度可看作是$O(1)$的，打表发现$1095445116$件行李的分法刚好超过$10^{17}$种，于是就可以在区间$[1,1095445116]$上进行二分。单次查询最多循环57次。超快。。。(WA了一发。。如果能熟练的写好二分也是挺不容易的。。我还是太弱了。。)

代码

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#define fout freopen("out.txt","w",stdout)
#define fin freopen("in.txt","r",stdin)


using namespace std;
int MAX=1095445116;
long long sum(long long x)
{
    if(x<=0)
        return 0LL;
    if(x%3)
        return ((x/3+1)*(x+x%3))/2;
    else
        return x*(3+x)/6;
}
long long ans(int x)
{
    return x/3+sum((x-3)/2)+sum((x-6)/2);
}
int low(long long F)
{
    unsigned int l=0,r=1095445116;
    unsigned int m=(l+r)/2;
    while(l<m)
    {
        if(ans(m)<F)
            l=m;
        else
            r=m;
        m=(l+r)/2;
    }
    return (int)l+1;
}
int up(long long F)
{
    unsigned int l=0,r=1095445116;
    unsigned int m=(l+r)/2;
    while(l<m)
    {
        if(ans(m)>F)
            r=m;
        else
            l=m;
        m=(l+r)/2;
    }
    return (int)l;
}
long long L,R;
int main()
{
    scanf("%I64d%I64d",&L,&R);
    printf("%d\n",up(R)-low(L)+1);
    return 0;
}