4307. 数字重构

// Problem: 数字重构// Contest: AcWing// URL: Memory Limit: 256 MB// Time Limit: 1000 ms// 2022-02-27 14:15:46// // Powered by CP Editor (namespace std;#define rep(i,l,r) for(int i=(l);i<=(r);i++)#define per(i,l,r) for(int i=(l);i>=(r);i--)#define ll long long#define pii pair#define mset(s,t) memset(s,t,sizeof(t))#define mcpy(s,t) memcpy(s,t,sizeof(t))#define fi first#define se second#define pb push_back#define all(x) (x).begin(),(x).end()#define SZ(x) ((int)(x).size())#define mp make_pairconst ll mod = 1e9 + 7;inline ll qmi (ll a, ll b) { ll ans = 1; while (b) { if (b & 1) ans = ans * a%mod; a = a * a %mod; b >>= 1; } return ans;}inline int read () { int x = 0, f = 0; char ch = getchar(); while (!isdigit(ch)) f |= (ch=='-'),ch= getchar(); while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar(); return f?-x:x;}template void print(T x) { if (x < 0) putchar('-'), x = -x; if (x >= 10) print(x/10); putchar(x % 10 + '0');}inline ll sub (ll a, ll b) { return ((a - b ) %mod + mod) %mod;}inline ll add (ll a, ll b) { return (a + b) %mod;}inline ll inv (ll a) { return qmi(a, mod - 2);}string a, b;int cnt[10];int n;string ans = "";set temp;bool dfs (int u, string s) { if (n == b.size() && s > b) return 0; if (u == n) { if (s > b && s.size() == b.size()) return 0; ans = s; return 1; } for (int i = 9; i >= 0; i --) { if (u == 0 && i == 0) continue; if (cnt[i]) { cnt[i] --; if(dfs(u + 1, s + to_string(i))) return 1; cnt[i] ++; } } return 0;}void solve() { cin >> a >> b; for (auto t : a) { cnt[t - '0'] ++; } n = a.size(); dfs(0, ""); cout << ans << endl;}int main () { int t; t =1; //cin >> t; while (t --) solve(); return 0;}

由于只有18位，因此可以dfs搜注意剪枝

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。