Beautiful Now 鏉數绗簲鍦?鏆村姏鏋氫妇

Posted 2020-12-28

tags:

篇首语：本文由小常识网(cha138.com)小编为大家整理，主要介绍了Beautiful Now 鏉數绗簲鍦?鏆村姏鏋氫妇相关的知识，希望对你有一定的参考价值。

鏍囩锛?a href='http://www.mamicode.com/so/1/cas' title='cas'>cas bool std fine imu font sel 浠ｇ爜 include

Beautiful Now

Time Limit: 5000/2500 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)
Total Submission(s): 0 Accepted Submission(s): 0

Problem Description

Anton has a positive integer

Input

The first line contains one integer

Output

For each test case, print in one line the minimum integer and the maximum integer which are separated by one space.

Sample Input

5 12 1 213 2 998244353 1 998244353 2 998244353 3

Sample Output

12 21 123 321 298944353 998544323 238944359 998544332 233944859 998544332

鏋氫妇姣忕浜ゆ崲鎯呭喌锛屽垎鍒彇鏈€澶у拰鍘绘渶灏?/div>

AC浠ｇ爜锛?/div>

#include <map>
#include <set>
#include <stack>
#include <cmath>
#include <queue>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <algorithm>
#define ls (r<<1)
#define rs (r<<1|1)
#define debug(a) cout << #a << " " << a << endl
using namespace std;
typedef long long ll;
const ll maxn = 1e2+10;
const ll mod = 998244353;
const double pi = acos(-1.0);
ll n, m;
bool cmp( char p, char q ) {
    return p > q;
}
string strmin, strmax, s, tmin, tmax;
void dfs1( ll x, ll cnt, string t ) {
    if( cnt > n-1 || x == t.length()-1 ) {
        //debug(cnt), debug(tmin), debug(strmin), debug(t);
        strmin = min(strmin,t);
        return ;
    }
    if( t[x] == tmin[x] ) {
        dfs1(x+1,cnt,t);
        return ;
    }
    char c = 鈥榓鈥?
    for( ll i = x+1; i < t.length(); i ++ ) {
        if( t[i] <= c ) {
            if( x == 0 && t[i] == 鈥?鈥?) {
                continue;
            }
            c = t[i];
        }
    }
    if( c == 鈥榓鈥?) {
        dfs1(x+1,cnt,t);
        return ;
    }
    for( ll i = x+1; i < t.length(); i ++ ) {
        if( t[i] == c ) {
            swap(t[i],t[x]);
            dfs1(x+1,cnt+1,t);
            swap(t[i],t[x]);
        }
    }
}
void dfs2( ll x, ll cnt, string t ) {
    if( cnt > n-1 || x == t.length()-1 ) {
        //debug(cnt), debug(tmax), debug(strmax), debug(t);
        strmax = max(strmax,t);
        return ;
    }
    if( t[x] == tmax[x] ) {
        dfs2(x+1,cnt,t);
        return ;
    }
    char c = 鈥?鈥?
    bool flag = true;
    for( ll i = x+1; i < t.length(); i ++ ) {
        if( t[i] >= c ) {
            c = t[i];
            flag = false;
        }
    }
    for( ll i = x+1; i < t.length(); i ++ ) {
        if( t[i] == c ) {
            swap(t[i],t[x]);
            dfs2(x+1,cnt+1,t);
            swap(t[i],t[x]);
        }
    }
}
string rev( string s ) {
    string t = "";
    for( ll i = 0, j = s.length()-1; i < s.length(); i ++, j -- ) {
        t = t + s[j];
    }
    return t;
}
int main() {
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	ll T, t = 1;
	cin >> T;
	while( T -- ) {
        s = "";
        ll j = 0;
        cin >> m >> n;
        while(m) {
            char c = (m%10)+鈥?鈥?
            s = s + c;
            m /= 10;
        }
        s = rev(s);
        tmin = s, tmax = s;
        sort(tmin.begin(),tmin.end());
        sort(tmax.begin(),tmax.end(),cmp);
        if( tmin[0] == 鈥?鈥?) {
            char c = 鈥榓鈥?
            ll inx = -1;
            for( ll i = 1; i < tmin.length(); i ++ ) {
                if( tmin[i] != 鈥?鈥?&& tmin[i] < c ) {
                    c = tmin[i];
                    inx = i;
                }
            }
            if( inx != -1 ) {
                swap(tmin[inx],tmin[0]);
            }
        }
        if( n >= s.length()-1 ) {
            cout << tmin << " " << tmax << endl;
        } else {
            strmin = s;
            dfs1(0,0,strmin);
            strmax = s;
            dfs2(0,0,strmax);
            cout << strmin << " " << strmax << endl;
        }
	}
	return 0;
}
/*
123112 2
111322 322111
10001 2
*/

銆€銆€

以上是关于Beautiful Now 鏉數绗簲鍦?鏆村姏鏋氫妇的主要内容，如果未能解决你的问题，请参考以下文章

ural 1104. Don鈥檛 Ask Woman about Her Age鏆村姏

鏆村姏dp+鐘舵€佽璁℃€濈淮鈥斺€攃f1303E

Leetcode涔?5. 3Sum (medium)

C - Beautiful Now

hdu 6351Beautiful Now

HDU-6351 Beautiful Now 全排列暴力