제출 #651903

#제출 시각아이디문제언어결과실행 시간메모리
651903ak2006XOR (IZhO12_xor)C++17
0 / 100
2089 ms1860 KiB
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n,x;
	cin>>n>>x;
	vi a(n + 1),p(n + 1);
	for (int i = 1;i<=n;i++)cin>>a[i],p[i] = p[i - 1] ^ a[i];
	int ans = 0,ansi = n;
	for (int i = 0;i<=n - 1;i++){
		for (int k = 0;k<=n - i;k++){
			if ((p[i + k] ^ p[i]) >= x){
				if (k > ans){
					ans = k;
					ansi = i;
				}
				else if (k == ans)
					ansi = min(ansi,i);
			}
		}
	}
	cout<<ansi + 1<<" "<<ans<<"\n";
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...