#684684 (C++17) No.1630 Sorting Integers (Greater than K)

• 問題: No.1630 Sorting Integers (Greater than K)
• ユーザー: tanimani364
• 提出日時: 2021-07-30 22:34:10
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: RE
• 実行時間: -
• コード長: 5,144 bytes
• コンパイル時間: 2,050 ms
• コンパイル使用メモリ: 204,420 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-09-16 01:12:31
• 合計ジャッジ時間: 3,317 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	RE	-
testcase_03	AC	1 ms; 5,376 KB
testcase_04	AC	1 ms; 5,376 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	1 ms; 5,376 KB
testcase_07	AC	2 ms; 5,376 KB
testcase_08	AC	2 ms; 5,376 KB
testcase_09	AC	2 ms; 5,376 KB
testcase_10	AC	1 ms; 5,376 KB
testcase_11	AC	1 ms; 5,376 KB
testcase_12	AC	2 ms; 5,376 KB
testcase_13	AC	1 ms; 5,376 KB
testcase_14	AC	2 ms; 5,376 KB
testcase_15	AC	2 ms; 5,376 KB
testcase_16	AC	8 ms; 5,376 KB
testcase_17	AC	9 ms; 5,376 KB
testcase_18	AC	6 ms; 5,376 KB
testcase_19	AC	6 ms; 5,376 KB
testcase_20	AC	5 ms; 5,376 KB
testcase_21	AC	5 ms; 5,376 KB
testcase_22	AC	5 ms; 5,376 KB
testcase_23	AC	3 ms; 5,376 KB
testcase_24	AC	8 ms; 5,376 KB
testcase_25	AC	3 ms; 5,376 KB
testcase_26	AC	5 ms; 5,376 KB

ソースコード

#include <bits/stdc++.h>
//#include<boost/multiprecision/cpp_int.hpp>
//#include<boost/multiprecision/cpp_dec_float.hpp>
//#include <atcoder/all>
using namespace std;
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a; i > -1; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a; i > b; --i)
#define repl(i, a) for (ll i = (ll)0; i < (ll)a; ++i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll
#define fi first
#define se second
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll mod_998244353 = 998244353;
constexpr ll INF = 1LL << 60;

// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

// using lll=boost::multiprecision::cpp_int;
// using
// Double=boost::multiprecision::number<boost::multiprecision::cpp_dec_float<128>>;//仮数部が1024桁
template <class T>
inline bool chmin(T &a, T b)
{
  if (a > b)
  {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
  if (a < b)
  {
    a = b;
    return true;
  }
  return false;
}

ll mypow(ll x, ll n, const ll &p = -1)
{ // x^nをmodで割った余り

  if (p != -1)
  {
    x = (x % p + p) % p;
  }
  ll ret = 1;
  while (n > 0)
  {
    if (n & 1)
    {
      if (p != -1)
        ret = (ret * x) % p;
      else
        ret *= x;
    }
    if (p != -1)
      x = (x * x) % p;
    else
      x *= x;
    n >>= 1;
  }
  return ret;
}

struct myrand{
  random_device seed;
  mt19937 mt;
  myrand():mt(seed()){}
  int operator()(int a,int b){//[a,b)
    uniform_int_distribution<int>dist(a,b-1);
    return dist(mt);
  }
};

//using namespace atcoder;

//------------------------
//------------------------
//------------------------
//------------------------
//------------------------

template<int mod>
struct Modint{
    int x;
    Modint():x(0){}
    Modint(int64_t y):x((y%mod+mod)%mod){}

    Modint &operator+=(const Modint &p){
			if((x+=p.x)>=mod)
				x -= mod;
			return *this;
		}

		Modint &operator-=(const Modint &p){
			if((x+=mod-p.x)>=mod)
				x -= mod;
			return *this;
		}

		Modint &operator*=(const Modint &p){
			x = (1LL * x * p.x) % mod;
			return *this;
		}

		Modint &operator/=(const Modint &p){
			*this *= p.inverse();
			return *this;
		}

		Modint operator-() const { return Modint(-x); }
		Modint operator+(const Modint &p) const{
			return Modint(*this) += p;
		}
		Modint operator-(const Modint &p) const{
			return Modint(*this) -= p;
		}
		Modint operator*(const Modint &p) const{
			return Modint(*this) *= p;
		}
		Modint operator/(const Modint &p) const{
			return Modint(*this) /= p;
		}

		bool operator==(const Modint &p) const { return x == p.x; }
		bool operator!=(const Modint &p) const{return x != p.x;}

		Modint inverse() const{//非再帰拡張ユークリッド
			int a = x, b = mod, u = 1, v = 0;
			while(b>0){
				int t = a / b;
				swap(a -= t * b, b);
				swap(u -= t * v, v);
			}
			return Modint(u);
		}

		Modint pow(int64_t n) const{//繰り返し二乗法
			Modint ret(1), mul(x);
			while(n>0){
				if(n&1)
					ret *= mul;
				mul *= mul;
				n >>= 1;
			}
			return ret;
		}

		friend ostream &operator<<(ostream &os,const Modint &p){
			return os << p.x;
		}
};

using modint = Modint<mod>;
using modint2= Modint<mod_998244353>;


void solve()
{
  ll n;
  string k;
  cin>>n>>k;
  string ans;
  ll c[9];
  rep(i,9)cin>>c[i];
  int m=k.size();
  if(k.back()!='9')k.back()++;
  else{
    int pos=m-1;
    while(pos>=0&&k[pos]=='9'){
      k[pos]='0';
      pos--;
    }
    if(pos==-1){
      k="1"+k;
      ++m;
    }else{
      k[pos]++;
    }
  }
  if(n>m){
    rep(i,9){
      while(c[i]>0)ans+=char('1'+i),c[i]--;
    }
    cout<<ans<<"\n";
    return;
  }else if(n<m){
    cout<<-1<<"\n";
    return;
  }

  rep(i,m){
    bool ok=false;
    if(k[i]=='0'){
      rep(j,9){
        if(c[j]>0){
          ans+=char('1'+j);
          c[j]--;
          ok=true;
          break;
        }
      }
      if(ok)break;
      else{
        cout<<-1<<"\n";
        return;
      }
    }
    else if(c[k[i]-'1']>0)ans+=k[i],c[k[i]-'1']--;
    else{
      bool ok=false;
      for(int j=k[i]-'0';j<=9;++j){
        if(c[j-1]>0){
          c[j-1]--;
          ans+=char('0'+j);
          ok=true;
          break;
        }
      }
      if(!ok){
        for(int j=i-1;i>=0;--j){
          for(int k=ans[j]-'0';k<9;++k){
            if(c[k]>0){
              c[ans[j]-'1']++;
              c[k]--;
              ans[j]=char('1'+k);
              ok=true;
              break;
            }
          }
          if(ok)break;
          c[ans[j]-'1']++;
          ans.pop_back();
        }
      }if(!ok){
        cout<<-1<<"\n";
        return;
      }else break;
    }
  }
  rep(i,9){
    while(c[i]>0)ans+=char('1'+i),c[i]--;
  }
  cout<<ans<<"\n";
}

int main()
{
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout << fixed << setprecision(15);
  solve();
  return 0;
}