Problem: 2050D - Digital string maximization
Language: C++23 (GCC 14-64, msys2)

Previous submission (verdict: Time limit exceeded on test 8):
#include <bits/stdc++.h>

using namespace std;



typedef int64_t ll;

typedef unsigned long long ull;

typedef long double lld;



#define F              first

#define S              second

#define pb             push_back

#define usi            unordered_set<int>

#define si             set <int>

#define vi             vector <int>

#define vll            vector<ll>

#define pii            pair <int, int>

#define vpi            vector <pii>

#define vpp            vector <pair<int, pii>>

#define mii            map <int, int>

#define umii           unordered_map<int,int>

#define mpi            map <pii, int>

#define spi            set <pii>

#define endl           "\n"

#define sz(x)          ((int) x.size())

#define all(p)         p.begin(), p.end()

#define que_max        priority_queue <int>

#define que_min        priority_queue <int, vi, greater<int>>

#define endl            "\n"

#define PI                3.141592653589793238462

#define set_bits         __builtin_popcountll

#define print(a)       for(auto x : a) cout << x << " "; cout << endl

#define print1(a)      for(auto x : a) cout << x.F << " " << x.S << endl



const ll MOD = 1e9+7;

const ll INF = 1e18;





#ifndef normal_coder31

#define debug(x) cerr << #x<<":"; _print(x); cerr << endl;

#endif





void _print(ll t) {cerr << t;}

void _print(int t) {cerr << t;}

void _print(string t) {cerr << t;}

void _print(char t) {cerr << t;}

void _print(lld t) {cerr << t;}

void _print(double t) {cerr << t;}

void _print(ull t) {cerr << t;}



template <class T, class V> void _print(pair <T, V> p);

template <class T> void _print(vector <T> v);

template <class T> void _print(set <T> v);

template <class T, class V> void _print(map <T, V> v);

template <class T> void _print(multiset <T> v);

template <class T, class V> void _print(pair <T, V> p) {cerr << "{"; _print(p.F); cerr << ","; _print(p.S); cerr << "}";}

template <class T> void _print(vector <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}

template <class T> void _print(set <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}

template <class T> void _print(multiset <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}

template <class T, class V> void _print(map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}



/*---------------------------------------------------------------------------------------------------------------------------------------------*/





// Loops

#define FOR(i, a, b) for(int i = (a); i < (b); i++)

#define FORD(i, a, b) for(int i = (a); i >= (b); i--)

#define REP(i, n) for(int i = 0; i < (n); i++)



/*---------------------------------------------------------------------------------------------------------------------------------------------*/

// Common utility functions

ll ceil_div(ll a,ll b){return (a + b - 1)/b;}

ll gcd(ll a, ll b) {if (b > a) {return gcd(b, a);} if (b == 0) {return a;} return gcd(b, a % b);}

ll expo(ll a, ll b, ll mod) {ll res = 1; while (b > 0) {if (b & 1)res = (res * a) % mod; a = (a * a) % mod; b = b >> 1;} return res;}

void extendgcd(ll a, ll b, ll*v) {if (b == 0) {v[0] = 1; v[1] = 10; v[2] = a; return ;} extendgcd(b, a % b, v); ll x = v[1]; v[1] = v[0] - v[1] * (a / b); v[0] = x; return;} //pass an arry of size1 3

ll mod_add(ll a, ll b, ll m) {a = a % m; b = b % m; return (((a + b) % m) + m) % m;}

ll mod_mul(ll a, ll b, ll m) {a = a % m; b = b % m; return (((a * b) % m) + m) % m;}

ll mod_sub(ll a, ll b, ll m) {a = a % m; b = b % m; return (((a - b) % m) + m) % m;}

ll mminv(ll a, ll b) {ll arr[3]; extendgcd(a, b, arr); return mod_add(arr[0], 0, b);} //for non prime b

ll mminvprime(ll a, ll b) {return expo(a, b - 2, b);}

bool revsort(ll a, ll b) {return a > b;}

ll mod_div(ll a, ll b, ll m) {a = a % m; b = b % m; return (mod_mul(a, mminvprime(b, m), m) + m) % m;}  //only for prime m

ll combination(ll n, ll r, ll m, ll *fact, ll *ifact) {ll val1 = fact[n]; ll val2 = ifact[n - r]; ll val3 = ifact[r]; return (((val1 * val2) % m) * val3) % m;}

ll modInverse(ll a, ll m) {ll res = 1;ll exponent = m - 2; while (exponent) {if (exponent & 1) {res = (res * a) % m;}a = (a * a) % m;exponent >>= 1;}return res;}

vector<ll> sieve(int n) {int*arr = new int[n + 1](); vector<ll> vect; for (int i = 2; i <= n; i++)if (arr[i] == 0) {vect.push_back(i); for (int j = 2 * i; j <= n; j += i)arr[j] = 1;} return vect;}

ll phin(ll n) {ll number = n; if (n % 2 == 0) {number /= 2; while (n % 2 == 0) n /= 2;} for (ll i = 3; i <= sqrt(n); i += 2) {if (n % i == 0) {while (n % i == 0)n /= i; number = (number / i * (i - 1));}} if (n > 1)number = (number / n * (n - 1)) ; return number;} //O(sqrt(N))

bool isSorted(vector<ll>& a, int start, int end) {    for (int i = start; i < end; i++) {if (a[i] > a[i + 1]) return false;}return true;}



/*---------------------------------------------------------------------------------------------------------------------------------------------*/

bool cond(string& s,int n)

{

for(int i=n-1;i>=1;i--)

{

int numCurr = s[i] - '0';

int numPrev = s[i-1] - '0';



if(numCurr - 1 > numPrev)

{

return false;

}

}

return true;

}

string solve(string& s) {

int n = s.length();



while(true)

{

for(int i=n-1;i>=1;i--)

{

int numCurr = s[i] - '0';

int numPrev = s[i-1] - '0';



if(numCurr - 1 > numPrev)

{

char temp = s[i-1];

s[i-1] = (char)(numCurr - 1 + '0');

s[i] = temp;

}

}



if(cond(s,n))

break;

}

return s;

}



int main()

{

ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);



#ifndef ONLINE_JUDGE

freopen("input.txt",  "r",  stdin);

freopen("output.txt", "w", stdout);

#endif



clock_t z = clock();



int t = 1;

cin >> t;

while (t--) {

string s;

cin>>s;



cout<<solve(s)<<endl;

};



cerr << "Run Time : " << ((double)(clock() - z) / CLOCKS_PER_SEC);



return 0;

}



Submission (verdict: Idleness limit exceeded on test 3):
#include <bits/stdc++.h>

using namespace std;



typedef int64_t ll;

typedef unsigned long long ull;

typedef long double lld;



#define F              first

#define S              second

#define pb             push_back

#define usi            unordered_set<int>

#define si             set <int>

#define vi             vector <int>

#define vll            vector<ll>

#define pii            pair <int, int>

#define vpi            vector <pii>

#define vpp            vector <pair<int, pii>>

#define mii            map <int, int>

#define umii           unordered_map<int,int>

#define mpi            map <pii, int>

#define spi            set <pii>

#define endl           "\n"

#define sz(x)          ((int) x.size())

#define all(p)         p.begin(), p.end()

#define que_max        priority_queue <int>

#define que_min        priority_queue <int, vi, greater<int>>

#define endl            "\n"

#define PI                3.141592653589793238462

#define set_bits         __builtin_popcountll

#define print(a)       for(auto x : a) cout << x << " "; cout << endl

#define print1(a)      for(auto x : a) cout << x.F << " " << x.S << endl



const ll MOD = 1e9+7;

const ll INF = 1e18;





#ifndef normal_coder31

#define debug(x) cerr << #x<<":"; _print(x); cerr << endl;

#endif





void _print(ll t) {cerr << t;}

void _print(int t) {cerr << t;}

void _print(string t) {cerr << t;}

void _print(char t) {cerr << t;}

void _print(lld t) {cerr << t;}

void _print(double t) {cerr << t;}

void _print(ull t) {cerr << t;}



template <class T, class V> void _print(pair <T, V> p);

template <class T> void _print(vector <T> v);

template <class T> void _print(set <T> v);

template <class T, class V> void _print(map <T, V> v);

template <class T> void _print(multiset <T> v);

template <class T, class V> void _print(pair <T, V> p) {cerr << "{"; _print(p.F); cerr << ","; _print(p.S); cerr << "}";}

template <class T> void _print(vector <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}

template <class T> void _print(set <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}

template <class T> void _print(multiset <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}

template <class T, class V> void _print(map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}

/*---------------------------------------------------------------------------------------------------------------------------------------------*/





// Loops

#define FOR(i, a, b) for(int i = (a); i < (b); i++)

#define FORD(i, a, b) for(int i = (a); i >= (b); i--)

#define REP(i, n) for(int i = 0; i < (n); i++)



/*---------------------------------------------------------------------------------------------------------------------------------------------*/

// Common utility functions

ll ceil_div(ll a,ll b){return (a + b - 1)/b;}

ll gcd(ll a, ll b) {if (b > a) {return gcd(b, a);} if (b == 0) {return a;} return gcd(b, a % b);}

ll expo(ll a, ll b, ll mod) {ll res = 1; while (b > 0) {if (b & 1)res = (res * a) % mod; a = (a * a) % mod; b = b >> 1;} return res;}

void extendgcd(ll a, ll b, ll*v) {if (b == 0) {v[0] = 1; v[1] = 10; v[2] = a; return ;} extendgcd(b, a % b, v); ll x = v[1]; v[1] = v[0] - v[1] * (a / b); v[0] = x; return;} //pass an arry of size1 3

ll mod_add(ll a, ll b, ll m) {a = a % m; b = b % m; return (((a + b) % m) + m) % m;}

ll mod_mul(ll a, ll b, ll m) {a = a % m; b = b % m; return (((a * b) % m) + m) % m;}

ll mod_sub(ll a, ll b, ll m) {a = a % m; b = b % m; return (((a - b) % m) + m) % m;}

ll mminv(ll a, ll b) {ll arr[3]; extendgcd(a, b, arr); return mod_add(arr[0], 0, b);} //for non prime b

ll mminvprime(ll a, ll b) {return expo(a, b - 2, b);}

bool revsort(ll a, ll b) {return a > b;}

ll mod_div(ll a, ll b, ll m) {a = a % m; b = b % m; return (mod_mul(a, mminvprime(b, m), m) + m) % m;}  //only for prime m

ll combination(ll n, ll r, ll m, ll *fact, ll *ifact) {ll val1 = fact[n]; ll val2 = ifact[n - r]; ll val3 = ifact[r]; return (((val1 * val2) % m) * val3) % m;}

ll modInverse(ll a, ll m) {ll res = 1;ll exponent = m - 2; while (exponent) {if (exponent & 1) {res = (res * a) % m;}a = (a * a) % m;exponent >>= 1;}return res;}

vector<ll> sieve(int n) {int*arr = new int[n + 1](); vector<ll> vect; for (int i = 2; i <= n; i++)if (arr[i] == 0) {vect.push_back(i); for (int j = 2 * i; j <= n; j += i)arr[j] = 1;} return vect;}

ll phin(ll n) {ll number = n; if (n % 2 == 0) {number /= 2; while (n % 2 == 0) n /= 2;} for (ll i = 3; i <= sqrt(n); i += 2) {if (n % i == 0) {while (n % i == 0)n /= i; number = (number / i * (i - 1));}} if (n > 1)number = (number / n * (n - 1)) ; return number;} //O(sqrt(N))

bool isSorted(vector<ll>& a, int start, int end) {    for (int i = start; i < end; i++) {if (a[i] > a[i + 1]) return false;}return true;}



/*---------------------------------------------------------------------------------------------------------------------------------------------*/



string solve(string& s) {

int n = s.length();

vector<int> digis(n);



for(int i=0;i<n;i++)

{

digis[i] = s[i] - '0';

}



for(int i=1;i<n;i++)

{

int j = i;

while(j>=1 && digis[j] - 1 > digis[j-1])

{

digis[j]--;

swap(digis[j],digis[j-1]);

j--;

}

debug(digis)

}

string ans=";



for(auto it : digis)

ans+=to_string(it);



return ans;

}



int main()

{

ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);



#ifndef ONLINE_JUDGE

freopen("input.txt",  "r",  stdin);

freopen("output.txt", "w", stdout);

#endif



clock_t z = clock();



int t = 1;

cin >> t;

while (t--) {

string s;

cin>>s;



cout<<solve(s)<<endl;

};



cerr << "Run Time : " << ((double)(clock() - z) / CLOCKS_PER_SEC);



return 0;

}