結果
問題 | No.2732 Similar Permutations |
ユーザー | だれ |
提出日時 | 2024-04-19 22:44:28 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 76 ms / 2,000 ms |
コード長 | 8,282 bytes |
コンパイル時間 | 4,730 ms |
コンパイル使用メモリ | 246,148 KB |
実行使用メモリ | 11,168 KB |
最終ジャッジ日時 | 2024-10-11 16:33:24 |
合計ジャッジ時間 | 20,564 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 22 ms
5,548 KB |
testcase_03 | AC | 41 ms
7,488 KB |
testcase_04 | AC | 14 ms
5,248 KB |
testcase_05 | AC | 11 ms
5,248 KB |
testcase_06 | AC | 5 ms
5,248 KB |
testcase_07 | AC | 30 ms
6,424 KB |
testcase_08 | AC | 16 ms
5,248 KB |
testcase_09 | AC | 8 ms
5,248 KB |
testcase_10 | AC | 74 ms
11,088 KB |
testcase_11 | AC | 7 ms
5,248 KB |
testcase_12 | AC | 75 ms
11,040 KB |
testcase_13 | AC | 76 ms
11,096 KB |
testcase_14 | AC | 76 ms
11,048 KB |
testcase_15 | AC | 75 ms
11,048 KB |
testcase_16 | AC | 52 ms
8,248 KB |
testcase_17 | AC | 51 ms
8,324 KB |
testcase_18 | AC | 70 ms
10,660 KB |
testcase_19 | AC | 75 ms
11,044 KB |
testcase_20 | AC | 75 ms
10,996 KB |
testcase_21 | AC | 76 ms
11,048 KB |
testcase_22 | AC | 41 ms
7,472 KB |
testcase_23 | AC | 74 ms
11,044 KB |
testcase_24 | AC | 42 ms
7,556 KB |
testcase_25 | AC | 73 ms
11,040 KB |
testcase_26 | AC | 59 ms
9,988 KB |
testcase_27 | AC | 72 ms
10,916 KB |
testcase_28 | AC | 55 ms
8,820 KB |
testcase_29 | AC | 70 ms
11,040 KB |
testcase_30 | AC | 49 ms
8,344 KB |
testcase_31 | AC | 69 ms
11,044 KB |
testcase_32 | AC | 64 ms
10,804 KB |
testcase_33 | AC | 69 ms
11,044 KB |
testcase_34 | AC | 43 ms
8,032 KB |
testcase_35 | AC | 68 ms
11,044 KB |
testcase_36 | AC | 63 ms
10,676 KB |
testcase_37 | AC | 67 ms
11,028 KB |
testcase_38 | AC | 57 ms
10,240 KB |
testcase_39 | AC | 65 ms
10,916 KB |
testcase_40 | AC | 53 ms
10,132 KB |
testcase_41 | AC | 63 ms
10,916 KB |
testcase_42 | AC | 47 ms
8,584 KB |
testcase_43 | AC | 62 ms
11,044 KB |
testcase_44 | AC | 31 ms
7,240 KB |
testcase_45 | AC | 62 ms
11,168 KB |
testcase_46 | AC | 55 ms
10,484 KB |
testcase_47 | AC | 59 ms
10,920 KB |
testcase_48 | AC | 35 ms
7,780 KB |
testcase_49 | AC | 58 ms
11,044 KB |
testcase_50 | AC | 34 ms
7,748 KB |
testcase_51 | AC | 55 ms
11,040 KB |
testcase_52 | AC | 47 ms
10,196 KB |
testcase_53 | AC | 75 ms
11,044 KB |
testcase_54 | AC | 75 ms
10,896 KB |
testcase_55 | AC | 75 ms
11,040 KB |
testcase_56 | AC | 75 ms
11,020 KB |
testcase_57 | AC | 38 ms
7,240 KB |
testcase_58 | AC | 51 ms
8,304 KB |
testcase_59 | AC | 48 ms
7,936 KB |
testcase_60 | AC | 41 ms
7,492 KB |
testcase_61 | AC | 37 ms
7,184 KB |
testcase_62 | AC | 61 ms
9,096 KB |
testcase_63 | AC | 2 ms
5,248 KB |
testcase_64 | AC | 2 ms
5,248 KB |
testcase_65 | AC | 2 ms
5,248 KB |
testcase_66 | AC | 2 ms
5,248 KB |
testcase_67 | AC | 2 ms
5,248 KB |
testcase_68 | AC | 2 ms
5,248 KB |
testcase_69 | AC | 2 ms
5,248 KB |
testcase_70 | AC | 2 ms
5,248 KB |
testcase_71 | AC | 2 ms
5,248 KB |
testcase_72 | AC | 2 ms
5,248 KB |
testcase_73 | AC | 2 ms
5,248 KB |
testcase_74 | AC | 2 ms
5,248 KB |
testcase_75 | AC | 2 ms
5,248 KB |
testcase_76 | AC | 2 ms
5,248 KB |
testcase_77 | AC | 2 ms
5,248 KB |
testcase_78 | AC | 2 ms
5,248 KB |
testcase_79 | AC | 2 ms
5,248 KB |
testcase_80 | AC | 2 ms
5,248 KB |
testcase_81 | AC | 2 ms
5,248 KB |
testcase_82 | AC | 2 ms
5,248 KB |
testcase_83 | AC | 2 ms
5,248 KB |
testcase_84 | AC | 2 ms
5,248 KB |
testcase_85 | AC | 2 ms
5,248 KB |
testcase_86 | AC | 2 ms
5,248 KB |
testcase_87 | AC | 2 ms
5,248 KB |
testcase_88 | AC | 2 ms
5,248 KB |
testcase_89 | AC | 2 ms
5,248 KB |
testcase_90 | AC | 2 ms
5,248 KB |
testcase_91 | AC | 2 ms
5,248 KB |
testcase_92 | AC | 2 ms
5,248 KB |
testcase_93 | AC | 2 ms
5,248 KB |
testcase_94 | AC | 3 ms
5,248 KB |
testcase_95 | AC | 2 ms
5,248 KB |
testcase_96 | AC | 2 ms
5,248 KB |
testcase_97 | AC | 2 ms
5,248 KB |
testcase_98 | AC | 2 ms
5,248 KB |
testcase_99 | AC | 2 ms
5,248 KB |
testcase_100 | AC | 2 ms
5,248 KB |
testcase_101 | AC | 2 ms
5,248 KB |
testcase_102 | AC | 2 ms
5,248 KB |
ソースコード
#include <algorithm> #include <bitset> #include <cassert> #include <cmath> #include <complex> #include <cstdio> #include <fstream> #include <functional> #include <iomanip> #include <iostream> #include <iterator> #include <map> #include <numeric> #include <queue> #include <random> #include <set> #include <sstream> #include <stack> #include <unordered_set> using namespace std; #if __has_include(<atcoder/all>) #include <atcoder/all> #endif #define GET_MACRO(_1, _2, _3, NAME, ...) NAME #define _rep(i, n) _rep2(i, 0, n) #define _rep2(i, a, b) for (int i = (int)(a); i < (int)(b); i++) #define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #define UNIQUE(x) \ std::sort((x).begin(), (x).end()); \ (x).erase(std::unique((x).begin(), (x).end()), (x).end()) using i64 = long long; template <class T, class U> bool chmin(T& a, const U& b) { return (b < a) ? (a = b, true) : false; } template <class T, class U> bool chmax(T& a, const U& b) { return (b > a) ? (a = b, true) : false; } template <class T = std::string, class U = std::string> inline void YesNo(bool f = 0, const T yes = "Yes", const U no = "No") { if (f) std::cout << yes << "\n"; else std::cout << no << "\n"; } namespace io { template <class T, class U> istream& operator>>(istream& i, pair<T, U>& p) { i >> p.first >> p.second; return i; } template <typename T> istream& operator>>(istream& i, vector<T>& v) { rep(j, v.size()) i >> v[j]; return i; } template <typename T> string join(vector<T>& v) { stringstream s; rep(i, v.size()) s << ' ' << v[i]; return s.str().substr(1); } template <typename T> ostream& operator<<(ostream& o, vector<T>& v) { if (v.size()) o << join(v); return o; } template <typename T> string join(vector<vector<T>>& vv) { string s = "\n"; rep(i, vv.size()) s += join(vv[i]) + "\n"; return s; } template <typename T> ostream& operator<<(ostream& o, vector<vector<T>>& vv) { if (vv.size()) o << join(vv); return o; } template <class T, class U> ostream& operator<<(ostream& o, pair<T, U>& p) { o << p.first << " " << p.second; return o; } void OUT() { std::cout << "\n"; } template <class Head, class... Tail> void OUT(Head&& head, Tail&&... tail) { std::cout << head; if (sizeof...(tail)) std::cout << ' '; OUT(std::forward<Tail>(tail)...); } void OUTL() { std::cout << std::endl; } template <class Head, class... Tail> void OUTL(Head&& head, Tail&&... tail) { std::cout << head; if (sizeof...(tail)) std::cout << ' '; OUTL(std::forward<Tail>(tail)...); } void IN() {} template <class Head, class... Tail> void IN(Head&& head, Tail&&... tail) { cin >> head; IN(std::forward<Tail>(tail)...); } } // namespace io using namespace io; namespace useful { long long modpow(long long a, long long b, long long mod) { long long res = 1; while (b) { if (b & 1) res *= a, res %= mod; a *= a; a %= mod; b >>= 1; } return res; } bool is_pow2(long long x) { return x > 0 && (x & (x - 1)) == 0; } template <class T> void rearrange(vector<T>& a, vector<int>& p) { vector<T> b = a; for (int i = 0; i < int(a.size()); i++) { a[i] = b[p[i]]; } return; } template <class T> vector<pair<T, int>> rle_sequence(vector<T>& a) { vector<pair<T, int>> res; int n = a.size(); int l = 1; rep(i, n - 1) { if (a[i] == a[i + 1]) l++; else { res.emplace_back(a[i], l); l = 1; } } res.emplace_back(a.back(), l); return res; } vector<pair<char, int>> rle_string(string a) { vector<pair<char, int>> res; int n = a.size(); if (n == 1) return vector<pair<char, int>>{{a[0], 1}}; int l = 1; rep(i, n - 1) { if (a[i] == a[i + 1]) l++; else { res.emplace_back(a[i], l); l = 1; } } res.emplace_back(a.back(), l); return res; } vector<int> linear_sieve(int n) { vector<int> primes; vector<int> res(n + 1); iota(all(res), 0); for (int i = 2; i <= n; i++) { if (res[i] == i) primes.emplace_back(i); for (auto j : primes) { if (j * i > n) break; res[j * i] = j; } } return res; // return primes; } template <class T> vector<long long> dijkstra(vector<vector<pair<int, T>>>& graph, int start) { int n = graph.size(); vector<long long> res(n, 2e18); res[start] = 0; priority_queue<pair<long long, int>, vector<pair<long long, int>>, greater<pair<long long, int>>> que; que.push({0, start}); while (!que.empty()) { auto [c, v] = que.top(); que.pop(); if (res[v] < c) continue; for (auto [nxt, cost] : graph[v]) { auto x = c + cost; if (x < res[nxt]) { res[nxt] = x; que.push({x, nxt}); } } } return res; } } // namespace useful using namespace useful; int main() { cin.tie(nullptr); ios::sync_with_stdio(false); clock_t start = clock(); int n; IN(n); vector<int> a(n); IN(a); if (n <= 5) { vector<int> p(n), q(n); iota(all(p), 1); iota(all(q), 1); do { int tt = 0; rep(i, n) tt ^= a[i] + q[i]; do { int ss = 0; rep(i, n) ss ^= a[i] + p[i]; if (ss == tt && p != q) { OUT(p); OUT(q); return 0; } } while (next_permutation(all(p))); } while (next_permutation(all(q))); OUT(-1); return 0; } if (n == 1) { OUT(-1); return 0; } vector<int> p(n), q(n); vector<int> t(n); iota(all(t), 0); sort(all(t), [&](int i, int j) { return a[i] < a[j]; }); rep(i, n - 1) { if (a[t[i + 1]] == a[t[i]]) { p[t[i]] = 1; p[t[i + 1]] = 2; q[t[i]] = 2; q[t[i + 1]] = 1; int s = 3; rep(j, n) { if (j == i || j == i + 1) continue; p[t[j]] = q[t[j]] = s++; } OUT(p); OUT(q); return 0; } } rep(i, n - 2) { if (a[t[i + 2]] - a[t[i]] < n) { int x = 1, y = x + (a[t[i + 1]] - a[t[i]]), z = y + (a[t[i + 2]] - a[t[i + 1]]); p[t[i]] = z; p[t[i + 1]] = x; p[t[i + 2]] = y; q[t[i]] = y; q[t[i + 1]] = z; q[t[i + 2]] = x; int s = 2; rep(j, n) { while (s == y || s == z) s++; if (p[t[j]] == 0) { p[t[j]] = s; q[t[j]] = s++; } } OUT(p); OUT(q); return 0; } } vector<int> o, e; rep(i, n) { if (a[i] & 1) { o.push_back(i); } else { e.push_back(i); } } if (o.size() == 1 && e.size() == 1) { OUT(-1); return 0; } if (o.size() < e.size()) swap(o, e); assert(o.size() >= 2); int s = 3; rep(i, n) { if (i == o[0]) { p[i] = 1; q[i] = 2; } else if (i == o[1]) { p[i] = 2; q[i] = 1; } else { p[i] = s; q[i] = s++; } } i64 xx = 0, yy = 0; rep(i, n) { xx ^= p[i] + a[i]; yy ^= q[i] + a[i]; } if (xx == yy) { OUT(p); OUT(q); return 0; } vector<int> per(n); iota(all(per), 1); map<int, vector<int>> mp; do { int ss = 0; rep(i, n) ss ^= a[i] + per[i]; if (mp.contains(ss)) { OUT(per); OUT(mp[ss]); return 0; } if (clock() - start >= 1950000) { OUT(-1); return 0; } mp[ss] = per; } while (next_permutation(all(per))); }