結果
問題 | No.2024 Xer |
ユーザー |
![]() |
提出日時 | 2022-07-29 23:22:41 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 58 ms / 2,000 ms |
コード長 | 8,613 bytes |
コンパイル時間 | 12,188 ms |
コンパイル使用メモリ | 287,868 KB |
最終ジャッジ日時 | 2025-01-30 15:45:23 |
ジャッジサーバーID (参考情報) |
judge3 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 47 |
ソースコード
#line 2 "/home/hotman/vscode/kyopro/library/cpplib/util/template.hpp"#pragma GCC optimize("Ofast")#pragma GCC optimize("unroll-loops")#pragma GCC target("avx2")#include<bits/stdc++.h>using namespace std;#line 1 "/home/hotman/vscode/kyopro/library/cpplib/util/ioutil.hpp"// template <class Head,class... Args>// std::ostream& output(std::ostream& out,const Head& head,const Args&... args){// out>>head;// return output(head,args...);// }// template <class Head>// std::ostream& output(std::ostream& out,const Head& head){// out>>head;// return out;// }template<typename T,typename E>std::ostream& operator<<(std::ostream& out,std::pair<T,E>v){out<<"("<<v.first<<","<<v.second<<")";return out;}// template <class... Args>// ostream& operator<<(ostream& out,std::tuple<Args...>v){// std::apply(output,v);// return out;// }#line 8 "/home/hotman/vscode/kyopro/library/cpplib/util/template.hpp"struct __INIT__{__INIT__(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}}__INIT__;typedef long long lint;#define INF (1LL<<60)#define IINF (1<<30)#define EPS (1e-10)#define endl ('\n')typedef vector<lint> vec;typedef vector<vector<lint>> mat;typedef vector<vector<vector<lint>>> mat3;typedef vector<string> svec;typedef vector<vector<string>> smat;template<typename T>using V=vector<T>;template<typename T>using VV=V<V<T>>;template<typename T>inline void output(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i;f=1;}cout<<endl;}template<typename T>inline void output2(T t){for(auto i:t)output(i);}template<typename T>inline void debug(T t){bool f=0;for(auto i:t){cerr<<(f?" ":"")<<i;f=1;}cerr<<endl;}template<typename T>inline void debug2(T t){for(auto i:t)debug(i);}#define loop(n) for(long long _=0;_<(long long)(n);++_)#define _overload4(_1,_2,_3,_4,name,...) name#define __rep(i,a) repi(i,0,a,1)#define _rep(i,a,b) repi(i,a,b,1)#define repi(i,a,b,c) for(long long i=(long long)(a);i<(long long)(b);i+=c)#define rep(...) _overload4(__VA_ARGS__,repi,_rep,__rep)(__VA_ARGS__)#define _overload3_rev(_1,_2,_3,name,...) name#define _rep_rev(i,a) repi_rev(i,0,a)#define repi_rev(i,a,b) for(long long i=(long long)(b)-1;i>=(long long)(a);--i)#define rrep(...) _overload3_rev(__VA_ARGS__,repi_rev,_rep_rev)(__VA_ARGS__)// #define rep(i,...) for(auto i:range(__VA_ARGS__))// #define rrep(i,...) for(auto i:reversed(range(__VA_ARGS__)))// #define repi(i,a,b) for(lint i=lint(a);i<(lint)(b);++i)// #define rrepi(i,a,b) for(lint i=lint(b)-1;i>=lint(a);--i)// #define irep(i) for(lint i=0;;++i)// inline vector<long long> range(long long n){if(n<=0)return vector<long long>();vector<long long>v(n);iota(v.begin(),v.end(),0LL);return v;}// inline vector<long long> range(long long a,long long b){if(b<=a)return vector<long long>();vector<long long>v(b-a);iota(v.begin(),v.end(),a);return v;}// inline vector<long long> range(long long a,long long b,long long c){if((b-a+c-1)/c<=0)return vector<long long>();vector<long long>v((b-a+c-1)/c);for(int i=0;i<(int)v.size();++i)v[i]=i?v[i-1]+c:a;return v;}// template<typename T>inline T reversed(T v){reverse(v.begin(),v.end());return v;}#define all(n) begin(n),end(n)template<typename T,typename E>bool chmin(T& s,const E& t){bool res=s>t;s=min<T>(s,t);return res;}template<typename T,typename E>bool chmax(T& s,const E& t){bool res=s<t;s=max<T>(s,t);return res;}// const array<lint,8> dx={1,0,-1,0,1,1,-1,-1};// const array<lint,8> dy={0,1,0,-1,1,-1,1,-1};// const string ds="RDLU";#define SUM(v) accumulate(all(v),0LL)#if __cplusplus>=201703Ltemplate<typename T,typename ...Args>auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector<T>(arg,x);elsereturn vector(arg,make_vector<T>(x,args...));}#endif#define extrep(v,...) for(auto v:__MAKE_MAT__({__VA_ARGS__}))#define bit(n,a) ((n>>a)&1)vector<vector<long long>> __MAKE_MAT__(vector<long long> v){if(v.empty())return vector<vector<long long>>(1,vector<long long>());long long n=v.back();v.pop_back();vector<vector<long long>> ret;vector<vector<long long>> tmp=__MAKE_MAT__(v);for(auto e:tmp)for(long long i=0;i<n;++i){ret.push_back(e);ret.back().push_back(i);}return ret;}using graph=vector<vector<int>>;template<typename T>using graph_w=vector<vector<pair<int,T>>>;#if __cplusplus>=201703Lconstexpr inline long long powll(long long a,long long b){long long res=1;while(b--)res*=a;return res;}#endiftemplate<typename T,typename E>pair<T,E>& operator+=(pair<T,E>&s,const pair<T,E>&t){s.first+=t.first;s.second+=t.second;return s;}template<typename T,typename E>pair<T,E>& operator-=(pair<T,E>&s,const pair<T,E>&t){s.first-=t.first;s.second-=t.second;return s;}template<typename T,typename E>pair<T,E> operator+(const pair<T,E>&s,const pair<T,E>&t){auto res=s;return res+=t;}template<typename T,typename E>pair<T,E> operator-(const pair<T,E>&s,const pair<T,E>&t){auto res=s;return res-=t;}#define BEGIN_STACK_EXTEND(size) void * stack_extend_memory_ = malloc(size);void * stack_extend_origin_memory_;char * stack_extend_dummy_memory_ =(char*)alloca((1+(int)(((long long)stack_extend_memory_)&127))*16);*stack_extend_dummy_memory_ = 0;asm volatile("mov %%rsp, %%rbx\nmov %%rax,%%rsp":"=b"(stack_extend_origin_memory_):"a"((char*)stack_extend_memory_+(size)-1024));#define END_STACK_EXTEND asm volatile("mov %%rax, %%rsp"::"a"(stack_extend_origin_memory_));free(stack_extend_memory_);#line 3 "/home/hotman/vscode/kyopro/library/cpplib/math/binary_search.hpp"/*** @brief 二分探索*/template<typename T=long long,typename F>T bs(T mn,T mx,F func){mn--;mx++;while(mx-mn>1){T mid=(mn+mx)/2;if(!func(mid))mx=mid;else mn=mid;}return mn;}#line 3 "main.cpp"int main(){// lint n,l;// cin>>n>>l;// vec c(n);// rep(i,n)cin>>c[i];// lint q;// cin>>q;// // l=SUM(c)-l;// while(q--){// lint k;// cin>>k;// k--;// vec ans(n);// mat memo(n+1,vec(l+1,-1));// auto count=[&](lint idx,lint l,lint k)->lint{// if(memo[idx][l]!=-1)return memo[idx][l];// if(idx==n)return 1;// lint res=0;// rep(i,1LL<<(n-idx)){// lint tmp=l;// rep(j,(n-idx)){// if(i>>j&1){// if(j)tmp-=c[idx+j]+1;// else tmp-=k+1;// }// }// if(tmp<0){// continue;// }// lint cnt=n-idx;// lint res2=1;// rep(i,cnt-1){// res2*=tmp+cnt-1-i;// res2/=i+1;// }// res+=res2*(__builtin_popcount(i)%2?-1:1);// }// return memo[idx][l]=res;// };// cerr<<count(0,2,1)<<endl;// bool ng=0;// auto dfs=[&](auto dfs,lint idx,lint l)->void{// if(idx==n)return;// lint t=bs<lint>(0,c[idx],[&](lint x){// return count(idx,l,x)<=k;// });// lint cnt=count(idx,l,t);// if(cnt>k){// ng=1;// return;// }else{// k-=cnt;// ans[idx]=t;// dfs(dfs,idx+1,l-t);// }// };// dfs(dfs,0,l);// if(k>0||SUM(ans)!=l){// cout<<-1<<endl;// }else{// output(ans);// }// // debug(ans);// // cerr<<endl;// }// lint n;// cin>>n;// vec c(n),v(n);// rep(i,n){// cin>>c[i]>>v[i];// }// rep(i,1,n){// v[i]-=v[0];// }// // 個数,重さ// auto dp=make_vector<lint>(0,n+1,n+1);// rrep(i,1,n){// rep(j,n)rep(k,n){// dp[][k]// }// }// rep(i,n){// dp[i]+=v[0]*(n-i);// }// debug(dp);lint n,x;cin>>n>>x;vec a(n);rep(i,n)cin>>a[i];sort(all(a),[&](auto s,auto t){if((s^x)<t&&s<(t^x))return 1;else if((t^x)<s&&t<(s^x))return 0;else if(s<t&&(s^x)<(t^x))return 1;else if(t<s&&(t^x)<(s^x))return 0;else{cerr<<s<<" "<<t<<endl;cout<<"No"<<endl;exit(0);}});rep(i,n-1){if((a[i]^x)>=a[i+1]||a[i]>=(a[i+1]^x)){cerr<<a[i]<<" "<<a[i+1]<<endl;cout<<"No"<<endl;return 0;}}cout<<"Yes"<<endl;}