제출 #161966

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
161966		mrtsima22	XOR (IZhO12_xor)	C++17	0 / 100	14 ms	4600 KiB

xor

#pragma GCC optimize "-O3"
#pragma GCC optimize("Ofast")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define NumberOfOnes __builtin_popcount
#define LSOne(S) (S & (-S))
#define ll long long
#define two pair<int,int>
#define twoll pair<ll,ll>
#define four pair<two,two>
#define pb push_back
#define eb emplace_back
#define mk make_pair
#define y1 y1922
#define INF 1000000000000000000
#define P 1000000007
#define lmax 1000000000
#define nn 1000003
#define ff first.first
#define fs first.second
#define sf second.first
#define ss second.second
#define f first
#define s second
#define vi vector<int>
#define vll vector<ll>
#define vtwo vector<two>
#define ALL(container) (container).begin(), (container).end()
#define sz(container) (int)(container.size())
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define mid(a,b) (a+b>>1)
#define minN 0
#define maxN 10000000
#define na(x) ((x)<P?(x):(x)-P)
#define ab(a) (-(a)<(a)?(a):-(a))
#define FAST std::ios::sync_with_stdio(false)
#define xRand mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define rnd rng
#define IT iterator
typedef
tree<
  int,// aq pair<int,int> shegidzlia
  null_type,
  less/*_equal*/<int>,// aqac
  rb_tree_tag,
  tree_order_statistics_node_update>
ordered_set;
// '_equal' mashin ginda roca multiset gchirdeba
template<class key, class value,class cmp = std::less<key>>
using ordered_map = tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;
ordered_map<int, int> my_map;
inline int rin(){
	int x=0,w=1;char ch=getchar();
	while ((ch<'0'||ch>'9')&&ch!='-') ch=getchar();
	if (ch=='-') w=0,ch=getchar();
	while (ch>='0'&&ch<='9') x=(x<<3)+(x<<1)+ch-'0',ch=getchar();
	return w?x:-x;
}
inline int bin(){
	int x=0;char ch=getchar();
	while (ch<'0'||ch>'9') ch=getchar();
	while (ch>='0'&&ch<='9') x=(x<<3)+(x<<1)+ch-'0',ch=getchar();
	return x;
}
int n,x,a,ind,k,pr,mn[250004],ty[250009][3],c;
void up(int c,int i){
	int p=0;
	for(int j=29;j>=0;j--){
		bool o=(c&(1<<j));
		if(!ty[p][o]){
			ty[p][o]=++pr;
			mn[pr]=i;
		}
		p=ty[p][o];
		mn[pr]=min(mn[pr],i);
	}
}
int get(int u){
	int p=0,ns=lmax;
	for(int i=29;i>=0;i--){
		bool o=(u&(1<<i)),O=(x&(1<<i));
		if((!O)&&(ty[p][!o])){
			ns=min(ns,mn[ty[p][!o]]);
		}
		o^=O;
		if(!ty[p][o]){
			return ns;
		}
		p=ty[p][o];
	}
	return ns;
}
int main(){FAST;xRand;
cin>>n>>x;
x--;
k=-1;
for(int i=1;i<=n;i++){
	cin>>a;
	up(c,i-1);
	c^=a;
	int ty=get(c);
	if(i-ty>k){
		k=i-ty;
		ind=ty+1;
	}
}

cout<<ind<<" "<<k<<endl;
}
/*

                   *         *
                  * *       * *
                 *   *     *   *
                *     *   *     *
                 *   *   * *   *
                  *   *   *   *
                   *   * *   *
                     *  *   *
					   *  *


*/

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

xor.cpp:3:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("unroll-loops")

• Subtask 1: 0 / 100