Submission #1111073

#	Time	Username	Problem	Language	Result	Execution time	Memory
1111073		Tsagana	XOR (IZhO12_xor)	C++14	0 / 100	1 ms	336 KiB

xor

#include<bits/stdc++.h>

#define IOS ios_base::sync_with_stdio(false);cin.tie();cout.tie();
#define all(x) x.begin(), x.end()
#define lnl long long
#define pq priority_queue
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pp pop_back
#define F first
#define S second

using namespace std;

lnl dp[250000];

void solve () {
	lnl n, s; cin >> n >> s;
	dp[0] = 0;
	for (int i = 1; i <= n; i++) {
		lnl x; cin >> x;
		dp[i] = dp[i-1]^x;
	}

	for (int i = n; i >= 1; i--)
	for (int j = 0; j <= n-i; j++) {
		if (dp[j]^dp[j+i] >= s) {
			cout << j+1 << ' ' << i;
			return ;
		}
	}
}
int main() {IOS solve(); return 0;}

Compilation message (stderr)

xor.cpp: In function 'void solve()':
xor.cpp:29:21: warning: suggest parentheses around comparison in operand of '^' [-Wparentheses]
   29 |   if (dp[j]^dp[j+i] >= s) {
      |             ~~~~~~~~^~~~

• Subtask 1: 0 / 100