結果
問題 | No.2732 Similar Permutations |
ユーザー | noya2 |
提出日時 | 2024-04-19 23:53:41 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 64 ms / 2,000 ms |
コード長 | 15,483 bytes |
コンパイル時間 | 3,792 ms |
コンパイル使用メモリ | 265,888 KB |
実行使用メモリ | 15,488 KB |
最終ジャッジ日時 | 2024-10-11 18:45:42 |
合計ジャッジ時間 | 19,197 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 11 ms
15,360 KB |
testcase_01 | AC | 11 ms
15,488 KB |
testcase_02 | AC | 22 ms
8,192 KB |
testcase_03 | AC | 35 ms
8,924 KB |
testcase_04 | AC | 14 ms
7,900 KB |
testcase_05 | AC | 12 ms
7,680 KB |
testcase_06 | AC | 7 ms
7,440 KB |
testcase_07 | AC | 27 ms
8,680 KB |
testcase_08 | AC | 16 ms
8,056 KB |
testcase_09 | AC | 9 ms
7,624 KB |
testcase_10 | AC | 61 ms
10,240 KB |
testcase_11 | AC | 8 ms
7,528 KB |
testcase_12 | AC | 62 ms
10,320 KB |
testcase_13 | AC | 61 ms
10,424 KB |
testcase_14 | AC | 62 ms
10,468 KB |
testcase_15 | AC | 61 ms
10,496 KB |
testcase_16 | AC | 45 ms
9,600 KB |
testcase_17 | AC | 44 ms
9,528 KB |
testcase_18 | AC | 57 ms
10,176 KB |
testcase_19 | AC | 62 ms
10,452 KB |
testcase_20 | AC | 61 ms
10,412 KB |
testcase_21 | AC | 62 ms
10,496 KB |
testcase_22 | AC | 36 ms
9,012 KB |
testcase_23 | AC | 62 ms
10,368 KB |
testcase_24 | AC | 37 ms
9,132 KB |
testcase_25 | AC | 62 ms
10,456 KB |
testcase_26 | AC | 51 ms
9,984 KB |
testcase_27 | AC | 62 ms
10,368 KB |
testcase_28 | AC | 48 ms
9,728 KB |
testcase_29 | AC | 62 ms
10,368 KB |
testcase_30 | AC | 45 ms
9,472 KB |
testcase_31 | AC | 63 ms
10,460 KB |
testcase_32 | AC | 60 ms
10,112 KB |
testcase_33 | AC | 63 ms
10,496 KB |
testcase_34 | AC | 42 ms
9,216 KB |
testcase_35 | AC | 64 ms
10,496 KB |
testcase_36 | AC | 57 ms
10,240 KB |
testcase_37 | AC | 63 ms
10,496 KB |
testcase_38 | AC | 55 ms
10,112 KB |
testcase_39 | AC | 62 ms
10,496 KB |
testcase_40 | AC | 52 ms
9,856 KB |
testcase_41 | AC | 62 ms
10,496 KB |
testcase_42 | AC | 47 ms
9,728 KB |
testcase_43 | AC | 63 ms
10,496 KB |
testcase_44 | AC | 33 ms
8,960 KB |
testcase_45 | AC | 62 ms
10,496 KB |
testcase_46 | AC | 56 ms
9,984 KB |
testcase_47 | AC | 62 ms
10,368 KB |
testcase_48 | AC | 39 ms
9,088 KB |
testcase_49 | AC | 62 ms
10,496 KB |
testcase_50 | AC | 38 ms
9,216 KB |
testcase_51 | AC | 59 ms
10,496 KB |
testcase_52 | AC | 52 ms
9,856 KB |
testcase_53 | AC | 64 ms
10,496 KB |
testcase_54 | AC | 63 ms
10,368 KB |
testcase_55 | AC | 63 ms
10,496 KB |
testcase_56 | AC | 63 ms
10,368 KB |
testcase_57 | AC | 35 ms
8,960 KB |
testcase_58 | AC | 45 ms
9,600 KB |
testcase_59 | AC | 43 ms
9,472 KB |
testcase_60 | AC | 36 ms
8,960 KB |
testcase_61 | AC | 33 ms
8,832 KB |
testcase_62 | AC | 53 ms
9,984 KB |
testcase_63 | AC | 11 ms
15,360 KB |
testcase_64 | AC | 12 ms
15,488 KB |
testcase_65 | AC | 11 ms
15,488 KB |
testcase_66 | AC | 11 ms
15,360 KB |
testcase_67 | AC | 12 ms
15,488 KB |
testcase_68 | AC | 12 ms
15,488 KB |
testcase_69 | AC | 12 ms
15,360 KB |
testcase_70 | AC | 12 ms
15,488 KB |
testcase_71 | AC | 12 ms
15,360 KB |
testcase_72 | AC | 11 ms
15,360 KB |
testcase_73 | AC | 11 ms
15,488 KB |
testcase_74 | AC | 11 ms
15,360 KB |
testcase_75 | AC | 11 ms
15,488 KB |
testcase_76 | AC | 12 ms
15,488 KB |
testcase_77 | AC | 12 ms
15,488 KB |
testcase_78 | AC | 12 ms
15,488 KB |
testcase_79 | AC | 11 ms
15,360 KB |
testcase_80 | AC | 12 ms
15,488 KB |
testcase_81 | AC | 12 ms
15,488 KB |
testcase_82 | AC | 11 ms
15,488 KB |
testcase_83 | AC | 11 ms
15,488 KB |
testcase_84 | AC | 11 ms
15,488 KB |
testcase_85 | AC | 12 ms
15,488 KB |
testcase_86 | AC | 12 ms
15,488 KB |
testcase_87 | AC | 12 ms
15,488 KB |
testcase_88 | AC | 12 ms
15,360 KB |
testcase_89 | AC | 12 ms
15,488 KB |
testcase_90 | AC | 12 ms
15,488 KB |
testcase_91 | AC | 11 ms
15,488 KB |
testcase_92 | AC | 11 ms
15,360 KB |
testcase_93 | AC | 11 ms
15,488 KB |
testcase_94 | AC | 11 ms
15,488 KB |
testcase_95 | AC | 11 ms
15,488 KB |
testcase_96 | AC | 12 ms
15,360 KB |
testcase_97 | AC | 12 ms
15,360 KB |
testcase_98 | AC | 12 ms
15,360 KB |
testcase_99 | AC | 11 ms
15,488 KB |
testcase_100 | AC | 12 ms
15,488 KB |
testcase_101 | AC | 12 ms
15,488 KB |
testcase_102 | AC | 12 ms
15,488 KB |
ソースコード
#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp" using namespace std; #include<bits/stdc++.h> #line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp" namespace noya2 { template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &p){ os << p.first << " " << p.second; return os; } template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &p){ is >> p.first >> p.second; return is; } template <typename T> ostream &operator<<(ostream &os, const vector<T> &v){ int s = (int)v.size(); for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i]; return os; } template <typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; } void in() {} template <typename T, class... U> void in(T &t, U &...u){ cin >> t; in(u...); } void out() { cout << "\n"; } template <typename T, class... U, char sep = ' '> void out(const T &t, const U &...u){ cout << t; if (sizeof...(u)) cout << sep; out(u...); } template<typename T> void out(const vector<vector<T>> &vv){ int s = (int)vv.size(); for (int i = 0; i < s; i++) out(vv[i]); } struct IoSetup { IoSetup(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); cerr << fixed << setprecision(7); } } iosetup_noya2; } // namespace noya2 #line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp" namespace noya2{ const int iinf = 1'000'000'007; const long long linf = 2'000'000'000'000'000'000LL; const long long mod998 = 998244353; const long long mod107 = 1000000007; const long double pi = 3.14159265358979323; const vector<int> dx = {0,1,0,-1,1,1,-1,-1}; const vector<int> dy = {1,0,-1,0,1,-1,-1,1}; const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; const string alp = "abcdefghijklmnopqrstuvwxyz"; const string NUM = "0123456789"; void yes(){ cout << "Yes\n"; } void no(){ cout << "No\n"; } void YES(){ cout << "YES\n"; } void NO(){ cout << "NO\n"; } void yn(bool t){ t ? yes() : no(); } void YN(bool t){ t ? YES() : NO(); } } // namespace noya2 #line 1 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp" namespace noya2{ unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){ if (a == 0 || b == 0) return a + b; int n = __builtin_ctzll(a); a >>= n; int m = __builtin_ctzll(b); b >>= m; while (a != b) { int mm = __builtin_ctzll(a - b); bool f = a > b; unsigned long long c = f ? a : b; b = f ? b : a; a = (c - b) >> mm; } return a << min(n, m); } template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(abs(a),abs(b))); } long long sqrt_fast(long long n) { if (n <= 0) return 0; long long x = sqrt(n); while ((x + 1) * (x + 1) <= n) x++; while (x * x > n) x--; return x; } template<typename T> T floor_div(const T n, const T d) { assert(d != 0); return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0); } template<typename T> T ceil_div(const T n, const T d) { assert(d != 0); return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0); } template<typename T> void uniq(vector<T> &v){ sort(v.begin(),v.end()); v.erase(unique(v.begin(),v.end()),v.end()); } template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; } template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; } template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; } } // namespace noya2 #line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp" #define rep(i,n) for (int i = 0; i < (int)(n); i++) #define repp(i,m,n) for (int i = (m); i < (int)(n); i++) #define reb(i,n) for (int i = (int)(n-1); i >= 0; i--) #define all(v) (v).begin(),(v).end() using ll = long long; using ld = long double; using uint = unsigned int; using ull = unsigned long long; using pii = pair<int,int>; using pll = pair<ll,ll>; using pil = pair<int,ll>; using pli = pair<ll,int>; namespace noya2{ /* ~ (. _________ . /) */ } using namespace noya2; #line 2 "c.cpp" const int mx = 1<<19; #line 2 "/Users/noya2/Desktop/Noya2_library/utility/modint.hpp" #line 2 "/Users/noya2/Desktop/Noya2_library/math/prime.hpp" #line 4 "/Users/noya2/Desktop/Noya2_library/math/prime.hpp" namespace noya2 { constexpr ll safe_mod(ll x, ll m) { x %= m; if (x < 0) x += m; return x; } constexpr ll pow_mod_constexpr(ll x, ll n, int m) { if (m == 1) return 0; uint _m = (uint)(m); ull r = 1; ull y = safe_mod(x, m); while (n) { if (n & 1) r = (r * y) % _m; y = (y * y) % _m; n >>= 1; } return r; } constexpr bool is_prime_constexpr(int n) { if (n <= 1) return false; if (n == 2 || n == 7 || n == 61) return true; if (n % 2 == 0) return false; ll d = n - 1; while (d % 2 == 0) d /= 2; constexpr ll bases[3] = {2, 7, 61}; for (ll a : bases) { ll t = d; ll y = pow_mod_constexpr(a, t, n); while (t != n - 1 && y != 1 && y != n - 1) { y = y * y % n; t <<= 1; } if (y != n - 1 && t % 2 == 0) { return false; } } return true; } template <int n> constexpr bool is_prime_flag = is_prime_constexpr(n); constexpr std::pair<long long, long long> inv_gcd(long long a, long long b) { a = safe_mod(a, b); if (a == 0) return {b, 0}; long long s = b, t = a; long long m0 = 0, m1 = 1; while (t) { long long u = s / t; s -= t * u; m0 -= m1 * u; auto tmp = s; s = t; t = tmp; tmp = m0; m0 = m1; m1 = tmp; } if (m0 < 0) m0 += b / s; return {s, m0}; } constexpr int primitive_root_constexpr(int m) { if (m == 2) return 1; if (m == 167772161) return 3; if (m == 469762049) return 3; if (m == 754974721) return 11; if (m == 998244353) return 3; int divs[20] = {}; divs[0] = 2; int cnt = 1; int x = (m - 1) / 2; while (x % 2 == 0) x /= 2; for (int i = 3; (ll)(i)*i <= x; i += 2) { if (x % i == 0) { divs[cnt++] = i; while (x % i == 0) { x /= i; } } } if (x > 1) { divs[cnt++] = x; } for (int g = 2;; g++) { bool ok = true; for (int i = 0; i < cnt; i++) { if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) { ok = false; break; } } if (ok) return g; } } template <int m> constexpr int primitive_root_flag = primitive_root_constexpr(m); } // namespace noya2 #line 4 "/Users/noya2/Desktop/Noya2_library/utility/modint.hpp" namespace noya2{ struct barrett { uint _m; ull im; explicit barrett(uint m) : _m(m), im((ull)(-1) / m + 1) {} uint umod() const { return _m; } uint mul(uint a, uint b) const { ull z = a; z *= b; ull x = ull((__uint128_t(z) * im) >> 64); uint v = (uint)(z - x * _m); if (_m <= v) v += _m; return v; } }; template <int m> struct static_modint { using mint = static_modint; public: static constexpr int mod() { return m; } static mint raw(int v) { mint x; x._v = v; return x; } constexpr static_modint() : _v(0) {} template<signed_integral T> constexpr static_modint(T v){ ll x = (ll)(v % (ll)(umod())); if (x < 0) x += umod(); _v = (uint)(x); } template<unsigned_integral T> constexpr static_modint(T v){ _v = (uint)(v % umod()); } constexpr unsigned int val() const { return _v; } mint& operator++() { _v++; if (_v == umod()) _v = 0; return *this; } mint& operator--() { if (_v == 0) _v = umod(); _v--; return *this; } mint operator++(int) { mint result = *this; ++*this; return result; } mint operator--(int) { mint result = *this; --*this; return result; } constexpr mint& operator+=(const mint& rhs) { _v += rhs._v; if (_v >= umod()) _v -= umod(); return *this; } constexpr mint& operator-=(const mint& rhs) { _v -= rhs._v; if (_v >= umod()) _v += umod(); return *this; } constexpr mint& operator*=(const mint& rhs) { ull z = _v; z *= rhs._v; _v = (uint)(z % umod()); return *this; } constexpr mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); } constexpr mint operator+() const { return *this; } constexpr mint operator-() const { return mint() - *this; } constexpr mint pow(ll n) const { assert(0 <= n); mint x = *this, r = 1; while (n) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; } constexpr mint inv() const { if (prime) { assert(_v); return pow(umod() - 2); } else { auto eg = inv_gcd(_v, m); assert(eg.first == 1); return eg.second; } } friend constexpr mint operator+(const mint& lhs, const mint& rhs) { return mint(lhs) += rhs; } friend constexpr mint operator-(const mint& lhs, const mint& rhs) { return mint(lhs) -= rhs; } friend constexpr mint operator*(const mint& lhs, const mint& rhs) { return mint(lhs) *= rhs; } friend constexpr mint operator/(const mint& lhs, const mint& rhs) { return mint(lhs) /= rhs; } friend constexpr bool operator==(const mint& lhs, const mint& rhs) { return lhs._v == rhs._v; } friend constexpr bool operator!=(const mint& lhs, const mint& rhs) { return lhs._v != rhs._v; } friend std::ostream &operator<<(std::ostream &os, const mint& p) { return os << p.val(); } friend std::istream &operator>>(std::istream &is, mint &a) { long long t; is >> t; a = mint(t); return (is); } private: unsigned int _v; static constexpr unsigned int umod() { return m; } static constexpr bool prime = is_prime_flag<m>; }; template <int id> struct dynamic_modint { using mint = dynamic_modint; public: static int mod() { return (int)(bt.umod()); } static void set_mod(int m) { assert(1 <= m); bt = barrett(m); } static mint raw(int v) { mint x; x._v = v; return x; } dynamic_modint() : _v(0) {} template<signed_integral T> dynamic_modint(T v){ ll x = (ll)(v % (ll)(mod())); if (x < 0) x += mod(); _v = (uint)(x); } template<unsigned_integral T> dynamic_modint(T v){ _v = (uint)(v % mod()); } uint val() const { return _v; } mint& operator++() { _v++; if (_v == umod()) _v = 0; return *this; } mint& operator--() { if (_v == 0) _v = umod(); _v--; return *this; } mint operator++(int) { mint result = *this; ++*this; return result; } mint operator--(int) { mint result = *this; --*this; return result; } mint& operator+=(const mint& rhs) { _v += rhs._v; if (_v >= umod()) _v -= umod(); return *this; } mint& operator-=(const mint& rhs) { _v += mod() - rhs._v; if (_v >= umod()) _v -= umod(); return *this; } mint& operator*=(const mint& rhs) { _v = bt.mul(_v, rhs._v); return *this; } mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); } mint operator+() const { return *this; } mint operator-() const { return mint() - *this; } mint pow(long long n) const { assert(0 <= n); mint x = *this, r = 1; while (n) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; } mint inv() const { auto eg = noya2::inv_gcd(_v, mod()); assert(eg.first == 1); return eg.second; } friend mint operator+(const mint& lhs, const mint& rhs) { return mint(lhs) += rhs; } friend mint operator-(const mint& lhs, const mint& rhs) { return mint(lhs) -= rhs; } friend mint operator*(const mint& lhs, const mint& rhs) { return mint(lhs) *= rhs; } friend mint operator/(const mint& lhs, const mint& rhs) { return mint(lhs) /= rhs; } friend bool operator==(const mint& lhs, const mint& rhs) { return lhs._v == rhs._v; } friend bool operator!=(const mint& lhs, const mint& rhs) { return lhs._v != rhs._v; } friend std::ostream &operator<<(std::ostream &os, const mint& p) { return os << p.val(); } friend std::istream &operator>>(std::istream &is, mint &a) { long long t; is >> t; a = mint(t); return (is); } private: unsigned int _v; static barrett bt; static unsigned int umod() { return bt.umod(); } }; template <int id> noya2::barrett dynamic_modint<id>::bt(998244353); using modint998244353 = static_modint<998244353>; using modint1000000007 = static_modint<1000000007>; using modint = dynamic_modint<-1>; template<typename T> concept Modint = requires (T &a){ T::mod(); a.inv(); a.val(); a.pow(declval<int>()); }; } // namespace noya2 #line 7 "c.cpp" using mint = modint998244353; mt19937 mt(-1); void solve(){ int n; in(n); vector<int> a(n); in(a); if (n <= 10){ vector<int> p(n); iota(all(p),1); vector<vector<int>> memo(mx); do { int x = 0; rep(i,n) x ^= p[i]+a[i]; if (memo[x].empty()){ memo[x] = p; continue; } out(memo[x]); out(p); return ; }while(next_permutation(all(p))); out(-1); return ; } vector<int> p(n); iota(all(p),1); shuffle(all(p),mt); mint base = mt(); vector<mint> bs(n+1,1); rep(i,n) bs[i+1] = bs[i] * base; mint hs = 0; int xs = 0; rep(i,n){ hs += bs[i] * p[i]; xs ^= p[i] + a[i]; } vector<pii> dat; vector<pair<int,mint>> memo(mx,{-1,0}); auto process = [&](int i, int j){ hs -= bs[i] * p[i]; hs -= bs[j] * p[j]; xs ^= p[i] + a[i]; xs ^= p[j] + a[j]; swap(p[i],p[j]); hs += bs[i] * p[i]; hs += bs[j] * p[j]; xs ^= p[i] + a[i]; xs ^= p[j] + a[j]; dat.emplace_back(i,j); if (memo[xs].first == -1){ memo[xs] = {dat.size(),hs}; return false; } if (memo[xs].second == hs){ return false; } return true; }; memo[xs] = {0,hs}; auto ini = p; while (true){ int i = mt() % n; int j = mt() % n; if (i == j) continue; if (process(i,j)){ rep(t,memo[xs].first){ auto [l, r] = dat[t]; swap(ini[l],ini[r]); } out(ini); out(p); return ; } } } int main(){ int t = 1; //in(t); while (t--) { solve(); } }