結果

問題 No.699 ペアでチームを作ろう２
ユーザー ningenMeningenMe
提出日時 2020-04-28 19:06:55
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 91 ms / 1,000 ms
コード長 3,690 bytes
コンパイル時間 2,262 ms
コンパイル使用メモリ 209,336 KB
実行使用メモリ 6,948 KB
最終ジャッジ日時 2024-05-03 23:05:46
合計ジャッジ時間 3,720 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,812 KB
testcase_01 AC 2 ms
6,944 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 AC 5 ms
6,940 KB
testcase_05 AC 2 ms
6,940 KB
testcase_06 AC 3 ms
6,944 KB
testcase_07 AC 90 ms
6,944 KB
testcase_08 AC 90 ms
6,944 KB
testcase_09 AC 89 ms
6,948 KB
testcase_10 AC 90 ms
6,944 KB
testcase_11 AC 91 ms
6,944 KB
testcase_12 AC 90 ms
6,944 KB
testcase_13 AC 90 ms
6,944 KB
testcase_14 AC 90 ms
6,940 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);

template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;

constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433L;

template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}

class NBase{
public:
    inline static vector<long long> translate(long long X,long long N) {
        assert(abs(N)>1);
        vector<long long> res;
        while(1) {
            long long b = (X%abs(N)+abs(N)) % abs(N);
            res.push_back(b);
            (X -= b) /= N;
            if(X==0) break;
        }
        return res;
    }
    //Digit Sum
    inline static constexpr long long digit_sum(long long N, long long K) {
        long long sum = 0;
        for (; N > 0; N /= K) sum += N % K;
        return sum;
    }
};

int main() {
    SPEED
    int N; cin >> N;
    vector<ll> A(N);
    for(int i = 0; i < N; ++i) cin >> A[i];
    sort(ALL(A));
    vector<ll> B(N/2),C(N/2);
    ll ans = 0;
    for(int i = 0; i < (1<<N); ++i) {
        if(i&1 || NBase::digit_sum(i,2)!=N/2) continue;
        int b=0,c=0;
        for(int j = 0; j < N; ++j) {
            if(i&(1<<j)) B[b++]=A[j];
            else C[c++]=A[j];
        }
        do{
            ll sum = 0;
            for(int j = 0; j < N/2; ++j) {
                sum ^= (B[j]+C[j]);
            }
            chmax(ans,sum);
        }while (next_permutation(ALL(B)));
    }
    cout << ans << endl;
    return 0;
}
0