Submission #651903

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
651903	2022-10-20T13:10:02 Z	ak2006	XOR (IZhO12_xor)	C++17	0 / 100	2000 ms	1860 KB

xor

#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;
}

Subtask #1

0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	134 ms	604 KB	Output is correct
6	Correct	219 ms	664 KB	Output is correct
7	Correct	267 ms	596 KB	Output is correct
8	Correct	296 ms	724 KB	Output is correct
9	Execution timed out	2089 ms	1860 KB	Time limit exceeded
10	Halted	0 ms	0 KB	-