oj.uz

답안 #338524

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
338524 2020-12-23T10:19:58 Z juggernaut XOR (IZhO12_xor) C++14
100 / 100
 175 ms 22508 KB 
#include "bits/stdc++.h"
#define MAXN 250009
using namespace std;
int p[MAXN],n,X;
int tree[MAXN*30][2],sub[MAXN*30],nd;
void add(int x,int ind){
	int now=0;
	for(int i=29;i>=0;i--){
		int bit=x>>i&1;
		if(tree[now][bit])
			now=tree[now][bit];
		else{
			tree[now][bit]=++nd;
			sub[nd]=n+1;
			now=tree[now][bit];
		}
		sub[now]=min(sub[now],ind);
	}
}
int get(int i,int x,int now,int cur){
	if(cur>=X)
		return sub[now];
	if(i<0 or cur+(1<<i+1)-1<X)
		return n+1;
	int bit=x>>i&1,ret=n+1;
	for(int j=0;j<2;j++)
		if(tree[now][j])
			ret=min(ret,get(i-1,x,tree[now][j],cur+(j!=bit)*(1<<i)));
	return ret;
}	
int main(){
    //freopen("file.in", "r", stdin);
    scanf("%d%d",&n,&X);
    for(int i=1;i<=n;i++){
    	scanf("%d",p+i);
    	p[i]^=p[i-1];
    }
    int a=1,b=1;
    for(int i=1;i<=n;i++){
    	add(p[i-1],i);
		int l=get(29,p[i],0,0);
		if(i-l>b-a)
			a=l,b=i;	
    }
    printf("%d %d\n",a,b-a+1);
	return 0;
}

Compilation message

xor.cpp: In function 'int get(int, int, int, int)':
xor.cpp:23:21: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   23 |  if(i<0 or cur+(1<<i+1)-1<X)
      |                    ~^~
xor.cpp: In function 'int main()':
xor.cpp:33:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   33 |     scanf("%d%d",&n,&X);
      |     ~~~~~^~~~~~~~~~~~~~
xor.cpp:35:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   35 |      scanf("%d",p+i);
      |      ~~~~~^~~~~~~~~~

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 7 ms 1004 KB Output is correct
6 Correct 9 ms 1004 KB Output is correct
7 Correct 9 ms 1004 KB Output is correct
8 Correct 11 ms 1132 KB Output is correct
9 Correct 63 ms 10604 KB Output is correct
10 Correct 48 ms 10732 KB Output is correct
11 Correct 46 ms 10604 KB Output is correct
12 Correct 46 ms 10880 KB Output is correct
13 Correct 48 ms 10880 KB Output is correct
14 Correct 45 ms 10752 KB Output is correct
15 Correct 46 ms 10732 KB Output is correct
16 Correct 46 ms 10604 KB Output is correct
17 Correct 175 ms 22380 KB Output is correct
18 Correct 138 ms 22508 KB Output is correct
19 Correct 136 ms 22380 KB Output is correct
20 Correct 140 ms 22508 KB Output is correct