buggy_code stringlengths 11 625k | fixed_code stringlengths 17 625k | bug_type stringlengths 2 4.45k | language int64 0 8 | token_count int64 5 200k | change_count int64 0 100 |
|---|---|---|---|---|---|
import sys
sys.setrecursionlimit(10000)
def initRMQ(n, D):
n_ = 1
while n_ < n:
n_ *= 2
for i in range(2*n_ - 1):
D.append(2147483647)
return n_
def update(k, a):
k += n_ - 1
D[k] = a
while k > 0:
k = int((k - 1) / 2)
D[k] = min(D[k*2 + 1], D[k*2 + 2])
... | import sys
sys.setrecursionlimit(10000)
def initRMQ(n, D):
n_ = 1
while n_ < n:
n_ *= 2
for i in range(2*n_ - 1):
D.append(2147483647)
return n_
def update(k, a):
k += n_ - 1
D[k] = a
while k > 0:
k = int((k - 1) / 2)
D[k] = min(D[k*2 + 1], D[k*2 + 2])
... | [["-", 8, 196, 0, 37, 0, 652, 3, 4, 0, 22], ["+", 8, 196, 0, 37, 0, 652, 3, 4, 0, 22]] | 5 | 316 | 2 |
#include <iostream>
#include <stdio.h>
using namespace std;
const int MAX_N = 100005;
const int INT_MAX = 1 << 31 - 1;
int n, dat[4 * MAX_N];
void init(int n_) {
n = 1;
while (n < n_)
n *= 2;
for (int i = 0; i < 2 * n - 1; i++)
dat[i] = INT_MAX;
}
void update(int k, int x) {
k += n - 1;
dat[k] = x;... | #include <iostream>
#include <stdio.h>
using namespace std;
const int MAX_N = 100005;
const int INT_MAX = 2147483647;
int n, dat[4 * MAX_N];
void init(int n_) {
n = 1;
while (n < n_)
n *= 2;
for (int i = 0; i < 2 * n - 1; i++)
dat[i] = INT_MAX;
}
void update(int k, int x) {
k += n - 1;
dat[k] = x;
... | [["-", 0, 30, 0, 43, 49, 50, 51, 16, 31, 13], ["-", 0, 30, 0, 43, 49, 50, 51, 16, 17, 151], ["-", 0, 43, 49, 50, 51, 16, 12, 16, 31, 13], ["-", 0, 43, 49, 50, 51, 16, 12, 16, 17, 33], ["-", 0, 43, 49, 50, 51, 16, 12, 16, 12, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13]] | 1 | 356 | 6 |
// RMQ (Range Minimum Query)
#include <algorithm>
#include <climits>
#include <cstdio>
using namespace std;
#define MAX (1 << 17)
const int INF = INT_MAX;
int n, seg[MAX * 2 - 1];
void update(int i, int x) {
i += n - 1;
seg[i] = x;
while (i > 0) {
i = (i - 1) / 2;
seg[i] = min(seg[i * 2 + 1], seg[i * 2 + ... | // RMQ (Range Minimum Query)
#include <algorithm>
#include <climits>
#include <cstdio>
using namespace std;
#define MAX (1 << 17)
const int INF = INT_MAX;
int n, seg[MAX * 2 - 1];
void update(int i, int x) {
i += n - 1;
seg[i] = x;
while (i > 0) {
i = (i - 1) / 2;
seg[i] = min(seg[i * 2 + 1], seg[i * 2 + ... | [["+", 36, 36, 0, 30, 0, 14, 0, 114, 0, 174], ["+", 0, 2, 3, 4, 0, 16, 31, 16, 17, 48], ["+", 0, 2, 3, 4, 0, 16, 31, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 337 | 5 |
#include <bits/stdc++.h>
#define Rep(i, n) for (int i = 0; i < n; i++)
#define MAX_N (2 << 17)
using namespace std;
int n, dat[2 * MAX_N - 1];
void init(int n_) {
n = 1;
while (n < n_)
n *= 2;
Rep(i, 2 * n - 1) dat[i] = INT_MAX;
}
void update(int k, int a) {
int r = k + n - 1;
dat[r] = a;
while (r > ... | #include <bits/stdc++.h>
#define Rep(i, n) for (int i = 0; i < n; i++)
#define MAX_N (2 << 17)
using namespace std;
int n, dat[2 * MAX_N - 1];
void init(int n_) {
n = 1;
while (n < n_)
n *= 2;
Rep(i, 2 * n - 1) dat[i] = INT_MAX;
}
void update(int k, int a) {
int r = k + n - 1;
dat[r] = a;
while (r > ... | [["+", 0, 37, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 37, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 344 | 2 |
#include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <limits>
#include <vector>
using namespace std;
template <typename T, int VALUE_N> class SegmentTree {
const T INIT_VALUE;
const function<T(T, T)> mergeFunc;
const int LEAF_N = 1 << (int)(ceil(log2(VALUE_N)));
const int N... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <limits>
#include <vector>
using namespace std;
template <typename T, int VALUE_N> class SegmentTree {
const T INIT_VALUE;
const function<T(T, T)> mergeFunc;
const int LEAF_N = 1 << (int)(ceil(log2(VALUE_N)));
const int N... | [["+", 49, 50, 51, 2, 3, 4, 0, 16, 17, 72], ["+", 49, 50, 51, 2, 3, 4, 0, 16, 12, 13]] | 1 | 599 | 2 |
#include <bits/stdc++.h>
using namespace std;
template <typename T> struct SegmentTree {
struct Node {
T v;
Node(T v) : v(v) {}
Node operator*(const Node &r) const { return Node(min(v, r.v)); }
};
Node e = Node((1ll << 31) - 1);
size_t n;
vector<Node> seg;
SegmentTree(size_t size)
: n(1... | #include <bits/stdc++.h>
using namespace std;
template <typename T> struct SegmentTree {
struct Node {
T v;
Node(T v) : v(v) {}
Node operator*(const Node &r) const { return Node(min(v, r.v)); }
};
Node e = Node((1ll << 31) - 1);
size_t n;
vector<Node> seg;
SegmentTree(size_t size)
: n(1... | [["-", 0, 14, 8, 9, 0, 7, 26, 11, 17, 177], ["+", 0, 14, 8, 9, 0, 7, 26, 11, 17, 176]] | 1 | 402 | 2 |
#include <bits/stdc++.h>
using namespace std;
struct Node {
int v;
Node(int v) : v(v) {}
Node operator*(const Node &r) const { return Node(min(v, r.v)); }
} e((1ll << 31) - 1);
struct SegmentTree {
size_t n;
vector<Node> seg;
SegmentTree(size_t size)
: n(1 << (32 - __builtin_clz(size - 1))), seg(2 ... | #include <bits/stdc++.h>
using namespace std;
struct Node {
int v;
Node(int v) : v(v) {}
Node operator*(const Node &r) const { return Node(min(v, r.v)); }
} e((1ll << 31) - 1);
struct SegmentTree {
size_t n;
vector<Node> seg;
SegmentTree(size_t size)
: n(1 << (32 - __builtin_clz(size - 1))), seg(2 ... | [["-", 0, 16, 12, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 16, 12, 2, 3, 4, 0, 16, 12, 13]] | 1 | 380 | 2 |
#include <algorithm>
#include <climits>
#include <iomanip>
#include <iostream>
#include <vector>
// using namespace std;
template <typename T> class Segment_Tree {
private:
int n; // n = ????´???° ???2*n-1 = ????????°
std::vector<T> SegTree;
public:
Segment_Tree(int n_) {
n = 1;
while (n < n_)
n *... | #include <algorithm>
#include <climits>
#include <iomanip>
#include <iostream>
#include <vector>
// using namespace std;
template <typename T> class Segment_Tree {
private:
int n; // n = ????´???° ???2*n-1 = ????????°
std::vector<T> SegTree;
public:
Segment_Tree(int n_) {
n = 1;
while (n < n_)
n *... | [["-", 0, 14, 8, 9, 0, 1, 0, 11, 17, 107], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 17, 32]] | 1 | 516 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctype.h>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define mo... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctype.h>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define mo... | [["+", 0, 16, 31, 74, 51, 2, 3, 4, 0, 25], ["-", 51, 4, 0, 74, 51, 2, 3, 4, 0, 25], ["-", 64, 37, 0, 74, 51, 2, 3, 4, 0, 25]] | 1 | 495 | 4 |
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1 << 17;
int n, dat[2 * MAX_N - 1];
void init(int n_) {
n = 1;
while (n < n_)
n *= 2;
for (int i = 0; i < 2 * n - 1; i++)
dat[i] = INT_MAX;
}
void update(int k, int a) {
k += n - 1;
dat[k] = a;
while (k > 0) {
k = (k - 1) / 2;
... | #include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1 << 17;
int n, dat[2 * MAX_N - 1];
void init(int n_) {
n = 1;
while (n < n_)
n *= 2;
for (int i = 0; i < 2 * n - 1; i++)
dat[i] = INT_MAX;
}
void update(int k, int a) {
k += n - 1;
dat[k] = a;
while (k > 0) {
k = (k - 1) / 2;
... | [["+", 31, 16, 12, 2, 3, 4, 0, 16, 17, 72], ["+", 31, 16, 12, 2, 3, 4, 0, 16, 12, 13]] | 1 | 342 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// Implementaci??n general
// El nodo puede ser de un tipo arbitrariamente complejo
template <class node> class SegmentTree {
// st es el arreglo de nodos del segment tree
vector<node> arr, st;
// leaf guarda la ubicaci??n de cada hoja en st
ve... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// Implementaci??n general
// El nodo puede ser de un tipo arbitrariamente complejo
template <class node> class SegmentTree {
// st es el arreglo de nodos del segment tree
vector<node> arr, st;
// leaf guarda la ubicaci??n de cada hoja en st
ve... | [["-", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 22]] | 1 | 721 | 2 |
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <queue>
#includ... |
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <queue>
#includ... | [["+", 31, 16, 12, 2, 3, 4, 0, 16, 17, 72], ["+", 31, 16, 12, 2, 3, 4, 0, 16, 12, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 543 | 4 |
#include <iostream>
using namespace std;
//一点更新区間取得
#include <functional>
#include <limits>
#include <vector>
template <typename T> struct segtree {
function<T(T, T)> calcfn;
function<T(T, T)> updatefn;
int n;
T defvalue;
vector<T> dat;
segtree() : n(0){};
segtree(
int n_, T defvalue_ = numeric_limi... | #include <iostream>
using namespace std;
//一点更新区間取得
#include <functional>
#include <limits>
#include <vector>
template <typename T> struct segtree {
function<T(T, T)> calcfn;
function<T(T, T)> updatefn;
int n;
T defvalue;
vector<T> dat;
segtree() : n(0){};
segtree(
int n_, T defvalue_ = numeric_limi... | [["-", 3, 4, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 3, 4, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 576 | 2 |
#include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define INF_LL 9000000000000000000
#define INF 2000000000
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a... | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define INF_LL 9000000000000000000
#define INF 2000000000
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a... | [["+", 0, 16, 31, 23, 0, 16, 31, 74, 0, 24], ["-", 3, 4, 0, 16, 31, 2, 3, 4, 0, 24], ["+", 0, 43, 49, 50, 51, 16, 31, 23, 0, 24], ["-", 49, 50, 51, 16, 31, 2, 3, 4, 0, 24]] | 1 | 435 | 4 |
#include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
//#define int long long
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define all(c) begin(c), end(c)
const int INF =
sizeof(int) == sizeof(... | #include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
//#define int long long
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define all(c) begin(c), end(c)
const int INF =
sizeof(int) == sizeof(... | [["-", 0, 14, 8, 9, 0, 57, 64, 37, 0, 22], ["+", 0, 14, 8, 9, 0, 57, 64, 37, 0, 22]] | 1 | 523 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
const int MAX = 2147483647;
int n, q;
int d[200002];
void init() {
int n_ = 1;
while (n_ < n)
n_ *= 2;
n = n_;
for (int i = 0; i < 2 * n - 1; i++)
d[i] = MAX;
}
void update(int k, int x) {
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
const int MAX = 2147483647;
int n, q;
int d[600000];
void init() {
int n_ = 1;
while (n_ < n)
n_ *= 2;
n = n_;
for (int i = 0; i < 2 * n - 1; i++)
d[i] = MAX;
}
void update(int k, int x) {
... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 3, 4, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 3, 4, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 361 | 4 |
#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define each(a, b) for (auto(a) : (b))
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
#define pb push_back
#define show(x) cout << #x... | #include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define each(a, b) for (auto(a) : (b))
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
#define pb push_back
#define show(x) cout << #x... | [["-", 8, 9, 0, 57, 64, 9, 0, 37, 0, 22], ["+", 8, 9, 0, 57, 64, 9, 0, 37, 0, 22]] | 1 | 522 | 2 |
#include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
//#define int long long
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define all(c) begin(c), end(c)
const int INF =
sizeof(int) == sizeof(... | #include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
//#define int long long
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define all(c) begin(c), end(c)
const int INF =
sizeof(int) == sizeof(... | [["-", 0, 14, 8, 9, 0, 57, 64, 37, 0, 22], ["+", 0, 14, 8, 9, 0, 57, 64, 37, 0, 13]] | 1 | 540 | 2 |
//#define LOCAL
#include <algorithm>
#include <assert.h>
#include <climits>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <memory.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, ... | //#define LOCAL
#include <algorithm>
#include <assert.h>
#include <climits>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <memory.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, ... | [["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["-", 0, 16, 31, 16, 12, 2, 3, 4, 0, 22], ["+", 0, 16, 31, 16, 12, 2, 3, 4, 0, 22]] | 1 | 410 | 6 |
#include <algorithm>
#include <iostream>
constexpr int MAX_N = 100000, INF = (int)1e9;
int n, q;
int seg[MAX_N * 4];
void init(int x) {
n = 1;
while (x > n)
n *= 2;
for (int i = 0; i < n * 2 - 1; ++i)
seg[i] = INF;
}
void update(int k, int a) {
k += n - 1;
seg[k] = a;
while (k > 0) {
... | #include <algorithm>
#include <iostream>
constexpr int MAX_N = 100000, INF = 2147483647;
int n, q;
int seg[MAX_N * 4];
void init(int x) {
n = 1;
while (x > n)
n *= 2;
for (int i = 0; i < n * 2 - 1; ++i)
seg[i] = INF;
}
void update(int k, int a) {
k += n - 1;
seg[k] = a;
while (k > 0) {
... | [["-", 0, 30, 0, 43, 49, 50, 51, 74, 0, 24], ["-", 0, 43, 49, 50, 51, 74, 39, 77, 39, 40], ["-", 0, 30, 0, 43, 49, 50, 51, 74, 0, 25], ["-", 0, 30, 0, 43, 49, 50, 51, 74, 51, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13]] | 1 | 350 | 5 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#de... |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#de... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 8, 9, 0, 43, 49, 50, 51, 4, 0, 13], ["+", 0, 43, 49, 53, 54, 55, 0, 56, 39, 78]] | 1 | 492 | 4 |
#include "bits/stdc++.h"
#include <fstream>
#include <random>
#include <sys/timeb.h>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define reprrev(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)
#define reprev(i, n) reprrev(i, 0, n)
#define ... | #include "bits/stdc++.h"
#include <fstream>
#include <random>
#include <sys/timeb.h>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define reprrev(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)
#define reprev(i, n) reprrev(i, 0, n)
#define ... | [["-", 0, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 0, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["-", 64, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["-", 75, 76, 0, 57, 15, 339, 51, 16, 12, 22], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 12, 22], ["-", 64, 9, 0, 57, 15, 339, 51, 16, 12, 22... | 1 | 2,021 | 8 |
#include <bits/stdc++.h>
using namespace std;
#define MAX_N 1 << 17
int n, dat[2 * MAX_N - 1];
void init(int n_) {
n = 1;
while (n < n_)
n *= 2;
for (int i = 0; i < 2 * n - 1; i++)
dat[i] = INT_MAX;
}
void update(int k, int a) {
k += n - 1;
dat[k] = a;
while (k > 0) {
k = (k - 1) / 2;
dat[... | #include <bits/stdc++.h>
using namespace std;
#define MAX_N 1 << 17
int n, dat[2 * (MAX_N)-1];
// INT＿MAXで初期化
void init(int n_) {
n = 1;
while (n < n_)
n *= 2;
for (int i = 0; i < 2 * n - 1; i++)
dat[i] = INT_MAX;
}
void update(int k, int a) {
k += n - 1;
dat[k] = a;
while (k > 0) {
k = (k - 1... | [["+", 49, 80, 81, 16, 31, 16, 12, 23, 0, 24], ["+", 49, 80, 81, 16, 31, 16, 12, 23, 0, 25], ["+", 0, 7, 8, 9, 0, 57, 75, 76, 0, 95]] | 1 | 332 | 3 |
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
const int INF = 2147483647;
struct SegmentTree {
int n;
vector<int> heap;
SegmentTree(int n) : n(n) { heap.assign(4 * n, INF); }
void update(int id, int l, int r, int q, int v) {
if (id == -1) {
return;
}
if (l ==... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
const int INF = 2147483647;
struct SegmentTree {
int n;
vector<int> heap;
SegmentTree(int n) : n(n) { heap.assign(4 * n, INF); }
void update(int id, int l, int r, int q, int v) {
if (id == -1) {
return;
}
if (l ==... | [["-", 75, 76, 0, 9, 0, 57, 75, 76, 0, 95]] | 1 | 467 | 1 |
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
//#define I... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
//#define I... | [["-", 0, 14, 8, 9, 0, 1, 0, 27, 28, 22], ["-", 0, 14, 8, 9, 0, 1, 0, 27, 17, 29], ["-", 8, 123, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 567 | 3 |
#include <queue>
#include <stdio.h>
using namespace std;
struct rmq {
int n;
int l;
int r;
};
struct two {
int n;
int t;
};
rmq b[20];
two a[10];
int min(int n, int m) {
if (n > m)
return m;
return n;
}
void init(int l, int r, int now) {
b[now].l = l;
b[now].r = r;
b[now].n = 0;
if (r == l) {
... | #include <queue>
#include <stdio.h>
using namespace std;
struct rmq {
int n;
int l;
int r;
};
struct two {
int n;
int t;
};
rmq b[1000000];
two a[1000000];
int min(int n, int m) {
if (n > m)
return m;
return n;
}
void init(int l, int r, int now) {
b[now].l = l;
b[now].r = r;
b[now].n = 214748364... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["-", 8, 9, 0, 7, 8, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 7, 8, 1, 0, 11, 12, 13]] | 1 | 594 | 8 |
#include <bits/stdc++.h>
// Shrotening
#define fst first
#define snd second
#define pb push_back
// Loop
#define FOR(i, a, b) for (long i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (long i = (a); i >= (b); --i)
#define REP(i, a) FOR(i, 0, a)
#define RREP(i, a) RFOR(i, a, 0)
#define EACH(i, a) for (auto(i) = (a)... | #include <bits/stdc++.h>
// Shrotening
#define fst first
#define snd second
#define pb push_back
// Loop
#define FOR(i, a, b) for (long i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (long i = (a); i >= (b); --i)
#define REP(i, a) FOR(i, 0, a)
#define RREP(i, a) RFOR(i, a, 0)
#define EACH(i, a) for (auto(i) = (a)... | [["-", 49, 50, 51, 2, 3, 4, 0, 16, 31, 22], ["-", 49, 50, 51, 2, 3, 4, 0, 16, 17, 72], ["-", 49, 50, 51, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 43, 49, 50, 51, 2, 3, 4, 0, 13]] | 1 | 614 | 4 |
#include <bits/stdc++.h>
// Shrotening
#define fst first
#define snd second
#define pb push_back
// Loop
#define FOR(i, a, b) for (long i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (long i = (a); i >= (b); --i)
#define REP(i, a) FOR(i, 0, a)
#define RREP(i, a) RFOR(i, a, 0)
#define EACH(i, a) for (auto(i) = (a)... | #include <bits/stdc++.h>
// Shrotening
#define fst first
#define snd second
#define pb push_back
// Loop
#define FOR(i, a, b) for (long i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (long i = (a); i >= (b); --i)
#define REP(i, a) FOR(i, 0, a)
#define RREP(i, a) RFOR(i, a, 0)
#define EACH(i, a) for (auto(i) = (a)... | [["-", 8, 123, 0, 14, 8, 9, 0, 37, 0, 38], ["-", 8, 123, 0, 14, 8, 9, 0, 37, 0, 35], ["+", 31, 16, 12, 2, 3, 4, 0, 16, 17, 72], ["+", 31, 16, 12, 2, 3, 4, 0, 16, 12, 13]] | 1 | 612 | 4 |
#include <bits/stdc++.h>
#define REP(i, a, b) for (int i = (a); i < (b); i++)
#define RREP(i, a, b) for (int i = (a); i >= (b); i--)
#define pq priority_queue
#define P pair<int, int>
#define P2 pair<int, P>
#define P3 pair<int, P2>
typedef long long ll;
typedef long double ld;
using namespace std;
const int INF = 1e9,... | #include <bits/stdc++.h>
#define REP(i, a, b) for (int i = (a); i < (b); i++)
#define RREP(i, a, b) for (int i = (a); i >= (b); i--)
#define pq priority_queue
#define P pair<int, int>
#define P2 pair<int, P>
#define P3 pair<int, P2>
typedef long long ll;
typedef long double ld;
using namespace std;
const int INF = 1e9,... | [["+", 31, 69, 28, 2, 3, 4, 0, 16, 31, 13], ["+", 31, 69, 28, 2, 3, 4, 0, 16, 17, 48]] | 1 | 558 | 2 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using T = long long;
// RMQに答えるSegmentTree
//必要に応じて書き換える．
const T INF = (1LL << 31) - 1LL;
struct SegmentTree {
private:
int n;
vector<T> node;
public:
SegmentTree(vector<T> vect) {
int sz = vect.size();
n = 1;
for (; n... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using T = long long;
// RMQに答えるSegmentTree
//必要に応じて書き換える．
const T INF = (1LL << 31) - 1LL;
struct SegmentTree {
private:
int n;
vector<T> node;
public:
SegmentTree(vector<T> vect) {
int sz = vect.size();
n = 1;
for (; n... | [["-", 0, 30, 0, 122, 8, 123, 0, 14, 39, 40], ["+", 0, 30, 0, 122, 8, 123, 0, 14, 39, 78], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 22]] | 1 | 474 | 4 |
#include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
using namespace std;
#define dump(x) cout << #x << " = " << (x) << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define POSSIBLE(n) cout <<... | #include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
using namespace std;
#define dump(x) cout << #x << " = " << (x) << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define POSSIBLE(n) cout <<... | [["+", 0, 11, 12, 2, 3, 4, 0, 69, 28, 22], ["+", 12, 2, 3, 4, 0, 69, 341, 342, 0, 70], ["+", 12, 2, 3, 4, 0, 69, 341, 342, 0, 73]] | 1 | 941 | 6 |
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#in... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#in... | [["-", 31, 69, 28, 2, 3, 4, 0, 16, 12, 13], ["+", 31, 69, 28, 2, 3, 4, 0, 16, 12, 13]] | 1 | 712 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define all(vec) vec.begin(), vec.end()
typedef long long int ll;
typedef pair<ll, ll> P;
const ll MOD = 1000000009;
const ll INF = 1000000010;
const ll LINF = 4000000000000000010LL;
const int MAX = 310;
const double EPS = 1e-9;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0,... | #include <bits/stdc++.h>
using namespace std;
#define all(vec) vec.begin(), vec.end()
typedef long long int ll;
typedef pair<ll, ll> P;
const ll MOD = 1000000009;
const ll INF = 1000000010;
const ll LINF = 4000000000000000010LL;
const int MAX = 310;
const double EPS = 1e-9;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0,... | [["-", 0, 14, 8, 9, 0, 57, 64, 37, 0, 22], ["+", 0, 14, 8, 9, 0, 57, 64, 37, 0, 22]] | 1 | 414 | 2 |
#include <bits/stdc++.h>
#define rep(n) for (int i = 0; i < n; i++)
#define repp(j, n) for (int j = 0; j < n; j++)
#define reppp(i, m, n) for (int i = m; i < n; i++)
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define debug(x) cerr << #x << ": " << x << endl
using namespace std;
typedef lo... | #include <bits/stdc++.h>
#define rep(n) for (int i = 0; i < n; i++)
#define repp(j, n) for (int j = 0; j < n; j++)
#define reppp(i, m, n) for (int i = m; i < n; i++)
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define debug(x) cerr << #x << ": " << x << endl
using namespace std;
typedef lo... | [["+", 3, 4, 0, 16, 31, 16, 12, 23, 0, 24], ["+", 0, 16, 31, 16, 12, 23, 0, 118, 28, 274], ["+", 0, 16, 31, 16, 12, 23, 0, 118, 17, 143], ["+", 3, 4, 0, 16, 31, 16, 12, 23, 0, 25]] | 1 | 472 | 4 |
import static java.lang.Long.max;
import static java.lang.Math.min;
import java.util.Scanner;
/**
* Created by shoya on 2017/04/14.
*/
public class Main {
final int INF = 100_000_000;
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int q = sc.next... | import static java.lang.Long.max;
import static java.lang.Math.min;
import java.util.Scanner;
/**
* Created by shoya on 2017/04/14.
*/
public class Main {
final int INF = 100_000_000;
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int q = sc.next... | [["-", 0, 195, 8, 196, 0, 1, 0, 11, 17, 32], ["+", 0, 195, 8, 196, 0, 1, 0, 11, 17, 107]] | 3 | 527 | 2 |
import java.util.Scanner;
public class Main {
int n, q;
Query[] qs;
public static void main(String[] args) {
Main p = new Main();
p.read();
p.solve();
}
void read() {
Scanner sc = new Scanner(System.in);
n = sc.nextInt();
q = sc.nextInt();
qs = new Query[q];
for (int i = 0;... | import java.util.Scanner;
public class Main {
int n, q;
Query[] qs;
public static void main(String[] args) {
Main p = new Main();
p.read();
p.solve();
}
void read() {
Scanner sc = new Scanner(System.in);
n = sc.nextInt();
q = sc.nextInt();
qs = new Query[q];
for (int i = 0;... | [["-", 0, 263, 8, 519, 0, 7, 15, 16, 17, 18], ["+", 0, 263, 8, 519, 0, 7, 15, 16, 17, 19], ["-", 0, 195, 8, 196, 0, 1, 0, 11, 17, 32], ["+", 0, 195, 8, 196, 0, 1, 0, 11, 17, 107]] | 3 | 496 | 4 |
#include <stdio.h>
int a[100001];
void add(int b, int w, int n) {
int i;
for (i = b; i <= n; i += i & (-i))
a[i] += w;
}
int sum2(int b) {
int i, ans = 0;
for (i = b; i > 0; i -= i & (-i))
ans += a[i];
return ans;
}
int sum(int b, int c) { return (sum2(c) - sum2(b - 1)); }
void init(int a[], int ... | #include <stdio.h>
int a[100001];
void add(int b, int w, int n) {
int i;
for (i = b; i <= n; i += i & (-i))
a[i] += w;
}
int sum2(int b) {
int i, ans = 0;
for (i = b; i > 0; i -= i & (-i))
ans += a[i];
return ans;
}
int sum(int b, int c) { return (sum2(c) - sum2(b - 1)); }
void init(int a[], int ... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 252 | 2 |
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
void getSum(int a[], int x, int y) {
int i;
int sum = 0;
for (i = x; i <= y; i++) {
sum += a[i];
}
printf("%d\n", sum);
}
int main(void) {
int i;
int n;
scanf("%d ", &n);
int a[n];
for (i = 0; i < n; i++)
a[i] = 0;
int q;
scan... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
void getSum(int a[], int x, int y) {
int i;
int sum = 0;
for (i = x; i <= y; i++) {
sum += a[i];
}
printf("%d\n", sum);
}
int main(void) {
int i;
int n;
scanf("%d ", &n);
int a[n];
for (i = 0; i < n; i++)
a[i] = 0;
int q;
scan... | [["+", 0, 1, 0, 11, 31, 69, 71, 16, 17, 33], ["+", 0, 1, 0, 11, 31, 69, 71, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 0 | 191 | 6 |
#include <limits.h>
#include <math.h>
#include <stdio.h>
#define N (1 << 20)
int seg[N << 1];
void init(void) {
int i;
for (i = 0; i < (N << 1); i++) {
seg[i] = 0;
}
}
int find(int a, int b, int x, int l, int r) {
if (a >= r || l >= b)
return (0);
if (a <= l && r <= b)
return (seg[x]);
return ... | #include <limits.h>
#include <math.h>
#include <stdio.h>
#define N (1 << 20)
int seg[N << 1];
void init(void) {
int i;
for (i = 0; i < (N << 1); i++) {
seg[i] = 0;
}
}
int find(int a, int b, int x, int l, int r) {
if (a >= r || l >= b)
return (0);
if (a <= l && r <= b)
return (seg[x]);
return ... | [["-", 0, 14, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 17, 107]] | 0 | 309 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); --i)
#define all(c) c.begin(), c.end()
#define sz(x) ((int)x.size())
using pii = pair<int, int>;
using vvi = vector<vector<int>>;
us... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); --i)
#define all(c) c.begin(), c.end()
#define sz(x) ((int)x.size())
using pii = pair<int, int>;
using vvi = vector<vector<int>>;
us... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 17, 32], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 17, 107]] | 1 | 588 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;
#define ALL(c) begin(c), end(c)
#define RALL(c) rbegin(c), rend(c)
#define ITR(i, b, e) for (auto i = (b); i != (e); ++i)
#define FORE(x, c) for (auto &x : c)
#define REPF(i, a, ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;
#define ALL(c) begin(c), end(c)
#define RALL(c) rbegin(c), rend(c)
#define ITR(i, b, e) for (auto i = (b); i != (e); ++i)
#define FORE(x, c) for (auto &x : c)
#define REPF(i, a, ... | [["-", 0, 11, 12, 69, 341, 342, 0, 27, 28, 22], ["+", 0, 11, 12, 69, 341, 342, 0, 27, 28, 22]] | 1 | 746 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define each(i, a) for (auto &&i : a)
#define FOR(i, a, b) for (ll i = (a), __last_##i = (b); i < __last_##i; i++)
#define RFOR(i, a, b) for (ll i = (b)-1, __last_##i = (a); i >= __last_##i; i--)
#define REP(i, n) FOR(i, 0, n... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define each(i, a) for (auto &&i : a)
#define FOR(i, a, b) for (ll i = (a), __last_##i = (b); i < __last_##i; i++)
#define RFOR(i, a, b) for (ll i = (b)-1, __last_##i = (a); i >= __last_##i; i--)
#define REP(i, n) FOR(i, 0, n... | [["+", 0, 14, 8, 9, 0, 1, 0, 27, 17, 68], ["+", 0, 14, 8, 9, 0, 1, 0, 27, 28, 22], ["+", 8, 9, 0, 14, 8, 9, 0, 1, 0, 35], ["-", 12, 16, 31, 2, 3, 4, 0, 16, 17, 72], ["-", 12, 16, 31, 2, 3, 4, 0, 16, 12, 13]] | 1 | 772 | 5 |
#include <bits/stdc++.h>
using ll = long long;
#define int ll
#define rep(i, n) for (int i = 0; i < n; i++)
#define loop(i, s, n) for (int i = s; i < n; i++)
#define erep(e, v) for (auto &&e : v)
#define all(in) in.begin(), in.end()
#define MP make_pair
#define INF (sizeof(int) == 4 ? (int)1e9 : (int)1e18)
#define EPS ... | #include <bits/stdc++.h>
using ll = long long;
#define int ll
#define rep(i, n) for (int i = 0; i < n; i++)
#define loop(i, s, n) for (int i = s; i < n; i++)
#define erep(e, v) for (auto &&e : v)
#define all(in) in.begin(), in.end()
#define MP make_pair
#define INF (sizeof(int) == 4 ? (int)1e9 : (int)1e18)
#define EPS ... | [["-", 0, 14, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 17, 107]] | 1 | 949 | 2 |
#include <bits/stdc++.h> // Replace needed headers for speed up
// -------------8<------- start of library -------8<------------------------
template <class T> class FenwickTree {
public:
FenwickTree(int _n = 0) : n(_n), bit(n + 1, 0) {}
T sum(int r) const {
T res = 0;
for (r = r - 1; r >= 0; r = (r & (r ... | #include <bits/stdc++.h> // Replace needed headers for speed up
// -------------8<------- start of library -------8<------------------------
template <class T> class FenwickTree {
public:
FenwickTree(int _n = 0) : n(_n), bit(n + 1, 0) {}
T sum(int r) const {
T res = 0;
for (r = r - 1; r >= 0; r = (r & (r ... | [["+", 64, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["+", 64, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 31, 16, 12, 2, 3, 4, 0, 16, 17, 33], ["+", 31, 16, 12, 2, 3, 4, 0, 16, 12, 13], ["-", 31, 16, 12, 2, 3, 4, 0, 16, 17, 72], ["-", 31, 16, 12, 2, 3, 4, 0, 16, 12, 13]] | 1 | 285 | 6 |
#include <bits/stdc++.h>
#define int long long int
#define MOD(x) ((x % MOD_N) + MOD_N) % MOD_N
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORE(i, a, b) for (int i = (a); i <= (b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define RFORE(i, a, b) for (int i = (b); i >= (a); --i)
#de... | #include <bits/stdc++.h>
#define int long long int
#define MOD(x) ((x % MOD_N) + MOD_N) % MOD_N
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORE(i, a, b) for (int i = (a); i <= (b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define RFORE(i, a, b) for (int i = (b); i >= (a); --i)
#de... | [["+", 0, 43, 49, 50, 51, 4, 0, 16, 17, 72], ["+", 0, 43, 49, 50, 51, 4, 0, 16, 12, 13]] | 1 | 1,126 | 2 |
#include <algorithm>
#include <climits>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
// 抽象 SegmentTree (0-indexed・一点更新・区間取得)
template <typename MonoidType> struct SegmentTree {
using Function = function<MonoidType(MonoidType, MonoidType)>;
// node, identity element
int n;
v... | #include <algorithm>
#include <climits>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
// 抽象 SegmentTree (0-indexed・一点更新・区間取得)
template <typename MonoidType> struct SegmentTree {
using Function = function<MonoidType(MonoidType, MonoidType)>;
// node, identity element
int n;
v... | [["+", 0, 218, 8, 9, 0, 37, 0, 16, 31, 22], ["+", 0, 218, 8, 9, 0, 37, 0, 16, 17, 72]] | 1 | 776 | 2 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// #define int ll
using PII = pair<ll, ll>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// #define int ll
using PII = pair<ll, ll>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template ... | [["+", 0, 1, 0, 16, 31, 16, 12, 118, 17, 131], ["+", 0, 1, 0, 16, 31, 16, 12, 118, 119, 120]] | 1 | 2,574 | 6 |
#include <bits/stdc++.h>
using namespace std;
template <typename monoid> class segmentTree {
public:
using M = monoid;
using T = typename M::value_type;
int sz;
vector<T> x;
segmentTree(int n = 0) {
sz = 1;
while (sz < n)
sz *= 2;
x.assign(sz * 2, M::id());
init();
}
void fill(co... | #include <bits/stdc++.h>
using namespace std;
template <typename monoid> class segmentTree {
public:
using M = monoid;
using T = typename M::value_type;
int sz;
vector<T> x;
segmentTree(int n = 0) {
sz = 1;
while (sz < n)
sz *= 2;
x.assign(sz * 2, M::id());
init();
}
void fill(co... | [["-", 0, 14, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 17, 107]] | 1 | 637 | 2 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, P> P3;
typedef pair<P, P> PP;
const ll MOD = ll(1e9) + 7;
const int IINF = INT_MAX;
const ll LLINF = LLONG_MAX;
const int MAX_N = int(1e5 + 5);
const double EPS = 1e-6;
const int ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, P> P3;
typedef pair<P, P> PP;
const ll MOD = ll(1e9) + 7;
const int IINF = INT_MAX;
const ll LLINF = LLONG_MAX;
const int MAX_N = int(1e5 + 5);
const double EPS = 1e-6;
const int ... | [["-", 0, 122, 8, 123, 0, 14, 49, 53, 49, 120], ["+", 0, 122, 8, 123, 0, 14, 49, 53, 49, 120], ["-", 0, 14, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 17, 107], ["-", 0, 9, 0, 1, 0, 2, 63, 118, 119, 120], ["+", 0, 9, 0, 1, 0, 2, 63, 118, 119, 120]] | 1 | 686 | 6 |
#include <algorithm> // other
#include <bitset>
#include <cassert> // c
#include <complex>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream> // io
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <vector> // container
using name... | #include <algorithm> // other
#include <bitset>
#include <cassert> // c
#include <complex>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream> // io
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <vector> // container
using name... | [["-", 0, 14, 8, 9, 0, 1, 0, 27, 28, 22], ["-", 0, 14, 8, 9, 0, 1, 0, 27, 17, 68], ["-", 8, 9, 0, 14, 8, 9, 0, 1, 0, 35], ["-", 31, 16, 12, 2, 3, 4, 0, 16, 17, 72], ["-", 31, 16, 12, 2, 3, 4, 0, 16, 12, 13]] | 1 | 989 | 5 |
#include <bits/stdc++.h>
//{{{ seg.hpp
#ifndef INCLUDE_SEG_HPP
#define INCLUDE_SEG_HPP
#include <algorithm>
#include <functional>
#include <iterator>
namespace orislib {
namespace ds {
constexpr int uprt(int k, int i = 1) { return i < k ? uprt(k, i + i) : i; }
template <typename T, int S> struct SegT {
typedef T seg... | #include <bits/stdc++.h>
//{{{ seg.hpp
#ifndef INCLUDE_SEG_HPP
#define INCLUDE_SEG_HPP
#include <algorithm>
#include <functional>
#include <iterator>
namespace orislib {
namespace ds {
constexpr int uprt(int k, int i = 1) { return i < k ? uprt(k, i + i) : i; }
template <typename T, int S> struct SegT {
typedef T seg... | [["-", 0, 43, 39, 344, 3, 347, 0, 77, 39, 78], ["+", 0, 43, 39, 344, 3, 347, 0, 77, 39, 40], ["-", 0, 218, 49, 185, 54, 55, 0, 56, 39, 78], ["+", 0, 218, 49, 185, 54, 55, 0, 56, 39, 40], ["-", 75, 76, 0, 1, 0, 2, 63, 118, 119, 120], ["+", 75, 76, 0, 1, 0, 2, 63, 118, 119, 120]] | 1 | 1,698 | 8 |
#include <bits/stdc++.h>
//{{{ bit.hpp
#ifndef INCLUDE_BIT_HPP
#define INCLUDE_BIT_HPP
#include <vector>
namespace orislib {
namespace ds {
template <typename T> struct BIT {
std::vector<T> A;
BIT(int n) : A(n, 0) {}
T query(int l, int r) {
if (l)
return query(0, l) - query(0, r - 1);
T S = 0;
... | #include <bits/stdc++.h>
//{{{ bit.hpp
#ifndef INCLUDE_BIT_HPP
#define INCLUDE_BIT_HPP
#include <vector>
namespace orislib {
namespace ds {
template <typename T> struct BIT {
std::vector<T> A;
BIT(int n) : A(n, 0) {}
T query(int l, int r) {
if (l)
return query(0, r - 1) - query(0, l - 1);
T S = 0;
... | [["-", 64, 37, 0, 16, 31, 2, 3, 4, 0, 22], ["+", 0, 16, 31, 2, 3, 4, 0, 16, 31, 22], ["+", 0, 16, 31, 2, 3, 4, 0, 16, 17, 33], ["+", 0, 16, 31, 2, 3, 4, 0, 16, 12, 13], ["-", 0, 16, 12, 2, 3, 4, 0, 16, 31, 22], ["+", 0, 16, 12, 2, 3, 4, 0, 16, 31, 22]] | 1 | 984 | 6 |
#define _CRT_SECURE_NO_WARNINGS
// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// #define int ll
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
#define all(c) begin(c), end(c)
#define range(i, a, b) for (ll i = a; i < ll(b); i++)
#define rep(i,... | #define _CRT_SECURE_NO_WARNINGS
// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// #define int ll
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
#define all(c) begin(c), end(c)
#define range(i, a, b) for (ll i = a; i < ll(b); i++)
#define rep(i,... | [["+", 0, 14, 8, 9, 0, 1, 0, 27, 28, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 27, 17, 68], ["+", 8, 9, 0, 14, 8, 9, 0, 1, 0, 35], ["-", 31, 16, 12, 2, 3, 4, 0, 16, 17, 72], ["-", 31, 16, 12, 2, 3, 4, 0, 16, 12, 13]] | 1 | 918 | 5 |
#define _CRT_SECURE_NO_WARNINGS
// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// #define int ll
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
#define all(c) begin(c), end(c)
#define range(i, a, b) for (ll i = a; i < ll(b); i++)
#define rep(i,... | #define _CRT_SECURE_NO_WARNINGS
// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// #define int ll
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
#define all(c) begin(c), end(c)
#define range(i, a, b) for (ll i = a; i < ll(b); i++)
#define rep(i,... | [["+", 0, 14, 8, 9, 0, 1, 0, 27, 28, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 27, 17, 29], ["+", 8, 123, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 901 | 3 |
#include <iostream>
#include <vector>
using namespace std;
/*
親が子の和になる二分木
最深部は1bit目が1、その上は1bit目0で2bit目が1...
となる様にインデックス付け
*/
/*
注意 : Index [1...n]
*/
typedef int BIT_T;
class BIT {
private:
vector<BIT_T> bit;
public:
BIT(int n) { bit.resize(n + 1, 0); }
// index 0 to i の和を返す
BIT_T sum(int i) {
... | #include <iostream>
#include <vector>
using namespace std;
/*
親が子の和になる二分木
最深部は1bit目が1、その上は1bit目0で2bit目が1...
となる様にインデックス付け
*/
/*
注意 : Index [1...n]
*/
typedef int BIT_T;
class BIT {
private:
vector<BIT_T> bit;
public:
BIT(int n) { bit.resize(n + 1, 0); }
// index 0 to i の和を返す
BIT_T sum(int i) {
... | [["+", 8, 9, 0, 57, 64, 1, 0, 16, 17, 151], ["+", 8, 9, 0, 57, 64, 1, 0, 16, 12, 22]] | 1 | 236 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
template <typename T, int MAX_N> struct BIT {
int N;
T arr[MAX_N];
BIT(int n) : N(n) {
for (int i = 0; i <= N; ++i) {
arr[i] = (T)0;
}
}
void update(int i, T a) {
for (int x = i; x <= N; x += x & -x) {
arr[x] += a;
}
... | #include <algorithm>
#include <iostream>
using namespace std;
template <typename T, int MAX_N> struct BIT {
int N;
T arr[MAX_N];
BIT(int n) : N(n) {
for (int i = 0; i <= N; ++i) {
arr[i] = (T)0;
}
}
void add(int i, T a) {
for (int x = i; x <= N; x += x & -x) {
arr[x] += a;
}
}... | [["-", 0, 122, 8, 123, 0, 14, 49, 53, 49, 120], ["+", 0, 122, 8, 123, 0, 14, 49, 53, 49, 120], ["-", 0, 1, 0, 11, 12, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 11, 12, 69, 341, 342, 0, 22], ["-", 64, 9, 0, 1, 0, 2, 63, 118, 119, 120], ["+", 64, 9, 0, 1, 0, 2, 63, 118, 119, 120]] | 1 | 267 | 6 |
#include <algorithm>
#include <climits>
#include <iostream>
#include <vector>
#define INF INT_MAX
using namespace std;
typedef long long ll;
template <class T> struct Treap {
public:
struct node_t {
T val;
node_t *lch, *rch;
int pri, cnt, mini, sum;
node_t(int v, double p) : val(v), pri(p), cnt(1... | #include <algorithm>
#include <climits>
#include <iostream>
#include <vector>
#define INF INT_MAX
using namespace std;
typedef long long ll;
template <class T> struct Treap {
public:
struct node_t {
T val;
node_t *lch, *rch;
int pri, cnt, mini, sum;
node_t(int v, double p) : val(v), pri(p), cnt(1... | [["-", 0, 7, 8, 1, 0, 2, 3, 4, 0, 22], ["+", 0, 7, 8, 1, 0, 2, 3, 4, 0, 13]] | 1 | 1,206 | 2 |
#include <iostream>
#include <vector>
using namespace std;
class BIT {
public:
BIT(int n) : vec{vector<int>(n, 0)} {};
int sum(int l, int r) { return sum(r) - sum(l - 1); }
void add(int i, int v) {
int idx = i;
int vs = vec.size();
while (idx < vs) {
vec[idx - 1] += v;
idx += idx & (-idx)... | #include <iostream>
#include <vector>
using namespace std;
class BIT {
public:
BIT(int n) : vec{vector<int>(n, 0)} {};
int sum(int l, int r) { return sum(r) - sum(l - 1); }
void add(int i, int v) {
int idx = i;
int vs = vec.size();
while (idx <= vs) {
vec[idx - 1] += v;
idx += idx & (-idx... | [["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 19]] | 1 | 295 | 2 |
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define ALL(c) (c).begin(), (c).end()
#... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define ALL(c) (c).begin(), (c).end()
#... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["-", 8, 9, 0, 14, 8, 9, 0, 1, 0, 35], ["-", 0, 14, 8, 9, 0, 1, 0, 27, 17, 68], ["-", 0, 14, 8, 9, 0, 1, 0, 27, 28, 22]] | 1 | 419 | 5 |
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <s... | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <s... | [["-", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 107]] | 1 | 449 | 2 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int MAX_N... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int MAX_N... | [["-", 8, 9, 0, 1, 0, 11, 12, 2, 63, 22], ["-", 0, 1, 0, 11, 12, 2, 3, 4, 0, 24], ["-", 0, 1, 0, 11, 12, 2, 3, 4, 0, 21], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["-", 0, 1, 0, 11, 12, 2, 3, 4, 0, 25]] | 1 | 396 | 5 |
#include <bits/stdc++.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = int(a)... | #include <bits/stdc++.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = int(a)... | [["-", 8, 123, 0, 14, 8, 9, 0, 7, 0, 88], ["-", 8, 123, 0, 14, 8, 9, 0, 7, 0, 24], ["-", 0, 14, 8, 9, 0, 7, 10, 11, 17, 32], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 17, 107], ["+", 8, 123, 0, 14, 8, 9, 0, 1, 0, 35], ["+", 8, 123, 0, 14, 8, 9, 0, 7, 0, 88], ["+", 8, 123, 0, 14, 8, 9, 0, 7, 0, 24]] | 1 | 609 | 7 |
#include <cstdio>
#include <vector>
void add(const int &index, const int &value, std::vector<int> &vec) {
vec.at(index) += value;
if (index != 0) {
add((index - 1) >> 1, value, vec);
}
}
int get_sum(const int &start, const int &end, const std::vector<int> &vec) {
if (start == end) {
return vec.at(start... | #include <cstdio>
#include <vector>
void add(const int &index, const int &value, std::vector<int> &vec) {
vec.at(index) += value;
if (index != 0) {
add((index - 1) >> 1, value, vec);
}
}
int get_sum(const int &start, const int &end, const std::vector<int> &vec) {
if (start == end) {
return vec.at(start... | [["-", 31, 23, 0, 16, 31, 23, 0, 16, 12, 13], ["+", 0, 23, 0, 16, 31, 23, 0, 16, 12, 13], ["-", 49, 50, 51, 2, 3, 4, 0, 16, 17, 33], ["-", 49, 50, 51, 2, 3, 4, 0, 16, 12, 13]] | 1 | 334 | 4 |
#include <iostream>
using namespace std;
const int INF = 0;
const int N_MAX = 1 << 20;
const int DAT_SIZE = N_MAX * 2 - 1;
int dat[DAT_SIZE], lazy[DAT_SIZE];
int n;
int min(int a, int b) { return a + b; }
void init(int size) {
n = 1;
while (n < size) {
n *= 2;
}
}
void lazy_eval(int k) {
dat[k] += laz... | #include <iostream>
using namespace std;
const int INF = 0;
const int N_MAX = 1 << 20;
const int DAT_SIZE = N_MAX * 2 - 1;
int dat[DAT_SIZE], lazy[DAT_SIZE];
int n;
int min(int a, int b) { return a + b; }
void init(int size) {
n = 1;
while (n < size) {
n *= 2;
}
}
void lazy_eval(int k) {
dat[k] += laz... | [["-", 31, 16, 12, 2, 3, 4, 0, 16, 17, 72], ["+", 31, 16, 12, 2, 3, 4, 0, 16, 17, 33], ["-", 31, 16, 12, 2, 3, 4, 0, 16, 12, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 667 | 8 |
#include <algorithm>
#include <iostream>
using namespace std;
int tree[(1 << 18)];
void add(int i, int x) {
i += ((1 << 17) - 1);
tree[i] = x;
while (i) {
i = (i - 1) / 2;
tree[i] = tree[i * 2 + 1] + tree[i * 2 + 2];
}
}
int getsum(int a, int b, int n, int l, int r) {
if (r <= a || b <= l)
retur... | #include <algorithm>
#include <iostream>
using namespace std;
int tree[(1 << 18)];
void add(int i, int x) {
i += ((1 << 17) - 1);
tree[i] += x;
while (i) {
i = (i - 1) / 2;
tree[i] = tree[i * 2 + 1] + tree[i * 2 + 2];
}
}
int getsum(int a, int b, int n, int l, int r) {
if (r <= a || b <= l)
retu... | [["-", 0, 14, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 17, 107]] | 1 | 273 | 2 |
#include <bits/stdc++.h>
using namespace std;
int bit[100000];
int n;
void add(int a, int x) {
while (a < n) {
bit[a] += x;
a += a & -a;
}
}
int sum(int a) {
int ans = 0;
while (a) {
ans += bit[a];
a -= a & -a;
}
return ans;
}
int main() {
int q;
cin >> n >> q;
while (q--) {
int c,... | #include <bits/stdc++.h>
using namespace std;
int bit[100000];
int n;
void add(int a, int x) {
while (a <= n) {
bit[a] += x;
a += a & -a;
}
}
int sum(int a) {
int ans = 0;
while (a) {
ans += bit[a];
a -= a & -a;
}
return ans;
}
int main() {
int q;
cin >> n >> q;
while (q--) {
int c... | [["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 19]] | 1 | 160 | 2 |
#ifndef ___Class_RMQ
#define ___Class_RMQ
#include <algorithm>
#include <vector>
template <typename Type, class Calculate> class RMQ {
private:
int size;
std::vector<Type> value;
Type _query(int a, int b, int k, int l, int r) {
if (r <= a || b <= l) {
return val;
}
if (a <= l && r <= b) {
... | #ifndef ___Class_RMQ
#define ___Class_RMQ
#include <algorithm>
#include <vector>
template <typename Type, class Calculate> class RMQ {
private:
int size;
std::vector<Type> value;
Type _query(int a, int b, int k, int l, int r) {
if (r <= a || b <= l) {
return val;
}
if (a <= l && r <= b) {
... | [["-", 0, 14, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 17, 107]] | 1 | 449 | 2 |
#ifndef ___Class_BIT
#define ___Class_BIT
// ------ Includes ------ //
#include <vector>
#pragma warning(disable : 4146)
// ------ Class ------ //
template <typename Type> class BIT {
private:
unsigned size_;
std::vector<Type> v;
Type sum(unsigned r) {
Type ret = 0;
while (r > 0) {
ret += v[r];
... | #ifndef ___Class_BIT
#define ___Class_BIT
// ------ Includes ------ //
#include <vector>
#pragma warning(disable : 4146)
// ------ Class ------ //
template <typename Type> class BIT {
private:
unsigned size_;
std::vector<Type> v;
Type sum(unsigned r) {
Type ret = 0;
while (r > 0) {
ret += v[r];
... | [["+", 3, 4, 0, 2, 3, 4, 0, 16, 17, 33], ["+", 3, 4, 0, 2, 3, 4, 0, 16, 12, 13], ["-", 3, 4, 0, 2, 3, 4, 0, 16, 17, 72], ["-", 3, 4, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 300 | 4 |
#include <bits/stdc++.h>
using namespace std;
class SegmentTree {
private:
int n;
vector<int> t;
int combine(int a, int b) { return a + b; }
public:
SegmentTree(int N) { // build tree
n = N;
t.assign(n << 1, 0);
// for (int i = 0; i < n; i++) t[n+i] = v[i];
// for (int i = n-1; i > 0; i--) t... | #include <bits/stdc++.h>
using namespace std;
class SegmentTree {
private:
int n;
vector<int> t;
int combine(int a, int b) { return a + b; }
public:
SegmentTree(int N) { // build tree
n = N;
t.assign(n << 1, 0);
// for (int i = 0; i < n; i++) t[n+i] = v[i];
// for (int i = n-1; i > 0; i--) t... | [["+", 0, 43, 49, 50, 51, 4, 0, 16, 17, 72], ["+", 0, 43, 49, 50, 51, 4, 0, 16, 12, 13]] | 1 | 390 | 2 |
#include <bits/stdc++.h>
using namespace std;
template <typename D, typename T = D, typename L = T> class Tree {
public:
Tree(long long int size = 0, D InitialValueArg = D()) {
long long int n = 1LL;
CalcTree.emplace_back(vector<TreeNode>(n));
while (n <= size) {
n <<= 1LL;
addOneLine(n);
... | #include <bits/stdc++.h>
using namespace std;
template <typename D, typename T = D, typename L = T> class Tree {
public:
Tree(long long int size = 0, D InitialValueArg = D()) {
long long int n = 1LL;
CalcTree.emplace_back(vector<TreeNode>(n));
while (n <= size) {
n <<= 1LL;
addOneLine(n);
... | [["-", 64, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 69, 28, 22], ["+", 0, 2, 3, 4, 0, 69, 341, 342, 0, 70], ["+", 0, 2, 3, 4, 0, 69, 341, 342, 0, 22], ["+", 0, 2, 3, 4, 0, 69, 341, 342, 0, 73]] | 1 | 1,297 | 5 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#d... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#d... | [["-", 0, 14, 8, 9, 0, 57, 64, 37, 0, 22], ["+", 0, 14, 8, 9, 0, 57, 64, 37, 0, 13], ["-", 0, 14, 8, 9, 0, 37, 0, 2, 63, 22], ["-", 8, 9, 0, 37, 0, 2, 3, 4, 0, 24], ["-", 8, 9, 0, 37, 0, 2, 3, 4, 0, 21], ["+", 0, 14, 8, 9, 0, 37, 0, 16, 17, 72], ["-", 8, 9, 0, 37, 0, 2, 3, 4, 0, 25]] | 1 | 422 | 7 |
#include <bits/stdc++.h>
using namespace std;
// http://hos.ac/slides/20140319_bit.pdf
template <class T, int MAX_N> struct FenwickTree { // 0-indexed
int N;
T data[MAX_N];
void init(int n) {
N = n;
memset(data, 0, sizeof(data));
}
T sum(int j) { //[0, j)
T ret = 0;
for (int x = j - 1; x >= 0... | #include <bits/stdc++.h>
using namespace std;
// http://hos.ac/slides/20140319_bit.pdf
template <class T, int MAX_N> struct FenwickTree { // 0-indexed
int N;
T data[MAX_N];
void init(int n) {
N = n;
memset(data, 0, sizeof(data));
}
T sum(int j) { //[0, j)
T ret = 0;
for (int x = j - 1; x >= 0... | [["+", 0, 7, 8, 9, 0, 1, 0, 27, 17, 68], ["+", 0, 7, 8, 9, 0, 1, 0, 27, 28, 22], ["+", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35], ["-", 49, 50, 51, 2, 3, 4, 0, 16, 17, 72], ["-", 49, 50, 51, 2, 3, 4, 0, 16, 12, 13]] | 1 | 565 | 5 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctype.h>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define mo... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctype.h>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define mo... | [["-", 0, 14, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 17, 107]] | 1 | 471 | 2 |
#include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
template <typename T> struct Add {
T operator()(T x, T y) { return x + y; }
};
template <class T, class Functor> struct SegmentTree {
size_t n;
T e;
vector<T> tree;
Functor F;
SegmentTree(size_t m, T e = T()) : n(1), e(e) {
... | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
template <typename T> struct Add {
T operator()(T x, T y) { return x + y; }
};
template <class T, class Functor> struct SegmentTree {
size_t n;
T e;
vector<T> tree;
Functor F;
SegmentTree(size_t m, T e = T()) : n(1), e(e) {
... | [["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 19]] | 1 | 502 | 2 |
#include <bits/stdc++.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = (i... | #include <bits/stdc++.h>
#define _overload(_1, _2, _3, name, ...) name
#define _rep(i, n) _range(i, 0, n)
#define _range(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)
#define _rrep(i, n) _rrange(i, n, 0)
#define _rrange(i, a, b) for (int i = (i... | [["-", 0, 122, 8, 123, 0, 14, 49, 53, 49, 120], ["+", 0, 122, 8, 123, 0, 14, 49, 53, 49, 120], ["-", 0, 14, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 17, 107], ["-", 64, 9, 0, 1, 0, 2, 63, 118, 119, 120], ["+", 64, 9, 0, 1, 0, 2, 63, 118, 119, 120]] | 1 | 862 | 6 |
#include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define INF_LL 9000000000000000000
#define INF 2000000000
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a... | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define INF_LL 9000000000000000000
#define INF 2000000000
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a... | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 404 | 2 |
#include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define INF_LL 9000000000000000000
#define INF 2000000000
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a... | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define INF_LL 9000000000000000000
#define INF 2000000000
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a... | [["+", 8, 123, 0, 14, 8, 9, 0, 37, 0, 38], ["+", 8, 123, 0, 14, 8, 9, 0, 37, 0, 22], ["+", 8, 123, 0, 14, 8, 9, 0, 37, 0, 35]] | 1 | 525 | 3 |
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tupl... | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tupl... | [["-", 3, 4, 0, 2, 3, 4, 0, 16, 17, 72], ["-", 3, 4, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 455 | 2 |
#include <algorithm>
#include <iostream>
typedef long long ll;
const int N = 100001;
int n = 1;
ll dat[N * 4];
void init(int _n) {
while (n < _n)
n *= 2;
for (int i = 0; i < 2 * n - 1; ++i)
dat[i] = 0;
}
void update(int k, ll x) {
k += n - 1;
dat[k] = x;
while (k > 0) {
k = (k - 1) / 2;
d... | #include <algorithm>
#include <iostream>
typedef long long ll;
const int N = 100001;
int n = 1;
ll dat[N * 4];
void init(int _n) {
while (n < _n)
n *= 2;
for (int i = 0; i < 2 * n - 1; ++i)
dat[i] = 0;
}
void update(int k, ll x) {
k += n - 1;
dat[k] += x;
while (k > 0) {
k = (k - 1) / 2;
... | [["-", 0, 14, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 17, 107]] | 1 | 337 | 2 |
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <queue>
#includ... |
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <queue>
#includ... | [["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 283 | 4 |
#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)
#define each(a, b) for (auto &(a) : ... | #include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)
#define each(a, b) for (auto &(a) : ... | [["-", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78], ["+", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78]] | 1 | 634 | 2 |
#include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) for (int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x) cerr << #x << " = " << (x) << endl;
// const int INF = 1e8;
using namespace std;
const int MAX_N = 100010;
class segTree {
public:
int... | #include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) for (int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x) cerr << #x << " = " << (x) << endl;
// const int INF = 1e8;
using namespace std;
const int MAX_N = 100010;
class segTree {
public:
int... | [["-", 0, 14, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 17, 107]] | 1 | 793 | 2 |
#include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
//#define int long long
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define all(c) begin(c), end(c)
const int INF =
sizeof(int) == sizeof(... | #include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
//#define int long long
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define all(c) begin(c), end(c)
const int INF =
sizeof(int) == sizeof(... | [["+", 0, 122, 8, 123, 0, 14, 0, 357, 0, 102], ["+", 8, 123, 0, 14, 0, 357, 0, 358, 0, 120], ["+", 0, 14, 0, 357, 0, 358, 0, 4, 0, 24], ["+", 0, 14, 0, 357, 0, 358, 0, 4, 0, 22], ["+", 0, 14, 0, 357, 0, 358, 0, 4, 0, 25]] | 1 | 400 | 5 |
// clang-format off
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define main signed main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)... | // clang-format off
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define main signed main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)... | [["+", 0, 2, 3, 4, 0, 16, 31, 69, 28, 22], ["+", 3, 4, 0, 16, 31, 69, 341, 342, 0, 70], ["+", 3, 4, 0, 16, 31, 69, 341, 342, 0, 22], ["+", 3, 4, 0, 16, 31, 69, 341, 342, 0, 73], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72]] | 1 | 1,284 | 5 |
#include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
#define lol(i, n) for (int i = 0; i < n; i++)
#define mod 1000000007
typedef long long ll;
using namespace std;
#define N (1 << 17)
class BIT {
private:
int dat[N];
public:
void Init() { lol(i, N) dat[i] = 0; }
void Add(int i, int x) {
... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
#define lol(i, n) for (int i = 0; i < n; i++)
#define mod 1000000007
typedef long long ll;
using namespace std;
#define N (1 << 17)
class BIT {
private:
int dat[N];
public:
void Init() { lol(i, N) dat[i] = 0; }
void Add(int i, int x) {
... | [["-", 12, 16, 31, 2, 3, 4, 0, 16, 17, 72], ["-", 12, 16, 31, 2, 3, 4, 0, 16, 12, 13], ["+", 12, 16, 12, 2, 3, 4, 0, 16, 17, 33], ["+", 12, 16, 12, 2, 3, 4, 0, 16, 12, 13]] | 1 | 233 | 4 |
/*
ID: barish21
LANG: C++14
TASK: test
*/
/****Author: Barish Namazov****/
#include <bits/stdc++.h>
using namespace std;
/***TEMPLATE***/
#define intt long long
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define F first
#define S second
#define pb push_back
#define IO ... | /*
ID: barish21
LANG: C++14
TASK: test
*/
/****Author: Barish Namazov****/
#include <bits/stdc++.h>
using namespace std;
/***TEMPLATE***/
#define intt long long
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define F first
#define S second
#define pb push_back
#define IO ... | [["-", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 107]] | 1 | 606 | 2 |
#include <bits/stdc++.h>
using namespace std;
int tree[1000000], n;
int sum(int k) {
int s = 0;
while (k >= 1) {
s += tree[k];
k -= k & -k;
}
return s;
}
void add(int k, int x) {
while (k <= n) {
tree[k] += x;
k += k & -k;
}
}
int main() {
int q, kom, l, r, i;
scanf("%d%d", &n, &q);
f... | #include <bits/stdc++.h>
using namespace std;
int tree[1000000], n;
int sum(int k) {
int s = 0;
while (k >= 1) {
s += tree[k];
k -= k & -k;
}
return s;
}
void add(int k, int x) {
while (k <= n) {
tree[k] += x;
k += k & -k;
}
}
int main() {
int q, kom, l, r, i;
scanf("%d%d", &n, &q);
f... | [["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 1 | 221 | 2 |
#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#pragma GCC optimize("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
_main();
}
//----------------------... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#pragma GCC optimize("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
_main();
}
//----------------------... | [["-", 0, 57, 64, 1, 0, 2, 63, 118, 119, 120], ["+", 0, 57, 64, 1, 0, 2, 63, 118, 119, 120]] | 1 | 413 | 2 |
#include <climits>
#include <iostream>
using namespace std;
long n, q;
long mn[300010];
long k = 0, v = 1;
void add(long i, long x) {
i += v;
// cout<<"v:"<<v<<endl;
mn[i] += x;
// cout<<"mn["<<i<<"]:"<<mn[i]<<endl;
i /= 2;
while (i > 0) {
int l = mn[i * 2];
int r = mn[i * 2 + 1];
mn[i] = min... | #include <climits>
#include <iostream>
using namespace std;
long n, q;
long mn[300010];
long k = 0, v = 1;
void add(long i, long x) {
i += v;
// cout<<"v:"<<v<<endl;
mn[i] += x;
// cout<<"mn["<<i<<"]:"<<mn[i]<<endl;
i /= 2;
while (i > 0) {
int l = mn[i * 2];
int r = mn[i * 2 + 1];
mn[i] = l +... | [["-", 8, 9, 0, 1, 0, 11, 12, 2, 63, 22], ["-", 0, 1, 0, 11, 12, 2, 3, 4, 0, 24], ["-", 0, 1, 0, 11, 12, 2, 3, 4, 0, 21], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["-", 0, 1, 0, 11, 12, 2, 3, 4, 0, 25]] | 1 | 336 | 5 |
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define INF... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define INF... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 574 | 2 |
#include <bits/stdc++.h>
using namespace std;
template <typename T> struct BinaryIndexedTree {
vector<T> data;
BinaryIndexedTree(int sz) { data.assign(++sz, 0); }
T sum(int k) {
T ret = 0;
for (++k; k > 0; k -= k & -k)
ret += data[k];
return (ret);
}
void add(int k, T x) {
for (++k;... | #include <bits/stdc++.h>
using namespace std;
template <typename T> struct BinaryIndexedTree {
vector<T> data;
BinaryIndexedTree(int sz) { data.assign(++sz, 0); }
T sum(int k) {
T ret = 0;
for (++k; k > 0; k -= k & -k)
ret += data[k];
return (ret);
}
void add(int k, T x) {
for (++k;... | [["+", 64, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["+", 64, 1, 0, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 16, 31, 2, 3, 4, 0, 16, 17, 33], ["+", 0, 16, 31, 2, 3, 4, 0, 16, 12, 13], ["-", 0, 16, 12, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 16, 12, 2, 3, 4, 0, 16, 12, 13]] | 1 | 221 | 6 |
#include <iostream>
using namespace std;
int n, q, bit[100001];
void add(int a, int b) {
bit[a] += b;
while (a <= n) {
a += a & -a;
bit[a] += b;
}
}
int sum(int i) {
if (i == 0)
return 0;
return bit[i] + sum(i - i & -i);
}
int main(void) {
cin >> n >> q;
for (int i = 0; i < q; i++) {
int ... | #include <iostream>
using namespace std;
int n, q, bit[10000001];
void add(int a, int b) {
bit[a] += b;
while (a <= n) {
a += a & -a;
bit[a] += b;
}
}
int sum(int i) {
if (i == 0)
return 0;
return bit[i] + sum(i - (i & -i));
}
int main(void) {
cin >> n >> q;
for (int i = 0; i < q; i++) {
... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 12, 2, 3, 4, 0, 16, 12, 23, 0, 24], ["+", 12, 2, 3, 4, 0, 16, 12, 23, 0, 25]] | 1 | 167 | 4 |
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define show(x) cout << #x << "=" << x << "\n"
using namespace std;
int n, q;
struct SegmentTree {
int size;
vector<int> data;
const int inf = (1LL << 31) - 1;
SegmentTree(int n) {
size = 1;
while (size < n) {
size ... | #include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define show(x) cout << #x << "=" << x << "\n"
using namespace std;
int n, q;
struct SegmentTree {
int size;
vector<int> data;
const int inf = (1LL << 31) - 1;
SegmentTree(int n) {
size = 1;
while (size < n) {
size ... | [["-", 0, 14, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 17, 107]] | 1 | 439 | 2 |
#include <iostream>
using namespace std;
int BIT[1000010] = {0}, bit_size;
void bit_init(int n) {
fill(BIT, BIT + n, 0);
bit_size = n;
}
int bit_sum(int n) {
int ans;
while (n > 0) {
ans += BIT[n];
n &= n - 1;
}
return ans;
}
void bit_add(int n, int v) {
while (n <= bit_size) {
BIT[n] += v... | #include <iostream>
using namespace std;
int BIT[1000010] = {0}, bit_size;
void bit_init(int n) {
fill(BIT, BIT + n, 0);
bit_size = n;
}
int bit_sum(int n) {
int ans = 0;
while (n > 0) {
ans += BIT[n];
n &= n - 1;
}
return ans;
}
void bit_add(int n, int v) {
while (n <= bit_size) {
BIT[n] ... | [["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 235 | 2 |
#include <bits/stdc++.h>
//#include <math.h>
using namespace std;
#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define BIT(x, ... | #include <bits/stdc++.h>
//#include <math.h>
using namespace std;
#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define BIT(x, ... | [["-", 0, 14, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 17, 107]] | 1 | 561 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
#define N 131072
int tree[N * 2];
int getsum(int a, int b, int k, int l, int r) {
if (r <= a || b <= l)
return 0;
if (a <= l && r <= b)
return tree[k];
int m = (l + r) / 2;
return getsum(a, b, k * 2 + 1, l, m) + getsum(a, b, k * 2 + 2, m, r);... | #include <algorithm>
#include <iostream>
using namespace std;
#define N 131072
int tree[N * 2];
int getsum(int a, int b, int k, int l, int r) {
if (r <= a || b <= l)
return 0;
if (a <= l && r <= b)
return tree[k];
int m = (l + r) / 2;
return getsum(a, b, k * 2 + 1, l, m) + getsum(a, b, k * 2 + 2, m, r);... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 246 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define all(vec) vec.begin(), vec.end()
typedef long long int ll;
typedef pair<ll, ll> P;
const ll MOD = 10000;
const ll INF = 1000000010;
const ll LINF = 1000000000000000010;
const int MAX = 2010;
int dx[8] = {0, 1, 0, -1, 1, -1, 1, -1};
int dy[8] = {1, 0, -1, 0, 1, -1, -1... | #include <bits/stdc++.h>
using namespace std;
#define all(vec) vec.begin(), vec.end()
typedef long long int ll;
typedef pair<ll, ll> P;
const ll MOD = 10000;
const ll INF = 1000000010;
const ll LINF = 1000000000000000010;
const int MAX = 2010;
int dx[8] = {0, 1, 0, -1, 1, -1, 1, -1};
int dy[8] = {1, 0, -1, 0, 1, -1, -1... | [["+", 0, 2, 3, 4, 0, 16, 31, 69, 28, 22], ["+", 3, 4, 0, 16, 31, 69, 341, 342, 0, 70], ["+", 3, 4, 0, 16, 31, 69, 341, 342, 0, 22], ["+", 3, 4, 0, 16, 31, 69, 341, 342, 0, 73], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72]] | 1 | 541 | 5 |
#include <iostream>
using namespace std;
int *d;
int n = 1;
void initRSQ(int n) {
for (int i = 0; i < 2 * n - 1; i++)
d[i] = 0;
}
void add(int k, int a) {
k += n - 1;
d[k] = d[k] + a;
while (k > 1) {
k = (k - 1) / 2;
d[k] = d[k * 2 + 1] + d[k * 2 + 2];
}
}
int query(int a, int b, int k, int l,... | #include <iostream>
using namespace std;
int *d;
int n = 1;
void initRSQ(int n) {
for (int i = 0; i < 2 * n - 1; i++)
d[i] = 0;
}
void add(int k, int a) {
k += n - 1;
d[k] = d[k] + a;
while (k > 0) {
k = (k - 1) / 2;
d[k] = d[k * 2 + 1] + d[k * 2 + 2];
}
}
int query(int a, int b, int k, int l,... | [["-", 8, 9, 0, 52, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 12, 13], ["-", 0, 37, 0, 2, 3, 4, 0, 16, 17, 72], ["-", 0, 37, 0, 2, 3, 4, 0, 16, 12, 13], ["-", 31, 16, 12, 2, 3, 4, 0, 16, 17, 33], ["-", 31, 16, 12, 2, 3, 4, 0, 16, 12, 13]] | 1 | 352 | 6 |
#include <iostream>
#define MAX 250000
using namespace std;
int D[MAX];
int n = 1;
void initRSQ(int n_) {
while (n < n_)
n *= 2;
for (int i = 0; i < 2 * n - 1; i++)
D[i] = 0;
}
void add(int k, int a) {
k += n - 1;
D[k] += a;
while (k > 0) {
k = (k - 1) / 2;
D[k] = D[2 * k + 1] + D[2 * k + 2... | #include <iostream>
#define MAX 300000
using namespace std;
int D[MAX];
int n = 1;
void initRSQ(int n_) {
while (n < n_)
n *= 2;
for (int i = 0; i < 2 * n - 1; i++)
D[i] = 0;
}
void add(int k, int a) {
k += n - 1;
D[k] += a;
while (k > 0) {
k = (k - 1) / 2;
D[k] = D[2 * k + 1] + D[2 * k + 2... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 0, 37, 0, 2, 3, 4, 0, 16, 17, 72], ["-", 0, 37, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 349 | 4 |
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define rep(i, n) REP(i, ... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define rep(i, n) REP(i, ... | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 31, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 31, 22], ["-", 75, 76, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 75, 76, 0, 1, 0, 2, 3, 4, 0, 22]] | 1 | 442 | 4 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.