結果
| 問題 | No.1630 Sorting Integers (Greater than K) |
| ユーザー |
 iiljj
|
| 提出日時 | 2021-07-30 21:37:00 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 61 ms / 2,000 ms |
| コード長 | 10,236 bytes |
| コンパイル時間 | 1,442 ms |
| コンパイル使用メモリ | 139,044 KB |
| 最終ジャッジ日時 | 2025-01-23 11:18:46 |
|
ジャッジサーバーID （参考情報） |
judge2 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 5 |
| other | AC * 22 |
ソースコード
/* #region Head */// #include <bits/stdc++.h>#include <algorithm>#include <array>#include <bitset>#include <cassert> // assert.h#include <cmath> // math.h#include <cstring>#include <ctime>#include <deque>#include <fstream>#include <functional>#include <iomanip>#include <iostream>#include <list>#include <map>#include <memory>#include <numeric>#include <queue>#include <random>#include <set>#include <sstream>#include <stack>#include <string>#include <unordered_map>#include <unordered_set>#include <vector>using namespace std;using ll = long long;using ull = unsigned long long;using ld = long double;using pll = pair<ll, ll>;template <class T> using vc = vector<T>;template <class T> using vvc = vc<vc<T>>;using vll = vc<ll>;using vvll = vvc<ll>;using vld = vc<ld>;using vvld = vvc<ld>;using vs = vc<string>;using vvs = vvc<string>;template <class T, class U> using um = unordered_map<T, U>;template <class T> using pq = priority_queue<T>;template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;template <class T> using us = unordered_set<T>;#define TREP(T, i, m, n) for (T i = (m), i##_len = (T)(n); i < i##_len; ++(i))#define TREPM(T, i, m, n) for (T i = (m), i##_max = (T)(n); i <= i##_max; ++(i))#define TREPR(T, i, m, n) for (T i = (m), i##_min = (T)(n); i >= i##_min; --(i))#define TREPD(T, i, m, n, d) for (T i = (m), i##_len = (T)(n); i < i##_len; i += (d))#define TREPMD(T, i, m, n, d) for (T i = (m), i##_max = (T)(n); i <= i##_max; i += (d))#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)#define REPIR(itr, ds) for (auto itr = ds.rbegin(); itr != ds.rend(); itr++)#define ALL(x) begin(x), end(x)#define SIZE(x) ((ll)(x).size())#define PERM(c) \sort(ALL(c)); \for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))#define UNIQ(v) v.erase(unique(ALL(v)), v.end());#define CEIL(a, b) (((a) + (b)-1) / (b))#define endl '\n'constexpr ll INF = 1'010'000'000'000'000'017LL;constexpr int IINF = 1'000'000'007LL;constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7// constexpr ll MOD = 998244353;constexpr ld EPS = 1e-12;constexpr ld PI = 3.14159265358979323846;template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector 入力for (T &x : vec)is >> x;return is;}template <typename T> ostream &operator<<(ostream &os, const vc<T> &vec) { // vector 出力 (for dump)os << "{";REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");os << "}";return os;}template <typename T> ostream &operator>>(ostream &os, const vc<T> &vec) { // vector 出力 (inline)REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");return os;}template <typename T, size_t _Nm> istream &operator>>(istream &is, array<T, _Nm> &arr) { // array 入力REP(i, 0, SIZE(arr)) is >> arr[i];return is;}template <typename T, size_t _Nm> ostream &operator<<(ostream &os, const array<T, _Nm> &arr) { // array 出力 (for dump)os << "{";REP(i, 0, SIZE(arr)) os << arr[i] << (i == i_len - 1 ? "" : ", ");os << "}";return os;}template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力is >> pair_var.first >> pair_var.second;return is;}template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &pair_var) { // pair 出力os << "(" << pair_var.first << ", " << pair_var.second << ")";return os;}// map, um, set, us 出力template <class T> ostream &out_iter(ostream &os, const T &map_var) {os << "{";REPI(itr, map_var) {os << *itr;auto itrcp = itr;if (++itrcp != map_var.end())os << ", ";}return os << "}";}template <typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &map_var) {return out_iter(os, map_var);}template <typename T, typename U> ostream &operator<<(ostream &os, const um<T, U> &map_var) {os << "{";REPI(itr, map_var) {auto [key, value] = *itr;os << "(" << key << ", " << value << ")";auto itrcp = itr;if (++itrcp != map_var.end())os << ", ";}os << "}";return os;}template <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) { return out_iter(os, set_var); }template <typename T> ostream &operator<<(ostream &os, const us<T> &set_var) { return out_iter(os, set_var); }template <typename T> ostream &operator<<(ostream &os, const pq<T> &pq_var) {pq<T> pq_cp(pq_var);os << "{";if (!pq_cp.empty()) {os << pq_cp.top(), pq_cp.pop();while (!pq_cp.empty())os << ", " << pq_cp.top(), pq_cp.pop();}return os << "}";}void pprint() { cout << endl; }template <class Head, class... Tail> void pprint(Head &&head, Tail &&...tail) {cout << head;if (sizeof...(Tail) > 0)cout << ' ';pprint(move(tail)...);}// dump#define DUMPOUT cerrvoid dump_func() { DUMPOUT << endl; }template <class Head, class... Tail> void dump_func(Head &&head, Tail &&...tail) {DUMPOUT << head;if (sizeof...(Tail) > 0)DUMPOUT << ", ";dump_func(move(tail)...);}// chmax (更新「される」かもしれない値が前)template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) {if (comp(xmax, x)) {xmax = x;return true;}return false;}// chmin (更新「される」かもしれない値が前)template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) {if (comp(x, xmin)) {xmin = x;return true;}return false;}// ローカル用#ifndef ONLINE_JUDGE#define DEBUG_#endif#ifdef DEBUG_#define DEB#define dump(...) \DUMPOUT << " " << string(#__VA_ARGS__) << ": " \<< "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \<< " ", \dump_func(__VA_ARGS__)#else#define DEB if (false)#define dump(...)#endif#define VAR(type, ...) \type __VA_ARGS__; \cin >> __VA_ARGS__;template <typename T> istream &operator,(istream &is, T &rhs) { return is >> rhs; }template <typename T> ostream &operator,(ostream &os, const T &rhs) { return os << ' ' << rhs; }struct AtCoderInitialize {static constexpr int IOS_PREC = 15;static constexpr bool AUTOFLUSH = false;AtCoderInitialize() {ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);cout << fixed << setprecision(IOS_PREC);if (AUTOFLUSH)cout << unitbuf;}} ATCODER_INITIALIZE;void Yn(bool p) { cout << (p ? "Yes" : "No") << endl; }void YN(bool p) { cout << (p ? "YES" : "NO") << endl; }/* #endregion */// #include <atcoder/all>// using namespace atcoder;template <class tProposition, typename T = ll> T binarySearchIntMax(T left, T right, tProposition p) {if (right < left)return -1;T mid;while (left + 1 < right) {mid = (left + right) / 2;if (p(mid))left = mid;else // fn > 0right = mid - 1;}if (p(right))return right;else if (p(left))return left;elsereturn -1;}// Problemvoid solve() {VAR(ll, n); // 5e5VAR(string, k);vll c(9);cin >> c;ll sz = SIZE(k);if (sz > n) {pprint(-1);return;}// padreverse(ALL(k));REP(i, 0, n - sz) { k.push_back('0'); }reverse(ALL(k));// dump(k);// 「より大きい」がはじめて適用される桁を上位から探索する// なるべく下位桁で適用したいので，どこまで下げられるか二分探索する// ただし，はじめに「9」担っている桁では「より大きい」を適用できないので，// そのような桁を除外する必要があるvll mids;REP(i, 0, n) {if (k[i] != '9')mids.push_back(i);}string ans;vll cc = c;ll x = binarySearchIntMax(0LL, SIZE(mids) - 1, [&](ll midi) -> bool {ll mid = mids[midi];ans.clear();c = cc;REP(i, 0, n) {ll digit = k[i] - '0';bool ok = false;ll mi = digit - 1;ll ma = 9;if (i < mid)ma = mi + 1;if (i == mid)mi++;else if (i > mid)mi = 0;REP(j, max(0LL, mi), ma) {if (c[j] > 0) {ans.push_back('1' + j);c[j]--;ok = true;break;}}if (!ok) {// dump(mid, i, digit, c, ans, mi, ma);return false;}}return true;});// dump(c);// dump(x);if (x == -1) {pprint(-1);return;}pprint(ans);}// entry pointint main() {solve();return 0;}