E. Riding in a Lift(Codeforces Round #274)「建议收藏」

E. Riding in a Lift(Codeforces Round #274)

大家好,又见面了,我是全栈君。

E. Riding in a Lift
time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Imagine that you are in a building that has exactly n floors. You can move between the floors in a lift. Let’s number the floors from bottom to top with integers from 1 to n. Now you’re on the floor number a. You are very bored, so you want to take the lift. Floor number b has a secret lab, the entry is forbidden. However, you already are in the mood and decide to make k consecutive trips in the lift.

Let us suppose that at the moment you are on the floor number x (initially, you were on floor a). For another trip between floors you choose some floor with number y (y ≠ x) and the lift travels to this floor. As you cannot visit floor b with the secret lab, you decided that the distance from the current floor x to the chosen y must be strictly less than the distance from the current floor x to floor b with the secret lab. Formally, it means that the following inequation must fulfill: |x - y| < |x - b|. After the lift successfully transports you to floor y, you write down number y in your notepad.

Your task is to find the number of distinct number sequences that you could have written in the notebook as the result of k trips in the lift. As the sought number of trips can be rather large, find the remainder after dividing the number by 1000000007 (109 + 7).

Input

The first line of the input contains four space-separated integers nabk (2 ≤ n ≤ 50001 ≤ k ≤ 50001 ≤ a, b ≤ na ≠ b).

Output

Print a single integer — the remainder after dividing the sought number of sequences by 1000000007 (109 + 7).

Sample test(s)
input
5 2 4 1

output
2

input
5 2 4 2

output
2

input
5 3 4 1

output
0

Note

Two sequences p1, p2, …, pk and q1, q2, …, qk are distinct, if there is such integer j (1 ≤ j ≤ k), that pj ≠ qj.

Notes to the samples:

  1. In the first sample after the first trip you are either on floor 1, or on floor 3, because |1 - 2| < |2 - 4| and |3 - 2| < |2 - 4|.
  2. In the second sample there are two possible sequences: (1, 2)(1, 3). You cannot choose floor 3 for the first trip because in this case no floor can be the floor for the second trip.
  1. In the third sample there are no sought sequences, because you cannot choose the floor for the first trip.


上次的cf今天才补题o(╯□╰)o,给n层楼。在a层開始,不能在b层停,且当在x层去y层时。|x - y| < |x - b|,求运行k
 
次的方案数。

有两种情况,dp[i][j],i为第i次,j为当前停的层数。


 当a<b时,此时全部的x不会超过b,当第i次停在j层。第i-1次肯定在[0,(b+j-1)/2],左端点不难想到,右端点推导过程:

设第i-1次停在x层。则第i层全部大于x小于b的点都能够取。我们仅仅考虑小于x的点。则x-j<=b-x-1,

整理得:   x<=(b+j-1)/2; 所以转移方程为:dp[i][j]=(sum[i-1][(j+b-1)/2]-dp[i-1][j]+mod)%mod;

当a>b时,同理得
dp[i][j]=((sum[i-1][n]-sum[i-1][(j+b)/2]+mod)%mod-dp[i-1][j]+mod)%mod;

代码:

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
const int maxn=5000+100;
const int mod=1000000000+7;
int dp[maxn][maxn];
int sum[maxn][maxn];
int n;
void getsum(int x)
{
    for(int i=1;i<=n;i++)
    {
    sum[x][i]=(sum[x][i-1]+dp[x][i])%mod;
  //  printf("%I64d\n",sum[x][i]);
    }
}
int main()
{
    int a,b,k;
    scanf("%d%d%d%d",&n,&a,&b,&k);
    memset(dp,0,sizeof(dp));
    memset(sum,0,sizeof(sum));
    dp[0][a]=1;
    if(a<b)
    {
        getsum(0);
       for(int i=1;i<=k;i++)
       {
        for(int j=1;j<b;j++)
        {
           dp[i][j]=(sum[i-1][(j+b-1)/2]-dp[i-1][j]+mod)%mod;
          // printf("%I64d ",dp[i][j]);
        }
      // printf("\n");
        getsum(i);
       }
    }
    else
    {
        getsum(0);
        for(int i=1;i<=k;i++)
        {
            for(int j=b+1;j<=n;j++)
            {
                //printf("%d %d\n",sum[i-1])
                dp[i][j]=((sum[i-1][n]-sum[i-1][(j+b)/2]+mod)%mod-dp[i-1][j]+mod)%mod;
               // printf("%d ",dp[i][j]);
            }
            getsum(i);
        }
    }
    long long ans=0;
    for(int i=1;i<=n;i++)
    {
    ans=(ans+dp[k][i])%mod;
    //printf("%d ",dp[k][i]);
    }
    printf("%I64d\n",ans);
    return 0;
}

版权声明:本文内容由互联网用户自发贡献,该文观点仅代表作者本人。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容, 请发送邮件至 举报,一经查实,本站将立刻删除。

发布者:全栈程序员-用户IM,转载请注明出处:https://javaforall.cn/116125.html原文链接:https://javaforall.cn

【正版授权,激活自己账号】: Jetbrains全家桶Ide使用,1年售后保障,每天仅需1毛

【官方授权 正版激活】: 官方授权 正版激活 支持Jetbrains家族下所有IDE 使用个人JB账号...

(0)


相关推荐

  • QTreeview上面划线[通俗易懂]

    QTreeview上面划线[通俗易懂]因为要做一个动画编辑器功能,需要有时间标线,我使用了QTreeview作为显示控件,但是上面划线就是个大问题,经过几番尝试终于找到办法了。先上图具体办法就是继承了qtreeview并且重载paintevent这个函数voidActionTreeView::paintEvent(QPaintEvent*event){Q_UNUSED(event);QTreeView::pa

  • JSF之经常使用注解

    JSF之经常使用注解

  • 常见服务器默认管理口地址[通俗易懂]

    常见服务器默认管理口地址[通俗易懂]+++++++++++++++++++++++++++++++++++++++++++++++++++++++++HP管理口:ILO1》默认用户/密码:Administrator/password2》HP以前管理口登陆MP卡通过网线连接MP卡的RJ-45口,通过telnet方式登录,默认用户/密码:Admin/Admin3》++++++++++++++++++

  • ftp服务器文件防盗链,IIS防盗链组件[通俗易懂]

    ftp服务器文件防盗链,IIS防盗链组件[通俗易懂]一个用于防盗链和限制IIS连接线程的组件,需要IIS用ISAPI的方式加载组件,在2003服务器上测试2008服务器的话需要安装ISAPI扩展。相关软件软件大小版本说明下载地址一个用于防盗链和限制IIS连接线程的组件。本组件已经应用于PC6下载服务器,经过一段时间的测试效果比较明显。需要IIS用ISAPI的方式加载组件,在2003服务器上测试2008服务器的话需要安装ISAPI扩展。打开IIS…

  • pytest 执行用例_测试用例一般执行多少次

    pytest 执行用例_测试用例一般执行多少次前言平常我们功能测试用例非常多时,比如有1千条用例,假设每个用例执行需要1分钟,如果单个测试人员执行需要1000分钟才能跑完当项目非常紧急时,会需要协调多个测试资源来把任务分成两部分,于是执行时间

  • 卷积神经网络和图像识别[通俗易懂]

    卷积神经网络和图像识别[通俗易懂]卷积神经网络与图像识别我们介绍了人工神经网络,以及它的训练和使用。我们用它来识别了手写数字,然而,这种结构的网络对于图像识别任务来说并不是很合适。本文将要介绍一种更适合图像、语音识别任务的神经网络结构——卷积神经网络(ConvolutionalNeuralNetwork,CNN)。说卷积神经网络是最重要的一种神经网络也不为过,它在最近几年大放异彩,几乎所有图像、语音识别领域的…

发表回复

您的电子邮箱地址不会被公开。

关注全栈程序员社区公众号