結果
問題 | No.1091 Range Xor Query |
ユーザー | soraie_ |
提出日時 | 2020-11-02 21:47:21 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 68 ms / 2,000 ms |
コード長 | 5,004 bytes |
コンパイル時間 | 2,170 ms |
コンパイル使用メモリ | 177,332 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-07-22 08:05:58 |
合計ジャッジ時間 | 6,740 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
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 | 17 ms
5,376 KB |
testcase_04 | AC | 37 ms
5,376 KB |
testcase_05 | AC | 50 ms
5,376 KB |
testcase_06 | AC | 5 ms
5,376 KB |
testcase_07 | AC | 43 ms
5,376 KB |
testcase_08 | AC | 62 ms
5,376 KB |
testcase_09 | AC | 30 ms
5,376 KB |
testcase_10 | AC | 46 ms
5,376 KB |
testcase_11 | AC | 60 ms
5,376 KB |
testcase_12 | AC | 41 ms
5,376 KB |
testcase_13 | AC | 64 ms
5,376 KB |
testcase_14 | AC | 51 ms
5,376 KB |
testcase_15 | AC | 55 ms
5,376 KB |
testcase_16 | AC | 44 ms
5,376 KB |
testcase_17 | AC | 68 ms
5,376 KB |
testcase_18 | AC | 12 ms
5,376 KB |
testcase_19 | AC | 18 ms
5,376 KB |
testcase_20 | AC | 59 ms
5,376 KB |
testcase_21 | AC | 29 ms
5,376 KB |
testcase_22 | AC | 62 ms
5,376 KB |
testcase_23 | AC | 64 ms
5,376 KB |
testcase_24 | AC | 65 ms
5,376 KB |
testcase_25 | AC | 65 ms
5,376 KB |
testcase_26 | AC | 65 ms
5,376 KB |
testcase_27 | AC | 65 ms
5,376 KB |
ソースコード
#include <bits/stdc++.h> #pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") using namespace std; /*----------------------------------ここからマクロ----------------------------------*/ #define all(a) (a).begin(),(a).end() #define rall(a) (a).rbegin(),(a).rend() #define vecin(a) rep(i,a.size())cin >> a[i] #define overload4(_1,_2,_3,_4,name,...) name /*#define rep1(n) for(int i=0;i<(int)n;++i) #define rep2(i,n) for(int i=0;i<(int)n;++i) #define rep3(i,a,b) for(int i=(int)a;i<(int)b;++i) #define rep4(i,a,b,c) for(int i=(int)a;i<(int)b;i+=(int)c)*/ #define rep1(n) for(ll i=0;i<(ll)n;++i) #define rep2(i,n) for(ll i=0;i<(ll)n;++i) #define rep3(i,a,b) for(ll i=(ll)a;i<(ll)b;++i) #define rep4(i,a,b,c) for(ll i=(ll)a;i<(ll)b;i+=(ll)c) #define rep(...) overload4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__) #ifdef _DEBUG #define debug1(a) cerr << #a << ": " << a << "\n" #define debug2(a,b) cerr << #a << ": " << a << ", " << #b << ": " << b << "\n" #define debug3(a,b,c) cerr << #a << ": " << a << ", " << #b << ": " << b << ", " << #c << ": " << c << "\n" #define debug4(a,b,c,d) cerr << #a << ": " << a << ", " << #b << ": " << b << ", " << #c << ": " << c << ", " << #d << ": " << d << "\n" #define debug(...) overload4(__VA_ARGS__,debug4,debug3,debug2,debug1)(__VA_ARGS__) #define vecout(a) cerr << #a << ": [";rep(i,a.size()){cerr << a[i];cerr << (i == a.size() - 1 ? "":",");}cerr << "]\n" #else #define debug(...) #define vecout(a) #endif #define mp make_pair #define fi first #define se second //struct doset{doset(int n){cout << fixed << setprecision(n);cerr << fixed << setprecision(n);}}; //struct myset{myset(){ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);}}; void myset(){ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);} void doset(int n){cout << fixed << setprecision(n);cerr << fixed << setprecision(n);} void koko(){cerr << "koko\n";} using ll = long long; using ld = long double; using dou = double; const int inf = 1 << 30; const ll INF = 1LL << 61; const ld pi = 3.14159265358; const ll mod1 = 1000000007LL; const ll mod2 = 998244353LL; typedef pair<ll,ll> P; template<class T, class U> inline bool chmin(T& a, const U& b){ if(a > b){ a = b; return 1; } return 0; } template<class T, class U> inline bool chmax(T& a, const U& b){ if(a < b){ a = b; return 1; } return 0; } //nのm乗をMODで割ったあまりO(logm) ll modpow(ll n,ll m,ll MOD){ if(m == 0)return 1; if(m < 0)return 0; ll res = 1; n %= MOD; while(m){ if(m & 1)res = (res * n) % MOD; m >>= 1; n *= n; n %= MOD; } return res; } ll mypow(ll n,ll m){ if(m == 0)return 1; if(m < 0)return -1; ll res = 1; while(m){ if(m & 1)res = (res * n); m >>= 1; n *= n; } return res; } //素数判定O(sqrt(N)) template<class T> inline bool isp(T n){ bool res = true; if(n == 1 || n == 0)return false; else{ for(ll i = 2;i * i <= n;i++){ if(n % i == 0){ res = false; break; } } return res; } } inline bool Yes(bool b = 1){cout << (b ? "Yes\n":"No\n");return b;} inline bool YES(bool b = 1){cout << (b ? "YES\n":"NO\n");return b;} map<ll,ll> primefactor(ll n){ map<ll,ll> ma; if(n <= 1)return ma; ll m = n; for(ll i = 2;i * i <= n;i++){ while(m % i == 0){ ma[i]++; m /= i; } } if(m != 1)ma[m]++; return ma; } ll __lcm(ll a,ll b){ return a / __gcd(a,b) * b; } inline void in(){return;} template<class First,class...Other>inline void in(First& F,Other&...O){cin >> F;in(O...);} template<ll MOD = mod1> struct fac_solver{ private: ll cmax; vector<ll> fac,finv,inv; public: fac_solver(ll n = 100000):cmax(n),fac(n),finv(n),inv(n){ fac[0] = fac[1] = 1; finv[0] = finv[1] = 1; inv[1] = 1; for (ll i = 2; i < cmax; i++){ fac[i] = fac[i - 1] * i % MOD; inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD; finv[i] = finv[i - 1] * inv[i] % MOD; } } //二項係数計算nCk ll COM(ll n, ll k){ if (n < k) return 0; if (n < 0 || k < 0) return 0; return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD; } ll PER(ll n,ll k){ if(n < k || n < 0 || k < 0)return 0; return fac[n] * finv[n - k] % MOD; } ll stair_pow(ll n){return fac[n];} }; /*----------------------------------マクロここまで----------------------------------*/ ll greedy(ll A,ll B,ll C){ ll res = 0; rep(i,1,A + 1){ res = (res + modpow(i,B,C)) % C; } return res; } int main(){ myset(); int N,Q; cin >> N >> Q; vector<int> vec(N + 1); rep(i,N)cin >> vec[i + 1]; rep(i,N)vec[i + 1] = vec[i] ^ vec[i + 1]; vecout(vec); int l,r; rep(i,Q){ cin >> l >> r; l--; cout << (vec[l] ^ vec[r]) << "\n"; } }