zoukankan      html  css  js  c++  java
  • ZOJ 3605 Find the Marble(dp)

    Find the Marble

    Time Limit: 2 Seconds      Memory Limit: 65536 KB

    Alice and Bob are playing a game. This game is played with several identical pots and one marble. When the game starts, Alice puts the pots in one line and puts the marble in one of the pots. After that, Bob cannot see the inside of the pots. Then Alice makes a sequence of swappings and Bob guesses which pot the marble is in. In each of the swapping, Alice chooses two different pots and swaps their positions.

    Unfortunately, Alice's actions are very fast, so Bob can only catch k of m swappings and regard these k swappings as all actions Alice has performed. Now given the initial pot the marble is in, and the sequence of swappings, you are asked to calculate which pot Bob most possibly guesses. You can assume that Bob missed any of the swappings with equal possibility.

    Input

    There are several test cases in the input file. The first line of the input file contains an integer N (N ≈ 100), then N cases follow.

    The first line of each test case contains 4 integers nmk and s(0 < s ≤ n ≤ 50, 0 ≤ k ≤ m ≤ 50), which are the number of pots, the number of swappings Alice makes, the number of swappings Bob catches and index of the initial pot the marble is in. Pots are indexed from 1 to n. Then m lines follow, each of which contains two integers ai and bi (1 ≤ aibi ≤ n), telling the two pots Alice swaps in the i-th swapping.

    Outout

    For each test case, output the pot that Bob most possibly guesses. If there is a tie, output the smallest one.

    Sample Input

    3
    3 1 1 1
    1 2
    3 1 0 1
    1 2
    3 3 2 2
    2 3
    3 2
    1 2
    

    Sample Output

    2
    1
    

    3

    三维DP dp[i][j][p]表示前i个转换,看到了j个,球的位置是p

    #include <iostream>
    #include <string.h>
    #include <stdio.h>
    #include <string.h>
    #include <algorithm>
    #include <math.h>
    
    using namespace std;
    long long int dp[55][55][55];
    int n;
    int m,k,s;
    int a[55][2];
    int main()
    {
        int t;
        scanf("%d",&t);
        while(t--)
        {
            scanf("%d%d%d%d",&n,&m,&k,&s);
            for(int i=1;i<=m;i++)
                scanf("%d%d",&a[i][0],&a[i][1]);
            memset(dp,0,sizeof(dp));
            dp[0][0][s]=1;
            for(int i=1;i<=m;i++)
            {
                for(int j=0;j<=k;j++)
                {
                    for(int p=1;p<=n;p++)
                    {
                        dp[i][j][p]+=dp[i-1][j][p];
                        if(a[i][0]==p)
                            dp[i][j+1][a[i][1]]+=dp[i-1][j][p];
                        else if(a[i][1]==p)
                            dp[i][j+1][a[i][0]]+=dp[i-1][j][p];
                        else
                            dp[i][j+1][p]+=dp[i-1][j][p];
                    }
                }
            }
            int ans=1;
            for(int i=2;i<=n;i++)
                if(dp[m][k][ans]<dp[m][k][i]) ans=i;
            printf("%d
    ",ans);
        }
        return 0;
    
    }
    


  • 相关阅读:
    组合博弈入门
    模拟练1
    鼠标点击 input,显示瞬间的边框颜色,对之修改与隐藏
    display: inline-block兼容性写法
    background-clip与background-origin两者的区别
    article标签和aside标签两者的理解
    jQuery插件实现左右无缝轮播
    JS面向对象基础2
    JS面向对象基础1
    CSS3的基础知识点
  • 原文地址:https://www.cnblogs.com/dacc123/p/8228709.html
Copyright © 2011-2022 走看看