제출 #338660

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
338660		tengiz05	XOR (IZhO12_xor)	C++17	100 / 100	220 ms	58604 KiB

xor

#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL);
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define PI acos(-1)
#define ld long double
template<class T> bool ckmin(T& a, const T& b) {return a>b? a=b, true:false;}
template<class T> bool ckmax(T& a, const T& b) {return a<b? a=b, true:false;}
const int mod = 1e9+7, N = 250005;
int msb(int val){return sizeof(int)*8-__builtin_clzll(val)-1;}
int a[N], n, m, k;
int pr[N];
struct node{
	array<node*,2> kids;
	int ans;
	node(){
		ans = n+1;
		kids = {NULL, NULL};
	}
};
void add(int i, int x, node* root, int ind){
	if(i<0)return;
	int bit = (x>>i)&1;
	if(root->kids[bit] == NULL)
		root->kids[bit] = new node();
	root = root->kids[bit];
	ckmin(root->ans, ind);
	add(i-1, x, root, ind);
}
int get(int i, int x, node *root, int cur){
	if(cur >= k)return root->ans;
	if(i<0 || cur+((1<<(i+1))-1) < k)return n+1;
	int res = n+1;
	int bit = (x>>i)&1;
	for(int j=0;j<2;j++)
		if(root->kids[j] != NULL)
			ckmin(res, get(i-1, x, root->kids[j], cur+((j!=bit)*(1<<i))));
	return res;
}
void solve(int test_case){
	int i, j;
	cin >> n >> k;
	for(i=1;i<=n;i++){
		cin >> a[i];
		pr[i] = a[i]^pr[i-1];
	}
	node* root = new node();
	int L = 1, R = 1;
	for(i=1;i<=n;i++){
		add(30, pr[i-1], root, i);
		int l = get(30, pr[i], root, 0);
		if(R-L < i-l)L=l,R=i;
	}
	cout << L << ' ' << R-L+1 << '\n';
	return;
}

signed main(){
	FASTIO;
#define MULTITEST 0
#if MULTITEST
	int _T;
	cin >> _T;
	for(int T_CASE = 1; T_CASE <= _T; T_CASE++)
		solve(T_CASE);
#else
	solve(1);
#endif
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

xor.cpp: In function 'void solve(int)':
xor.cpp:46:9: warning: unused variable 'j' [-Wunused-variable]
   46 |  int i, j;
      |         ^

• Subtask 1: 100 / 100