Submission #61179573

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 LL long long
const int N = 2e5+5;
inline LL read()
{
  LL res=0; char x=getchar();
  while(x<'0'||x>'9') x=getchar();
  while(x<='9'&&x>='0') res=(res<<1)+(res<<3)+(x^48),x=getchar();
  return res;
}
int n,k;
LL a[N],ans,sum;
void dfs(int p,int b,LL res)
{
  if(p==k+1)
  {
    ans=max(ans,res); return;
  }
  for(int i=b;i<=n;i++)
  {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include<bits/stdc++.h>
using namespace std;
#define LL long long
const int N = 2e5+5;
inline LL read()
{
	LL res=0; char x=getchar();
	while(x<'0'||x>'9') x=getchar();
	while(x<='9'&&x>='0') res=(res<<1)+(res<<3)+(x^48),x=getchar();
	return res;
}
int n,k;
LL a[N],ans,sum;
void dfs(int p,int b,LL res)
{
	if(p==k+1)
	{
		ans=max(ans,res); return;
	}
	for(int i=b;i<=n;i++)
	{
		dfs(p+1,i+1,res^a[i]);
	}
}
int main()
{
	// freopen("in.in","r",stdin);
	// freopen("out.out","w",stdout);
	n=read(); k=read();
	for(int i=1;i<=n;i++) a[i]=read(),sum^=a[i];
	if(k>(n>>1)) k=n-k; else sum=0;
	dfs(1,1,sum);
	printf("%lld\n",ans);
	return 0;
}

Submission Info

Judge Result