結果

問題 No.1493 隣接xor
ユーザー 👑 emthrm
提出日時 2021-04-30 22:14:42
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 8,161 bytes
コンパイル時間 2,211 ms
コンパイル使用メモリ 206,300 KB
最終ジャッジ日時 2025-01-21 03:13:40
ジャッジサーバーID
(参考情報)
judge5 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 25 WA * 2
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
IOSetup() {
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
std::cout << fixed << setprecision(20);
}
} iosetup;
template <int M>
struct MInt {
unsigned int val;
MInt(): val(0) {}
MInt(long long x) : val(x >= 0 ? x % M : x % M + M) {}
static constexpr int get_mod() { return M; }
static void set_mod(int divisor) { assert(divisor == M); }
static void init(int x = 10000000) { inv(x, true); fact(x); fact_inv(x); }
static MInt inv(int x, bool init = false) {
// assert(0 <= x && x < M && std::__gcd(x, M) == 1);
static std::vector<MInt> inverse{0, 1};
int prev = inverse.size();
if (init && x >= prev) {
// "x!" and "M" must be disjoint.
inverse.resize(x + 1);
for (int i = prev; i <= x; ++i) inverse[i] = -inverse[M % i] * (M / i);
}
if (x < inverse.size()) return inverse[x];
unsigned int a = x, b = M; int u = 1, v = 0;
while (b) {
unsigned int q = a / b;
std::swap(a -= q * b, b);
std::swap(u -= q * v, v);
}
return u;
}
static MInt fact(int x) {
static std::vector<MInt> f{1};
int prev = f.size();
if (x >= prev) {
f.resize(x + 1);
for (int i = prev; i <= x; ++i) f[i] = f[i - 1] * i;
}
return f[x];
}
static MInt fact_inv(int x) {
static std::vector<MInt> finv{1};
int prev = finv.size();
if (x >= prev) {
finv.resize(x + 1);
finv[x] = inv(fact(x).val);
for (int i = x; i > prev; --i) finv[i - 1] = finv[i] * i;
}
return finv[x];
}
static MInt nCk(int n, int k) {
if (n < 0 || n < k || k < 0) return 0;
if (n - k > k) k = n - k;
return fact(n) * fact_inv(k) * fact_inv(n - k);
}
static MInt nPk(int n, int k) { return n < 0 || n < k || k < 0 ? 0 : fact(n) * fact_inv(n - k); }
static MInt nHk(int n, int k) { return n < 0 || k < 0 ? 0 : (k == 0 ? 1 : nCk(n + k - 1, k)); }
static MInt large_nCk(long long n, int k) {
if (n < 0 || n < k || k < 0) return 0;
inv(k, true);
MInt res = 1;
for (int i = 1; i <= k; ++i) res *= inv(i) * n--;
return res;
}
MInt pow(long long exponent) const {
MInt tmp = *this, res = 1;
while (exponent > 0) {
if (exponent & 1) res *= tmp;
tmp *= tmp;
exponent >>= 1;
}
return res;
}
MInt &operator+=(const MInt &x) { if((val += x.val) >= M) val -= M; return *this; }
MInt &operator-=(const MInt &x) { if((val += M - x.val) >= M) val -= M; return *this; }
MInt &operator*=(const MInt &x) { val = static_cast<unsigned long long>(val) * x.val % M; return *this; }
MInt &operator/=(const MInt &x) { return *this *= inv(x.val); }
bool operator==(const MInt &x) const { return val == x.val; }
bool operator!=(const MInt &x) const { return val != x.val; }
bool operator<(const MInt &x) const { return val < x.val; }
bool operator<=(const MInt &x) const { return val <= x.val; }
bool operator>(const MInt &x) const { return val > x.val; }
bool operator>=(const MInt &x) const { return val >= x.val; }
MInt &operator++() { if (++val == M) val = 0; return *this; }
MInt operator++(int) { MInt res = *this; ++*this; return res; }
MInt &operator--() { val = (val == 0 ? M : val) - 1; return *this; }
MInt operator--(int) { MInt res = *this; --*this; return res; }
MInt operator+() const { return *this; }
MInt operator-() const { return MInt(val ? M - val : 0); }
MInt operator+(const MInt &x) const { return MInt(*this) += x; }
MInt operator-(const MInt &x) const { return MInt(*this) -= x; }
MInt operator*(const MInt &x) const { return MInt(*this) *= x; }
MInt operator/(const MInt &x) const { return MInt(*this) /= x; }
friend std::ostream &operator<<(std::ostream &os, const MInt &x) { return os << x.val; }
friend std::istream &operator>>(std::istream &is, MInt &x) { long long val; is >> val; x = MInt(val); return is; }
};
namespace std { template <int M> MInt<M> abs(const MInt<M> &x) { return x; } }
using ModInt = MInt<MOD>;
template <typename T>
struct SegmentTree {
using Monoid = typename T::Monoid;
SegmentTree(int n) : SegmentTree(std::vector<Monoid>(n, T::id())) {}
SegmentTree(const std::vector<Monoid> &a) : n(a.size()) {
while (p2 < n) p2 <<= 1;
dat.assign(p2 << 1, T::id());
for (int i = 0; i < n; ++i) dat[i + p2] = a[i];
for (int i = p2 - 1; i > 0; --i) dat[i] = T::merge(dat[i << 1], dat[(i << 1) + 1]);
}
void set(int idx, Monoid val) {
idx += p2;
dat[idx] = val;
while (idx >>= 1) dat[idx] = T::merge(dat[idx << 1], dat[(idx << 1) + 1]);
}
Monoid get(int left, int right) const {
Monoid l_res = T::id(), r_res = T::id();
for (left += p2, right += p2; left < right; left >>= 1, right >>= 1) {
if (left & 1) l_res = T::merge(l_res, dat[left++]);
if (right & 1) r_res = T::merge(dat[--right], r_res);
}
return T::merge(l_res, r_res);
}
Monoid operator[](const int idx) const { return dat[idx + p2]; }
template <typename G>
int find_right(int left, G g) {
if (left >= n) return n;
Monoid val = T::id();
left += p2;
do {
while (!(left & 1)) left >>= 1;
Monoid nx = T::merge(val, dat[left]);
if (!g(nx)) {
while (left < p2) {
left <<= 1;
nx = T::merge(val, dat[left]);
if (g(nx)) {
val = nx;
++left;
}
}
return left - p2;
}
val = nx;
++left;
} while (__builtin_popcount(left) > 1);
return n;
}
template <typename G>
int find_left(int right, G g) {
if (right <= 0) return -1;
Monoid val = T::id();
right += p2;
do {
--right;
while (right > 1 && (right & 1)) right >>= 1;
Monoid nx = T::merge(dat[right], val);
if (!g(nx)) {
while (right < p2) {
right = (right << 1) + 1;
nx = T::merge(dat[right], val);
if (g(nx)) {
val = nx;
--right;
}
}
return right - p2;
}
val = nx;
} while (__builtin_popcount(right) > 1);
return -1;
}
private:
int n, p2 = 1;
std::vector<Monoid> dat;
};
namespace monoid {
template <typename T>
struct RangeMinimumQuery {
using Monoid = T;
static constexpr Monoid id() { return std::numeric_limits<Monoid>::max(); }
static Monoid merge(const Monoid &a, const Monoid &b) { return std::min(a, b); }
};
template <typename T>
struct RangeMaximumQuery {
using Monoid = T;
static constexpr Monoid id() { return std::numeric_limits<Monoid>::lowest(); }
static Monoid merge(const Monoid &a, const Monoid &b) { return std::max(a, b); }
};
template <typename T>
struct RangeSumQuery {
using Monoid = T;
static constexpr Monoid id() { return 0; }
static Monoid merge(const Monoid &a, const Monoid &b) { return a + b; }
};
} // monoid
int main() {
int n; cin >> n;
vector<int> a(n); REP(i, n) cin >> a[i];
vector<int> x(n, 0);
REP(i, n) {
x[i] = a[i];
if (i > 0) x[i] ^= x[i - 1];
}
map<int, vector<int>> mp;
REP(i, n) mp[x[i]].emplace_back(i);
vector<int> l(n, -1);
for (int i = n - 1; i >= 0; --i) {
mp[x[i]].pop_back();
if (!mp[x[i]].empty()) l[i] = mp[x[i]].back();
}
// REP(i, n) cout << l[i] << " \n"[i + 1 == n];
SegmentTree<monoid::RangeSumQuery<ModInt>> dp(n);
REP(i, n) dp.set(i, dp.get(max(l[i], 0), i) + (l[i] == -1));
cout << dp[n - 1] << '\n';
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0