結果
問題 | No.2732 Similar Permutations |
ユーザー | dyktr_06 |
提出日時 | 2024-04-19 23:13:45 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 58 ms / 2,000 ms |
コード長 | 4,542 bytes |
コンパイル時間 | 2,589 ms |
コンパイル使用メモリ | 213,396 KB |
実行使用メモリ | 13,912 KB |
最終ジャッジ日時 | 2024-10-11 17:35:51 |
合計ジャッジ時間 | 17,217 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 19 ms
5,248 KB |
testcase_03 | AC | 33 ms
6,732 KB |
testcase_04 | AC | 12 ms
5,248 KB |
testcase_05 | AC | 9 ms
5,248 KB |
testcase_06 | AC | 5 ms
5,248 KB |
testcase_07 | AC | 25 ms
7,028 KB |
testcase_08 | AC | 14 ms
5,248 KB |
testcase_09 | AC | 8 ms
5,248 KB |
testcase_10 | AC | 58 ms
13,912 KB |
testcase_11 | AC | 6 ms
5,248 KB |
testcase_12 | AC | 55 ms
7,808 KB |
testcase_13 | AC | 55 ms
7,932 KB |
testcase_14 | AC | 55 ms
7,804 KB |
testcase_15 | AC | 55 ms
7,804 KB |
testcase_16 | AC | 40 ms
7,748 KB |
testcase_17 | AC | 39 ms
7,592 KB |
testcase_18 | AC | 51 ms
8,832 KB |
testcase_19 | AC | 53 ms
7,880 KB |
testcase_20 | AC | 55 ms
9,320 KB |
testcase_21 | AC | 53 ms
7,932 KB |
testcase_22 | AC | 31 ms
5,724 KB |
testcase_23 | AC | 57 ms
9,464 KB |
testcase_24 | AC | 32 ms
6,000 KB |
testcase_25 | AC | 54 ms
9,344 KB |
testcase_26 | AC | 44 ms
7,152 KB |
testcase_27 | AC | 54 ms
9,468 KB |
testcase_28 | AC | 42 ms
6,948 KB |
testcase_29 | AC | 55 ms
9,468 KB |
testcase_30 | AC | 38 ms
6,456 KB |
testcase_31 | AC | 53 ms
7,932 KB |
testcase_32 | AC | 52 ms
7,556 KB |
testcase_33 | AC | 55 ms
7,932 KB |
testcase_34 | AC | 35 ms
6,236 KB |
testcase_35 | AC | 53 ms
7,936 KB |
testcase_36 | AC | 50 ms
7,428 KB |
testcase_37 | AC | 54 ms
7,808 KB |
testcase_38 | AC | 46 ms
7,128 KB |
testcase_39 | AC | 53 ms
7,928 KB |
testcase_40 | AC | 45 ms
7,156 KB |
testcase_41 | AC | 53 ms
7,932 KB |
testcase_42 | AC | 40 ms
6,632 KB |
testcase_43 | AC | 53 ms
7,932 KB |
testcase_44 | AC | 29 ms
5,644 KB |
testcase_45 | AC | 53 ms
7,932 KB |
testcase_46 | AC | 48 ms
7,524 KB |
testcase_47 | AC | 52 ms
7,808 KB |
testcase_48 | AC | 33 ms
6,044 KB |
testcase_49 | AC | 53 ms
7,804 KB |
testcase_50 | AC | 32 ms
5,904 KB |
testcase_51 | AC | 51 ms
7,804 KB |
testcase_52 | AC | 44 ms
7,060 KB |
testcase_53 | AC | 57 ms
10,876 KB |
testcase_54 | AC | 57 ms
9,472 KB |
testcase_55 | AC | 54 ms
7,804 KB |
testcase_56 | AC | 54 ms
7,800 KB |
testcase_57 | AC | 31 ms
7,948 KB |
testcase_58 | AC | 41 ms
9,764 KB |
testcase_59 | AC | 38 ms
8,424 KB |
testcase_60 | AC | 32 ms
7,500 KB |
testcase_61 | AC | 27 ms
5,624 KB |
testcase_62 | AC | 48 ms
9,584 KB |
testcase_63 | AC | 3 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 | 2 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 <bits/stdc++.h> using namespace std; #define overload4(_1, _2, _3, _4, name, ...) name #define rep1(n) for(int i = 0; i < (int)(n); ++i) #define rep2(i, n) for(int i = 0; i < (int)(n); ++i) #define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i) #define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c)) #define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__) #define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i) #define ALL(a) (a).begin(), (a).end() #define Sort(a) (sort((a).begin(), (a).end())) #define RSort(a) (sort((a).rbegin(), (a).rend())) #define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end())) typedef long long int ll; typedef unsigned long long ul; typedef long double ld; typedef vector<int> vi; typedef vector<long long> vll; typedef vector<char> vc; typedef vector<string> vst; typedef vector<double> vd; typedef vector<long double> vld; typedef pair<long long, long long> P; template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); } template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); } template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); } const long long MINF = 0x7fffffffffff; const long long INF = 0x1fffffffffffffff; const long long MOD = 998244353; const long double EPS = 1e-9; const long double PI = acos(-1); template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; } template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; } template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; } template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; } template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; } template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; } template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; } template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; } template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; } template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; } template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; } template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; } template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; } template<class... T> void in(T&... a){ (cin >> ... >> a); } void out(){ cout << '\n'; } template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; } template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } } void input(){ } void solve(){ ll n; in(n); vll a; vin(a, n); vll p(n); iota(ALL(p), 1); map<ll, vll> mp; do{ ll x = 0; rep(i, n){ x ^= (p[i] + a[i]); } if(mp.count(x)){ out(p); out(mp[x]); return; } mp[x] = p; }while(next_permutation(ALL(p))); out(-1); } int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(20); input(); solve(); }