結果
問題 | No.1240 Or Sum of Xor Pair |
ユーザー |
![]() |
提出日時 | 2020-12-02 21:25:33 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 339 ms / 2,000 ms |
コード長 | 3,364 bytes |
コンパイル時間 | 2,353 ms |
コンパイル使用メモリ | 197,528 KB |
最終ジャッジ日時 | 2025-01-16 13:34:24 |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 30 |
ソースコード
#include <bits/stdc++.h> using namespace std; #define LOCAL #pragma region Macros typedef long long ll; #define ALL(x) (x).begin(),(x).end() const long long MOD=1000000007; // const long long MOD=998244353; const int INF=1e9; const long long IINF=1e18; const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1}; const char dir[4]={'D','R','U','L'}; template<typename T> istream &operator>>(istream &is,vector<T> &v){ for (T &x:v) is >> x; return is; } template<typename T> ostream &operator<<(ostream &os,const vector<T> &v){ for (int i=0;i<v.size();++i){ os << v[i] << (i+1==v.size()?"": " "); } return os; } template<typename T,typename U> ostream &operator<<(ostream &os,const pair<T,U> &p){ os << '(' << p.first << ',' << p.second << ')'; return os; } template<typename T,typename U> ostream &operator<<(ostream &os,const map<T,U> &m){ os << '{'; for (auto itr=m.begin();itr!=m.end();++itr){ os << '(' << itr->first << ',' << itr->second << ')'; if (++itr!=m.end()) os << ','; --itr; } os << '}'; return os; } template<typename T> ostream &operator<<(ostream &os,const set<T> &s){ os << '{'; for (auto itr=s.begin();itr!=s.end();++itr){ os << *itr; if (++itr!=s.end()) os << ','; --itr; } os << '}'; return os; } void debug_out(){cerr << '\n';} template<class Head,class... Tail> void debug_out(Head&& head,Tail&&... tail){ cerr << head; if (sizeof...(Tail)>0) cerr << ", "; debug_out(move(tail)...); } #ifdef LOCAL #define debug(...) cerr << " ";\ cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n';\ cerr << " ";\ debug_out(__VA_ARGS__) #else #define debug(...) 42 #endif template<typename T> T gcd(T x,T y){return y!=0?gcd(y,x%y):x;} template<typename T> T lcm(T x,T y){return x/gcd(x,y)*y;} template<class T1,class T2> inline bool chmin(T1 &a,T2 b){ if (a>b){a=b; return true;} return false; } template<class T1,class T2> inline bool chmax(T1 &a,T2 b){ if (a<b){a=b; return true;} return false; } #pragma endregion template<typename T> void fwt(vector<T> &f){ int n=f.size(); for (int i=1;i<n;i<<=1){ for (int j=0;j<n;++j){ if (!(j&i)){ T x=f[j],y=f[j|i]; f[j]=x+y; f[j|i]=x-y; } } } } template<typename T> void ifwt(vector<T> &f){ int n=f.size(); for (int i=1;i<n;i<<=1){ for (int j=0;j<n;++j){ if (!(j&i)){ T x=f[j],y=f[j|i]; f[j]=(x+y)/2; f[j|i]=(x-y)/2; } } } } const int MAX_A=1<<18; int main(){ cin.tie(0); ios::sync_with_stdio(false); int N,X; cin >> N >> X; vector<int> A(N); cin >> A; ll ans=0; vector<ll> cnt(MAX_A,0),ncnt(MAX_A,0); for (int i=0;i<N;++i) ++cnt[A[i]]; fwt(cnt); for (int i=0;i<MAX_A;++i) cnt[i]*=cnt[i]; ifwt(cnt); for (int i=0;i<X;++i) ans+=cnt[i]*(ll)i; for (int j=0;j<18;++j){ int mask=1<<j; fill(ALL(ncnt),0); for (int i=0;i<N;++i){ if (A[i]&mask){ ++ncnt[A[i]]; ans-=mask; } } fwt(ncnt); for (int i=0;i<MAX_A;++i) ncnt[i]*=ncnt[i]; ifwt(ncnt); for (int i=0;i<X;++i) ans+=ncnt[i]*mask; } cout << ans/2 << '\n'; }