#20881 (C++11) No.183 たのしい排他的論理和(EASY)

• 問題: No.183 たのしい排他的論理和(EASY)
• ユーザー: is_eri23
• 提出日時: 2015-04-20 03:08:31
• 言語: C++11 (gcc 11.4.0)
• 結果: RE
• 実行時間: -
• コード長: 2,343 bytes
• コンパイル時間: 1,356 ms
• コンパイル使用メモリ: 157,964 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-07-04 16:33:21
• 合計ジャッジ時間: 2,950 ms
• ジャッジサーバーID （参考情報）: judge1 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	2 ms; 5,376 KB
testcase_05	AC	3 ms; 5,376 KB
testcase_06	AC	2 ms; 5,376 KB
testcase_07	RE	-
testcase_08	AC	79 ms; 5,376 KB
testcase_09	AC	56 ms; 5,376 KB
testcase_10	AC	65 ms; 5,376 KB
testcase_11	AC	83 ms; 5,376 KB
testcase_12	RE	-
testcase_13	AC	2 ms; 5,376 KB
testcase_14	AC	2 ms; 5,376 KB
testcase_15	AC	88 ms; 5,376 KB
testcase_16	AC	1 ms; 5,376 KB
testcase_17	AC	22 ms; 5,376 KB
testcase_18	RE	-
testcase_19	AC	12 ms; 5,376 KB

ソースコード

#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define numa(x,a) for(auto x: a)
#define ite iterator
#define mp make_pair
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define pf push_front
#define sec second
#define sz(x) ((int)(x).size())
#define ALL( c ) (c).begin(), (c).end()
#define gcd(a,b) __gcd(a,b)
#define mem(x,n) memset(x,n,sizeof(x))
#define endl "\n"
using namespace std;
template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}
template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); deploy<POS + 1, TUPLE, Ts...>(os, t); }
template <class T,class U> std::ostream& operator<<(std::ostream &os, std::pair<T,U> &p){ os << "(" << p.first <<", " << p.second <<")";return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; }
#define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; }
#define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); }
#define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); }
#define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); }
using ll = long long;
int nums[5010];
bool memo[20000];
int N;
void go(int x){
  if (memo[x]) {
    return;
  }
  memo[x] = true;
  rep(i,N){
    go(x ^ nums[i]);
  }
}
int main()
{
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cin >> N;
  rep(i,N){
    cin >> nums[i];
  }
  go(0);
  int ans = 0;
  rep(i,20000){
    ans += memo[i];
  }
  cout << ans << endl;
  return 0;
}