結果
| 問題 | No.879 Range Mod 2 Query |
| ユーザー |
 naoya_t
|
| 提出日時 | 2020-01-03 17:01:55 |
| 言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 9,488 bytes |
| コンパイル時間 | 2,031 ms |
| コンパイル使用メモリ | 185,156 KB |
| 実行使用メモリ | 18,048 KB |
| 最終ジャッジ日時 | 2024-11-22 19:13:15 |
| 合計ジャッジ時間 | 5,391 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge2 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
5,248 KB |
| testcase_01 | WA | - |
| testcase_02 | WA | - |
| testcase_03 | WA | - |
| testcase_04 | WA | - |
| testcase_05 | WA | - |
| testcase_06 | WA | - |
| testcase_07 | WA | - |
| testcase_08 | WA | - |
| testcase_09 | WA | - |
| testcase_10 | WA | - |
| testcase_11 | WA | - |
| testcase_12 | WA | - |
| testcase_13 | WA | - |
| testcase_14 | WA | - |
| testcase_15 | WA | - |
| testcase_16 | WA | - |
| testcase_17 | WA | - |
| testcase_18 | WA | - |
| testcase_19 | AC | 186 ms
17,792 KB |
| testcase_20 | AC | 194 ms
17,792 KB |
| testcase_21 | AC | 205 ms
17,664 KB |
ソースコード
#include <bits/stdc++.h>
using namespace std;
#define NDEBUG
#include <cassert>
typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<llll> vllll;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;
#define sz(a) int((a).size())
#define pb push_back
#define eb emplace_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n) for(int var=0;var<(n);++var)
#define rep1(var,n) for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n) for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define repC3(vari,varj,vark,n) for(int vari=0;vari<(n)-2;++vari)for(int varj=vari+1;varj<(n)-1;++varj)for(int vark=varj+1;vark<(n);++vark)
#define ALL(c) (c).begin(),(c).end()
#define RALL(c) (c).rbegin(),(c).rend()
#define tr(i,c) for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e) ((s).find(e)!=(s).end())
#define mset(arr,val) memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair
#define clamp(v,lo,hi) min(max(v,lo),hi)
template<typename T1, typename T2> inline void amin(T1 & a, T2 const & b) { if (a>b) a=b; }
template<typename T1, typename T2> inline void amax(T1 & a, T2 const & b) { if (a<b) a=b; }
template<typename X, typename T> auto vectors(X x, T a) { return vector<T>(x, a); }
template<typename X, typename Y, typename Z, typename... Zs> auto vectors(X x, Y y, Z z, Zs... zs) { auto cont = vectors(y, z, zs...); return vector<decltype(cont)>(x, cont); }
inline ll square(ll x) { return x * x; }
inline ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }
template <typename T>
inline T mod(T a, T b) { return ((a % b) + b) % b; }
template <typename T>
int find_left(vector<T>& v, T elem) {
return (int)(upper_bound(v.begin(), v.end(), elem) - v.begin()) - 1;
}
template <typename T>
int find_right(vector<T>& v, T elem) {
return (int)(lower_bound(v.begin(), v.end(), elem) - v.begin());
}
const ll MOD=1000000007LL;
inline ll ADD(ll x, ll y) { return (x+y) % MOD; }
inline ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }
inline ll MUL(ll x, ll y) { return x*y % MOD; }
inline ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }
inline ll INV(ll y) { /*assert(y%MOD!=0);*/ return POW(y, MOD-2); }
inline ll DIV(ll x, ll y) { return MUL(x, INV(y)); }
#define INTSPACE 12
char _buf[INTSPACE*1000000 + 3];
int loadint() {
if (fgets(_buf, INTSPACE+3, stdin)==NULL) return 0;
return atoi(_buf);
}
int loadvec(vector<int>& v, int N=-1) {
if (N == 0) {
v.clear();
return 0;
}
if (N == -1) {
N = loadint();
if (N==0) return 0;
}
int bufsize = INTSPACE*N + 3;
if (fgets(_buf, bufsize, stdin)==NULL) return 0;
v.resize(N);
int i=0;
bool last = false;
for (char *p=&_buf[0]; ;) {
char *q = p;
while (*q > ' ') ++q;
if (*q == 0x0D || *q == 0x0A) last = true;
*q = 0;
v[i++] = atoi(p);
if (last || i == N) break;
p = q+1;
}
return i;
}
void read_cr() {
fgets(_buf, 256, stdin);
}
template <typename Elem, typename LazyOperand>
class LazySegmentTree {
public:
Elem (*f)(Elem a, Elem b);
Elem (*g)(Elem a, LazyOperand b);
LazyOperand (*h)(LazyOperand a, LazyOperand b);
using fTYPE = decltype(f);
using gTYPE = decltype(g);
using hTYPE = decltype(h);
Elem elem_ident;
LazyOperand lazy_operand_ident;
vector<Elem> elems;
vector<LazyOperand> lazy_operands;
int n, height;
LazySegmentTree(fTYPE f, gTYPE g, hTYPE h,
Elem elem_ident, LazyOperand lazy_operand_ident)
: f(f), g(g), h(h),
elem_ident(elem_ident), lazy_operand_ident(lazy_operand_ident) {}
void init(int n_temp) {
n = 1; height = 0;
while (n < n_temp) { n <<= 1; ++height; }
elems.assign(2*n, elem_ident);
lazy_operands.assign(2*n, lazy_operand_ident);
}
void build(const vector<Elem>& v){
int n_temp = v.size();
init(n_temp);
rep(i,n_temp) elems[n+i] = v[i];
for (int i=n-1; i>0; --i) {
elems[i] = (*f)(elems[i*2], elems[i*2+1]);
}
}
inline void assign_merged_lazy(int dest, LazyOperand x) {
if (lazy_operands[dest].second && !x.second) {
elems[dest] = reflect(dest);
lazy_operands[dest] = lazy_operand_ident;
}
lazy_operands[dest] = (*h)(lazy_operands[dest], x);
}
inline Elem reflect(int k){
return (lazy_operands[k] == lazy_operand_ident) ? elems[k] : (*g)(elems[k], lazy_operands[k]);
}
inline void _eval(int k){
if (lazy_operands[k] != lazy_operand_ident) {
assign_merged_lazy(k*2, lazy_operands[k]);
assign_merged_lazy(k*2+1, lazy_operands[k]);
elems[k] = reflect(k);
lazy_operands[k] = lazy_operand_ident;
}
}
inline void eval_down(int k) {
for (int i=height; i>0; --i) {
_eval(k >> i);
}
}
inline void recalc(int k) {
while (k >>= 1) {
elems[k] = (*f)(reflect(k*2), reflect(k*2+1));
}
}
void update(int a, int b, LazyOperand x) {
a += n; b += n;
eval_down(a);
eval_down(b-1);
for (int l=a,r=b; l<r; l>>=1,r>>=1) {
if (l & 1) assign_merged_lazy(l++, x);
if (r & 1) assign_merged_lazy(--r, x);
}
recalc(a);
recalc(b-1);
}
void set_val(int a, Elem e) {
a += n;
eval_down(a);
elems[a] = e;
lazy_operands[a] = lazy_operand_ident;
recalc(a);
}
Elem query(int a, int b) {
a += n; b += n;
eval_down(a);
eval_down(b-1);
Elem vl = elem_ident, vr = elem_ident;
for (int l=a,r=b; l<r; l>>=1,r>>=1) {
if (l & 1) vl = (*f)(vl, reflect(l++));
if (r & 1) vr = (*f)(reflect(--r), vr);
}
Elem merged = (*f)(vl, vr);
return merged;
}
void desc() {
}
};
template <typename T>
class MyLazySegTree {
using Elem = pair<T, ii>;
using LazyOperand = pair<T,bool>;
using Monoid = pair<Elem,int>;
static Monoid f(Monoid a, Monoid b) {
return Monoid(Elem(a.first.first + b.first.first,
ii( a.first.second.first + b.first.second.first,
a.first.second.second + b.first.second.second )),
a.second + b.second);
}
static Monoid g(Monoid a, LazyOperand b) {
T k = b.first;
T p = k * a.second;
ii parity = a.first.second;
if (k % 2) parity = ii(parity.second, parity.first);
if (b.second) {
return Monoid(Elem(parity.second, parity), a.second);
} else {
return Monoid(Elem(a.first.first + p, parity), a.second);
}
}
static LazyOperand h(LazyOperand a, LazyOperand b) {
if (b.second) {
return LazyOperand((a.first + b.first)%2, true);
} else {
if (!a.second) {
return LazyOperand(a.first + b.first, false);
} else {
assert(false);
return LazyOperand(0, false);
}
}
}
public:
LazySegmentTree<Monoid, LazyOperand> *st = nullptr;
public:
MyLazySegTree(int size) {
this->st = new LazySegmentTree<Monoid, LazyOperand>(
&f, &g, &h, Monoid(Elem(0,ii(0,0)),0), LazyOperand(0,false));
this->st->build(vector<Monoid>(size, Monoid(Elem(0,ii(0,0)), 1)));
}
MyLazySegTree(vector<T>& ar) {
this->st = new LazySegmentTree<Monoid, LazyOperand>(
&f, &g, &h, Monoid(Elem(0,ii(0,0)),0), LazyOperand(0,false));
vector<Monoid> tmp(ar.size());
rep(i, ar.size()) tmp[i] = Monoid(Elem(ar[i], ii(1-ar[i]%2, ar[i]%2)), 1);
this->st->build(tmp);
}
virtual ~MyLazySegTree() { if (st != nullptr) delete st; }
public:
void update_plus(int l, int r, T x) {
st->update(l, r, LazyOperand(x,false));
}
void update_mod(int l, int r){
st->update(l, r, LazyOperand(0,true));
}
T query(int l, int r) { return st->query(l, r).first.first; }
};
inline vll vi2vll(vi& orig) {
int L = orig.size();
vll dest(L);
rep(i, L) dest[i] = (ll)orig[i];
return dest;
}
int main() {
int N, Q; scanf("%d %d%*c", &N, &Q);
vi a(N); loadvec(a,N);
vll aLL = vi2vll(a);
MyLazySegTree<ll> st(aLL);
rep(i,Q){
int op, l, r, x;
scanf("%d ", &op);
switch (op) {
case 1:
scanf("%d %d%*c", &l, &r); --l;
st.update_mod(l, r);
break;
case 2:
scanf("%d %d %d%*c", &l, &r, &x); --l;
st.update_plus(l, r, x);
break;
case 3:
scanf("%d %d%*c", &l, &r); --l;
ll y = st.query(l, r);
printf("%lld\n", y);
break;
}
}
return 0;
}