UESTC 电子科大专题训练 DP-E

#include "iostream"
#include "iomanip"
#include "string.h"
#include "stack"
#include "queue"
#include "string"
#include "vector"
#include "set"
#include "map"
#include "algorithm"
#include "stdio.h"
#include "math.h"
#define ll long long
#define bug(x) cout<<x<<" "<<"UUUUU"<<endl;
#define mem(a) memset(a,0,sizeof(a))
#define mp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
using namespace std;
const long long INF = 1e18+1LL;
const int inf = 1e9+1e8;
const int N=1e5+100;
const ll mod=1e9+7;

double dp[2][30005],ans;
int ma,n,m,k,a,b,p;
vector<int> pp[1005];
int main(){
    //ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    cin>>m>>k>>n>>p;
    for(int i=1; i<=k; ++i){
        cin>>a>>b;
        pp[b].pb(a);
        ma=max(ma,b);
    }
    dp[0][p]=1;
    double *now=dp[0], *nex=dp[1];
    for(int i=1; i<=ma; ++i){
        for(int j=1; j<=m; ++j){
            if(j==1){
                nex[j]+=now[j]/2;
                nex[j+1]+=now[j]/2;
            }
            else if(j==m){
                nex[j]+=now[j]/2;
                nex[j-1]+=now[j]/2;
            }
            else{
                nex[j]+=now[j]/3;
                nex[j+1]+=now[j]/3;
                nex[j-1]+=now[j]/3;
            }
        }
        for(auto j : pp[i]){
            nex[j]=0;
        }
        swap(now,nex);
        memset(nex,0,sizeof(dp[0]));
    }
    for(int i=1; i<=m; ++i){
        ans+=now[i];
    }
    printf("%.6f\n",ans);
    return 0;
}