結果
問題 | No.927 Second Permutation |
ユーザー |
|
提出日時 | 2019-11-22 21:58:34 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 6 ms / 2,000 ms |
コード長 | 3,995 bytes |
コンパイル時間 | 2,508 ms |
コンパイル使用メモリ | 198,412 KB |
最終ジャッジ日時 | 2025-01-08 04:59:20 |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 27 |
ソースコード
#include <bits/stdc++.h>// created [2019/11/22] 21:40:35#pragma GCC diagnostic ignored "-Wsign-compare"#pragma GCC diagnostic ignored "-Wsign-conversion"using i32 = int32_t;using i64 = int64_t;using u32 = uint32_t;using u64 = uint64_t;using uint = unsigned int;using usize = std::size_t;using ll = long long;using ull = unsigned long long;using ld = long double;template<typename T> constexpr T popcount(const T u) { return u ? static_cast<T>(__builtin_popcountll(static_cast<u64>(u))) : static_cast<T>(0); }template<typename T> constexpr T log2p1(const T u) { return u ? static_cast<T>(64 - __builtin_clzll(static_cast<u64>(u))) : static_cast<T>(0); }template<typename T> constexpr T msbp1(const T u) { return log2p1(u); }template<typename T> constexpr T lsbp1(const T u) { return __builtin_ffsll(u); }template<typename T> constexpr T clog(const T u) { return u ? log2p1(u - 1) : static_cast<T>(u); }template<typename T> constexpr bool ispow2(const T u) { return u and (static_cast<u64>(u) & static_cast<u64>(u - 1)) == 0; }template<typename T> constexpr T ceil2(const T u) { return static_cast<T>(1) << clog(u); }template<typename T> constexpr T floor2(const T u) { return u == 0 ? static_cast<T>(0) : static_cast<T>(1) << (log2p1(u) - 1); }template<typename T> constexpr bool btest(const T mask, const usize ind) { return static_cast<bool>((static_cast<u64>(mask) >> ind) & static_cast<u64>(1)); }template<typename T> void bset(T& mask, const usize ind) { mask |= (static_cast<T>(1) << ind); }template<typename T> void breset(T& mask, const usize ind) { mask &= ~(static_cast<T>(1) << ind); }template<typename T> void bflip(T& mask, const usize ind) { mask ^= (static_cast<T>(1) << ind); }template<typename T> void bset(T& mask, const usize ind, const bool b) { (b ? bset(mask, ind) : breset(mask, ind)); }template<typename T> constexpr T bcut(const T mask, const usize ind) { return ind == 0 ? static_cast<T>(0) : static_cast<T>((static_cast<u64>(mask) <<(64 - ind)) >> (64 - ind)); }template<typename T> bool chmin(T& a, const T& b) { return (a > b ? a = b, true : false); }template<typename T> bool chmax(T& a, const T& b) { return (a < b ? a = b, true : false); }constexpr unsigned int mod = 1000000007;template<typename T> constexpr T inf_v = std::numeric_limits<T>::max() / 4;template<typename Real> constexpr Real pi_v = Real{3.141592653589793238462643383279502884};template<typename T>T read(){T v;return std::cin >> v, v;}template<typename T, typename... Args>auto read(const usize size, Args... args){std::vector<decltype(read<T>(args...))> ans(size);for (usize i = 0; i < size; i++) { ans[i] = read<T>(args...); }return ans;}template<typename... Types>auto reads() { return std::tuple<std::decay_t<Types>...>{read<Types>()...}; }# define SHOW(...) static_cast<void>(0)template<typename T>std::vector<T> make_v(const usize size, const T v) { return std::vector<T>(size, v); }template<typename... Args>auto make_v(const usize size, Args... args) { return std::vector<decltype(make_v(args...))>(size, make_v(args...)); }int main(){const auto X = read<std::string>();std::vector<int> num(10, 0);for (const char c : X) { num[c - '0']++; }std::vector<std::string> s(10);for (int i = 0; i < 10; i++) { s[i] = std::string(num[i], '0' + i); }SHOW(s);std::string max;for (int i = 9; i >= 0; i--) { max += s[i]; }std::vector<int> exist;for (int i = 0; i < 10; i++) {if (num[i] > 0) { exist.push_back(i); }}if (exist.size() <= 1) { return std::cout << -1 << std::endl, 0; }const int m1 = exist[0], m2 = exist[1];s[m2].back() = '0' + m1;s[m1].front() = '0' + m2;std::string ans;for (int i = 9; i >= 0; i--) { ans += s[i]; }if (ans.front() == '0') { return std::cout << -1 << std::endl, 0; }if (max == ans) { return std::cout << -1 << std::endl, 0; }std::cout << ans << std::endl;}