uva12486 Space Elevator(数位dp)

转载请注明出处： http://www.cnblogs.com/fraud/          ——by fraud

题目链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=279&page=show_problem&problem=3930

 

题意：问第n个各个数位上不出现连续的13和4的数是多少？从1开始算，n<=10^18

莫名奇妙地写跪了，重写一发就过了、、、

可以比较容易的得出小于等于x的满足那些要求的数有多少个，然后根据这个二分。直接二分答案。

注意需要用unsigned long long

/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author xyiyy @https://github.com/xyiyy
 */

#include <iostream>
#include <fstream>

//#####################
//Author:fraud
//Blog: http://www.cnblogs.com/fraud/
//#####################
//#pragma comment(linker, "/STACK:102400000,102400000")
#include <iostream>
#include <sstream>
#include <ios>
#include <iomanip>
#include <functional>
#include <algorithm>
#include <vector>
#include <string>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <climits>
#include <cctype>

using namespace std;
#define rep(X, N) for(int X=0;X<N;X++)
#define dep(X, R, L) for(int X=R;X>=L;X--)
typedef unsigned long long ull;

typedef unsigned long long ull;
ull dp[][];
int d[];

class TaskE {
public:
    void solve(std::istream &in, std::ostream &out) {
        //bign n;

        rep(i, )
            rep(j, )dp[i][j] = ;
        run();
        ull n;
        while (in >> n) {
            ull ans = ;
            ull l = ;
            ull r = -;
            while (l <= r) {
                int f = ;
                if ((l & ) && (r & ))f++;
                ull mid = (r >> ) + (l >> ) + f;
                if (gao(mid) <= n) {
                    ans = mid;
                    l = mid + ;
                } else {
                    r = mid - ;
                }
            }
            out << ans << endl;
        }
    }

    ull gao(ull n) {
        ull ans = ;
        int len = ;
        while (n) {
            d[++len] = n % ;
            n /= ;
        }
        d[len + ] = ;
        dep(i, len, ) {
            rep(j, d[i]) {
                if (d[i + ] !=  || j != ) {
                    ans += dp[i][j];
                }
            }
            if (d[i] ==  || (d[i + ] ==  && d[i] == ))break;
        }
        return ans;
    }

    void run() {
        dp[][] = ;
        for (int i = ; i <= ; i++) {
            for (int j = ; j <= ; j++) {
                for (int k = ; k <= ; k++) {
                    if (j !=  && !(j ==  && k == )) {
                        dp[i][j] += dp[i - ][k];
                    }
                }
            }
        }
    }
};

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie();
    TaskE solver;
    std::istream &in(std::cin);
    std::ostream &out(std::cout);
    solver.solve(in, out);
    return ;
}