提出 #61176742

---

ソースコード 拡げる

#include <bits/stdc++.h> 
using namespace std;
#define ll long long
#define pii pair<ll,ll>
#define vi vector<ll>
#define vb vector<bool> 
#define vvi vector<vi>
#define vpii vector<pii>
#define vvpii vector<vpii>
#define F first
#define S second
#define pb push_back
#define all(v) v.begin(),v.end()
#define fr(i, begin, end) for (__typeof(begin) i = (begin); i != (end) + ((begin) > (end) ? -1 : 1) ; (begin) > (end) ? i-- : i++)
#define rep(i,n) for(int i=0; i<n; i++)
#define ret(msg) {cout << msg << endl; return;}
#define prt(a) cout << a << endl;
#define prt1(a) cout << a << " ";
#define prt2(a,b) cout << a << " " << b << endl;
#define popcnt(x) __builtin_popcountll(x)
#define uniq(s) s.erase(unique(s.begin(),s.end()),s.end())
#define mod 1000000007
#define MOD 998244353

/*ll N = 1e5 + 5;
vi fact(N+5, 1);
vb prime(N + 5, true);

void add_divs(int x, unordered_map<int, int>&divs){
    int i = 2;
    while(i * i <= x){
        while (x % i == 0){
            divs[i]++;
            x /= i;
        }
        i++;
    }
    if(x > 1) divs[x]++;
}

ll exp(ll a, ll b, ll m) {
    ll r=1, pwr=a%m;
    while(b) {
        if(b&1) {
            r *= pwr;
            r %= m;
        }
        pwr *= pwr;
        pwr %= m;
        b >>= 1;
    }
    return r;
}


ll mod_inv(ll b, ll m=mod) {
    return exp(b, m-2, m);
}

void doo() {
    for(ll i=2; i<=N; i++) {
        fact[i] = fact[i-1] * i;
        fact[i] %= mod;
    }
}

void SOE(ll n){
    for (ll i = 2; i*i <= n;i++){
        if ( prime[i] == true){
            for( ll p = i*i; p <=n; p+= i){
                prime[p] = false;
            }
        }
    }
}

ll nCr(ll n, ll r){
    ll t1 = n - r;
    if( t1 < 0)return 0;
    ll temp = (fact[n]*mod_inv(fact[r]))%mod;
    temp = (temp * mod_inv(fact[t1]))%mod;
    return temp;
}*/

void comb(vi &v, ll i, ll left, ll &ans, ll n, ll temp){
    if(left == 0){
        ans = max(ans, temp);
        return;
    }

    if(n - i == left){
        for(ll j = i; j < n;j++){
            temp ^= v[j];
        }
        ans = max(ans, temp);
        return;
    }

    comb(v, i + 1, left, ans, n, temp);
    temp ^= v[i];
    comb(v, i + 1, left - 1, ans, n, temp);
}

void solve(){
    ll n, k;
    cin >> n >> k;
    vi v(n);
    rep(i, n)cin >> v[i];
    ll ans = 0;
    comb(v, 0, k, ans, n, 0);
    ret(ans);
}


int32_t main() {
    //doo();
    //SOE(N);
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    int t=1;
    //cin >> t;
    /*if(t == 100){
        while(t--){
            ll l, r, g;
            cin >> l >> r >> g;
            if(t == 100 - 49){
                cout << l << " " << r << " " << g << endl;
            }
        }
    }else {*/
    while(t--) {
        solve();
    }
    //}
}

提出情報

ジャッジ結果