Submission #61174671

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <bits/stdc++.h>
using namespace std;
#define int long long
int a[1000000];
int n;
int final_ans;
void recurse(int x, int val, int take) {
    //means you consider from x to end, cur val is val, and you can take take more.
    if (take == 0) {final_ans = max(final_ans, val); return;}
    if (x == n) return; //not possible
    for (int i = x; i <= n-take; i++) {
        recurse(i+1, val^a[i],take-1);
    }
}
signed main() {
    int k; cin >> n >> k;
    for (int i = 0; i < n; i++) cin >> a[i];
    recurse(0,0,k);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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

#define int long long
int a[1000000];
int n;
int final_ans;
void recurse(int x, int val, int take) {
    //means you consider from x to end, cur val is val, and you can take take more.
    if (take == 0) {final_ans = max(final_ans, val); return;}
    if (x == n) return; //not possible
    for (int i = x; i <= n-take; i++) {
        recurse(i+1, val^a[i],take-1);
    }
}


signed main() {
    int k; cin >> n >> k;
    for (int i = 0; i < n; i++) cin >> a[i];
    recurse(0,0,k);
    cout << final_ans;
}

Submission Info

Judge Result