結果
問題 | No.1493 隣接xor |
ユーザー | ゆにぽけ |
提出日時 | 2023-10-09 14:17:23 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 148 ms / 2,000 ms |
コード長 | 2,874 bytes |
コンパイル時間 | 1,212 ms |
コンパイル使用メモリ | 134,520 KB |
実行使用メモリ | 18,688 KB |
最終ジャッジ日時 | 2024-07-26 18:32:11 |
合計ジャッジ時間 | 4,893 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 3 ms
6,940 KB |
testcase_02 | AC | 2 ms
6,944 KB |
testcase_03 | AC | 142 ms
18,432 KB |
testcase_04 | AC | 147 ms
18,560 KB |
testcase_05 | AC | 146 ms
18,432 KB |
testcase_06 | AC | 143 ms
18,560 KB |
testcase_07 | AC | 147 ms
18,560 KB |
testcase_08 | AC | 147 ms
18,688 KB |
testcase_09 | AC | 148 ms
18,432 KB |
testcase_10 | AC | 142 ms
18,652 KB |
testcase_11 | AC | 144 ms
18,632 KB |
testcase_12 | AC | 141 ms
18,432 KB |
testcase_13 | AC | 28 ms
6,940 KB |
testcase_14 | AC | 16 ms
6,940 KB |
testcase_15 | AC | 3 ms
6,940 KB |
testcase_16 | AC | 3 ms
6,944 KB |
testcase_17 | AC | 3 ms
6,940 KB |
testcase_18 | AC | 2 ms
6,940 KB |
testcase_19 | AC | 3 ms
6,940 KB |
testcase_20 | AC | 63 ms
11,648 KB |
testcase_21 | AC | 77 ms
12,800 KB |
testcase_22 | AC | 48 ms
10,240 KB |
testcase_23 | AC | 65 ms
11,776 KB |
testcase_24 | AC | 137 ms
18,048 KB |
testcase_25 | AC | 48 ms
9,984 KB |
testcase_26 | AC | 79 ms
13,184 KB |
testcase_27 | AC | 30 ms
8,192 KB |
testcase_28 | AC | 125 ms
17,152 KB |
testcase_29 | AC | 85 ms
14,140 KB |
ソースコード
#include<iostream>#include<vector>#include<algorithm>#include<cstring>#include<cassert>#include<cmath>#include<ctime>#include<iomanip>#include<numeric>#include<stack>#include<queue>#include<map>#include<unordered_map>#include<set>#include<unordered_set>#include<bitset>#include<random>using namespace std;template<int m> struct modint{private:unsigned int value;static constexpr int mod() {return m;}public:constexpr modint(const long long x = 0) noexcept{long long y = x;if(y < 0 || y >= mod()){y %= mod();if(y < 0) y += mod();}value = (unsigned int)y;}constexpr unsigned int val() noexcept {return value;}constexpr modint &operator+=(const modint &other) noexcept{value += other.value;if(value >= mod()) value -= mod();return *this;}constexpr modint &operator-=(const modint &other) noexcept{unsigned int x = value;if(x < other.value) x += mod();x -= other.value;value = x;return *this;}constexpr modint &operator*=(const modint &other) noexcept{unsigned long long x = value;x *= other.value;value = (unsigned int) (x % mod());return *this;}constexpr modint &operator/=(const modint &other) noexcept{return *this *= other.inverse();}constexpr modint inverse() const noexcept{assert(value);long long a = value,b = mod(),x = 1,y = 0;while(b){long long q = a/b;a -= q*b; swap(a,b);x -= q*y; swap(x,y);}return modint(x);}constexpr modint power(long long N) const noexcept{assert(N >= 0);modint p = *this,ret = 1;while(N){if(N & 1) ret *= p;p *= p;N >>= 1;}return ret;}constexpr modint operator+() {return *this;}constexpr modint operator-() {return modint() - *this;}constexpr modint &operator++(int) noexcept {return *this += 1;}constexpr modint &operator--(int) noexcept {return *this -= 1;}friend modint operator+(const modint& lhs, const modint& rhs) {return modint(lhs) += rhs;}friend modint operator-(const modint& lhs, const modint& rhs) {return modint(lhs) -= rhs;}friend modint operator*(const modint& lhs, const modint& rhs) {return modint(lhs) *= rhs;}friend modint operator/(const modint& lhs, const modint& rhs) {return modint(lhs) /= rhs;}friend ostream &operator<<(ostream &os,const modint &x) {return os << x.value;}};//using mint = modint<998244353>;using mint = modint<1000000007>;int N,A[2 << 17],F[2 << 17];mint dp[2 << 17];void solve(){cin >> N;long long S = 0;map<long long,int> id;id[0] = 0;for(int i = 0;i < N;i++){cin >> A[i];S ^= A[i];F[i+1] = id[S];id[S] = i+1;}dp[1] = 1;for(int i = 1;i < N;i++){dp[i+1] = dp[i]*2;if(F[i] >= 0) dp[i+1] -= dp[F[i]];}cout << dp[N] << endl;}int main(){ios::sync_with_stdio(false);cin.tie(nullptr);int tt = 1;//cin >> tt;while(tt--) solve();}