結果
| 問題 |
No.1441 MErGe
|
| コンテスト | |
| ユーザー |
 nok0
|
| 提出日時 | 2021-03-26 23:49:38 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
CE
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 15,896 bytes |
| コンパイル時間 | 3,535 ms |
| コンパイル使用メモリ | 244,344 KB |
| 最終ジャッジ日時 | 2025-01-19 23:41:29 |
|
ジャッジサーバーID （参考情報） |
judge5 / judge5 |
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
main.cpp: In function ‘void scanner::scan(char*)’:
main.cpp:117:33: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
117 | void scan(char a[]) { std::scanf("%s", a); }
| ~~~~~~~~~~^~~~~~~~~
In file included from /usr/include/c++/13/string:43,
from /usr/include/c++/13/bitset:52,
from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:52,
from main.cpp:13:
/usr/include/c++/13/bits/allocator.h: In destructor ‘std::__cxx11::basic_string<char>::_Alloc_hider::~_Alloc_hider()’:
/usr/include/c++/13/bits/allocator.h:184:7: error: inlining failed in call to ‘always_inline’ ‘std::allocator< <template-parameter-1-1> >::~allocator() noexcept [with _Tp = char]’: target specific option mismatch
184 | ~allocator() _GLIBCXX_NOTHROW { }
| ^
In file included from /usr/include/c++/13/string:54:
/usr/include/c++/13/bits/basic_string.h:181:14: note: called from here
181 | struct _Alloc_hider : allocator_type // TODO check __is_final
| ^~~~~~~~~~~~
ソースコード
/**
* author: nok0
* created: 2021.03.26 23:39:47
**/
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
#pragma region Macros
// rep macro
#define foa(v, a) for(auto &v : a)
#define REPname(a, b, c, d, e, ...) e
#define REP(...) REPname(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)
#define REP0(x) for(int i = 0; i < (x); ++i)
#define REP1(i, x) for(int i = 0; i < (x); ++i)
#define REP2(i, l, r) for(int i = (l); i < (r); ++i)
#define REP3(i, l, r, c) for(int i = (l); i < (r); i += (c))
#define REPSname(a, b, c, ...) c
#define REPS(...) REPSname(__VA_ARGS__, REPS1, REPS0)(__VA_ARGS__)
#define REPS0(x) for(int i = 1; i <= (x); ++i)
#define REPS1(i, x) for(int i = 1; i <= (x); ++i)
#define RREPname(a, b, c, d, e, ...) e
#define RREP(...) RREPname(__VA_ARGS__, RREP3, RREP2, RREP1, RREP0)(__VA_ARGS__)
#define RREP0(x) for(int i = (x)-1; i >= 0; --i)
#define RREP1(i, x) for(int i = (x)-1; i >= 0; --i)
#define RREP2(i, r, l) for(int i = (r)-1; i >= (l); --i)
#define RREP3(i, r, l, c) for(int i = (r)-1; i >= (l); i -= (c))
#define RREPSname(a, b, c, ...) c
#define RREPS(...) RREPSname(__VA_ARGS__, RREPS1, RREPS0)(__VA_ARGS__)
#define RREPS0(x) for(int i = (x); i >= 1; --i)
#define RREPS1(i, x) for(int i = (x); i >= 1; --i)
// name macro
#define pb push_back
#define eb emplace_back
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define popcnt(x) __builtin_popcountll(x)
template <class T = int>
using V = std::vector<T>;
template <class T = int>
using VV = std::vector<std::vector<T>>;
template <class T>
using pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;
using ll = long long;
using ld = long double;
using int128 = __int128_t;
using pii = std::pair<int, int>;
using pll = std::pair<long long, long long>;
// input macro
template <class T, class U>
std::istream &operator>>(std::istream &is, std::pair<T, U> &p) {
is >> p.first >> p.second;
return is;
}
template <class T>
std::istream &operator>>(std::istream &is, std::vector<T> &v) {
for(T &i : v) is >> i;
return is;
}
std::istream &operator>>(std::istream &is, __int128_t &a) {
std::string s;
is >> s;
__int128_t ret = 0;
for(int i = 0; i < s.length(); i++)
if('0' <= s[i] and s[i] <= '9')
ret = 10 * ret + s[i] - '0';
a = ret * (s[0] == '-' ? -1 : 1);
return is;
}
#if __has_include(<atcoder/all>)
std::istream &operator>>(std::istream &is, atcoder::modint998244353 &a) {
long long v;
is >> v;
a = v;
return is;
}
std::istream &operator>>(std::istream &is, atcoder::modint1000000007 &a) {
long long v;
is >> v;
a = v;
return is;
}
template <int m>
std::istream &operator>>(std::istream &is, atcoder::static_modint<m> &a) {
long long v;
is >> v;
a = v;
return is;
}
template <int m>
std::istream &operator>>(std::istream &is, atcoder::dynamic_modint<m> &a) {
long long v;
is >> v;
a = v;
return is;
}
#endif
namespace scanner {
void scan(int &a) { std::cin >> a; }
void scan(long long &a) { std::cin >> a; }
void scan(std::string &a) { std::cin >> a; }
void scan(char &a) { std::cin >> a; }
void scan(char a[]) { std::scanf("%s", a); }
void scan(double &a) { std::cin >> a; }
void scan(long double &a) { std::cin >> a; }
template <class T, class U>
void scan(std::pair<T, U> &p) { std::cin >> p; }
template <class T>
void scan(std::vector<T> &a) { std::cin >> a; }
void INPUT() {}
template <class Head, class... Tail>
void INPUT(Head &head, Tail &... tail) {
scan(head);
INPUT(tail...);
}
} // namespace scanner
#define VEC(type, name, size) \
std::vector<type> name(size); \
scanner::INPUT(name)
#define VVEC(type, name, h, w) \
std::vector<std::vector<type>> name(h, std::vector<type>(w)); \
scanner::INPUT(name)
#define INT(...) \
int __VA_ARGS__; \
scanner::INPUT(__VA_ARGS__)
#define LL(...) \
long long __VA_ARGS__; \
scanner::INPUT(__VA_ARGS__)
#define STR(...) \
std::string __VA_ARGS__; \
scanner::INPUT(__VA_ARGS__)
#define CHAR(...) \
char __VA_ARGS__; \
scanner::INPUT(__VA_ARGS__)
#define DOUBLE(...) \
double __VA_ARGS__; \
scanner::INPUT(__VA_ARGS__)
#define LD(...) \
long double __VA_ARGS__; \
scanner::INPUT(__VA_ARGS__)
// output-macro
template <class T, class U>
std::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {
os << p.first << " " << p.second;
return os;
}
template <class T>
std::ostream &operator<<(std::ostream &os, const std::vector<T> &a) {
for(int i = 0; i < int(a.size()); ++i) {
if(i) os << " ";
os << a[i];
}
return os;
}
std::ostream &operator<<(std::ostream &dest, __int128_t &value) {
std::ostream::sentry s(dest);
if(s) {
__uint128_t tmp = value < 0 ? -value : value;
char buffer[128];
char *d = std::end(buffer);
do {
--d;
*d = "0123456789"[tmp % 10];
tmp /= 10;
} while(tmp != 0);
if(value < 0) {
--d;
*d = '-';
}
int len = std::end(buffer) - d;
if(dest.rdbuf()->sputn(d, len) != len) {
dest.setstate(std::ios_base::badbit);
}
}
return dest;
}
#if __has_include(<atcoder/all>)
std::ostream &operator<<(std::ostream &os, const atcoder::modint998244353 &a) { return os << a.val(); }
std::ostream &operator<<(std::ostream &os, const atcoder::modint1000000007 &a) { return os << a.val(); }
template <int m>
std::ostream &operator<<(std::ostream &os, const atcoder::static_modint<m> &a) { return os << a.val(); }
template <int m>
std::ostream &operator<<(std::ostream &os, const atcoder::dynamic_modint<m> &a) { return os << a.val(); }
#endif
template <class T>
void print(const T a) { std::cout << a << '\n'; }
template <class Head, class... Tail>
void print(Head H, Tail... T) {
std::cout << H << ' ';
print(T...);
}
template <class T>
void printel(const T a) { std::cout << a << '\n'; }
template <class T>
void printel(const std::vector<T> &a) {
for(const auto &v : a)
std::cout << v << '\n';
}
template <class Head, class... Tail>
void printel(Head H, Tail... T) {
std::cout << H << '\n';
printel(T...);
}
void Yes(const bool b = true) { std::cout << (b ? "Yes\n" : "No\n"); }
void No() { std::cout << "No\n"; }
void YES(const bool b = true) { std::cout << (b ? "YES\n" : "NO\n"); }
void NO() { std::cout << "NO\n"; }
void err(const bool b = true) {
if(b) {
std::cout << "-1\n", exit(0);
}
}
//debug macro
namespace debugger {
template <class T>
void view(const std::vector<T> &a) {
std::cerr << "{ ";
for(const auto &v : a) {
std::cerr << v << ", ";
}
std::cerr << "\b\b }";
}
template <class T>
void view(const std::vector<std::vector<T>> &a) {
std::cerr << "{\n";
for(const auto &v : a) {
std::cerr << "\t";
view(v);
std::cerr << "\n";
}
std::cerr << "}";
}
template <class T, class U>
void view(const std::vector<std::pair<T, U>> &a) {
std::cerr << "{\n";
for(const auto &p : a) std::cerr << "\t(" << p.first << ", " << p.second << ")\n";
std::cerr << "}";
}
template <class T, class U>
void view(const std::map<T, U> &m) {
std::cerr << "{\n";
for(const auto &p : m) std::cerr << "\t[" << p.first << "] : " << p.second << "\n";
std::cerr << "}";
}
template <class T, class U>
void view(const std::pair<T, U> &p) { std::cerr << "(" << p.first << ", " << p.second << ")"; }
template <class T>
void view(const std::set<T> &s) {
std::cerr << "{ ";
for(auto &v : s) {
view(v);
std::cerr << ", ";
}
std::cerr << "\b\b }";
}
template <class T>
void view(const T &e) { std::cerr << e; }
} // namespace debugger
#ifdef LOCAL
void debug_out() {}
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
debugger::view(H);
std::cerr << ", ";
debug_out(T...);
}
#define debug(...) \
do { \
std::cerr << __LINE__ << " [" << #__VA_ARGS__ << "] : ["; \
debug_out(__VA_ARGS__); \
std::cerr << "\b\b]\n"; \
} while(false)
#else
#define debug(...) (void(0))
#endif
// vector macro
template <class T>
int lb(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::lower_bound((a).begin(), (a).end(), (x))); }
template <class T>
int ub(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::upper_bound((a).begin(), (a).end(), (x))); }
template <class T>
void UNIQUE(std::vector<T> &a) {
std::sort(a.begin(), a.end());
a.erase(std::unique(a.begin(), a.end()), a.end());
}
template <class T>
std::vector<T> press(std::vector<T> &a) {
auto res = a;
UNIQUE(res);
for(auto &v : a)
v = lb(res, v);
return res;
}
#define SORTname(a, b, c, ...) c
#define SORT(...) SORTname(__VA_ARGS__, SORT1, SORT0, ...)(__VA_ARGS__)
#define SORT0(a) std::sort((a).begin(), (a).end())
#define SORT1(a, c) std::sort((a).begin(), (a).end(), [](const auto x, const auto y) { return x c y; })
template <class T>
void ADD(std::vector<T> &a, const T x) {
for(auto &v : a) v += x;
}
template <class T>
void SUB(std::vector<T> &a, const T x = 1) {
for(auto &v : a) v -= x;
}
template <class T>
void MUL(std::vector<T> &a, const T x) {
for(auto &v : a) v *= x;
}
template <class T>
void DIV(std::vector<T> &a, const T x) {
for(auto &v : a) v /= x;
}
// math macro
template <class T, class U>
inline bool chmin(T &a, const U &b) { return a > b ? a = b, true : false; }
template <class T, class U>
inline bool chmax(T &a, const U &b) { return a < b ? a = b, true : false; }
template <class T>
T divup(T x, T y) { return (x + y - 1) / y; }
template <class T>
T POW(T a, long long n) {
T ret = 1;
while(n) {
if(n & 1) ret *= a;
a *= a;
n >>= 1;
}
return ret;
}
// modpow
long long POW(long long a, long long n, const int mod) {
long long ret = 1;
while(n) {
if(n & 1) (ret *= a) %= mod;
(a *= a) %= mod;
n >>= 1;
}
return ret;
}
// others
struct fast_io {
fast_io() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(15);
}
} fast_io_;
const int inf = 1e9;
const ll INF = 1e18;
#pragma endregion
template <class S,
S (*op)(S, S),
S (*e)(),
class F,
S (*mapping)(F, S, int),
F (*composition)(F, F),
F (*id)()>
struct ImplicitTreap {
public:
ImplicitTreap() : ImplicitTreap(0) {}
ImplicitTreap(const int n) : ImplicitTreap(std::vector(n, e())) {}
ImplicitTreap(const int n, S x) : ImplicitTreap(std::vector(n, x)) {}
ImplicitTreap(const std::vector<S> &v) {
for(int i = v.size() - 1; i >= 0; i--) insert(0, v[i]);
}
void insert(const int p, const S x) {
assert(0 <= p and p <= size());
insert(root, p, std::make_shared<node>(x, rnd()));
}
void erase(const int l, const int r) {
assert(0 <= l and l <= r and r <= size());
erase(root, l, r);
}
void set(const int p, const S x) {
assert(0 <= p and p < size());
set(root, p, x);
}
S get(const int p) {
assert(0 <= p and p < size());
return prod(p, p + 1);
}
S prod(const int l, const int r) {
assert(0 <= l and l <= r and r <= size());
return prod(root, l, r);
}
S all_prod() { return root != nullptr ? root->acc : e(); }
void apply(const int p, const F f) { return apply(p, p + 1, f); }
void apply(const int l, const int r, const F f) {
assert(0 <= l and l <= r and r <= size());
apply(root, l, r, f);
}
void reverse(const int l, const int r) {
assert(0 <= l and l <= r and r <= size());
reverse(root, l, r);
}
void rotate(const int l, const int r, const int m) {
assert(0 <= l and l <= r and r <= size());
reverse(l, r);
reverse(l, l + r - m);
reverse(l + r - m, r);
}
void push_front(const S x) { insert(0, x); }
void push_back(const S x) { insert(size(), x); }
void pop_front() {
assert(size());
erase(0);
}
void pop_back() {
assert(size());
erase(size() - 1);
}
int size() const noexcept { return cnt(root); }
bool empty() const noexcept { return cnt(root) == 0; }
private:
struct xorshift {
uint32_t x = 123456789, y = 362436069, z = 521288629, w = 88675123;
xorshift(uint32_t seed = 0) { z ^= seed; }
uint32_t operator()() {
uint32_t t = x ^ (x << 11);
x = y;
y = z;
z = w;
return w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));
}
};
xorshift rnd;
struct node;
using node_ptr = std::shared_ptr<node>;
struct node {
S val, acc;
F lazy;
uint32_t pri;
int cnt;
bool rev;
node_ptr l, r;
node(S val, uint32_t pri) : val(val), acc(e()), lazy(id()), pri(pri), cnt(1), rev(false), l(nullptr), r(nullptr) {}
};
node_ptr root = nullptr;
int cnt(const node_ptr &t) const { return t != nullptr ? t->cnt : 0; }
S acc(const node_ptr &t) const { return t != nullptr ? t->acc : e(); }
void update(node_ptr &t) {
if(t != nullptr) {
t->cnt = cnt(t->l) + 1 + cnt(t->r);
t->acc = op(acc(t->l), op(t->val, acc(t->r)));
}
}
void push(node_ptr &t) {
if(t != nullptr) {
if(t->rev == true) {
std::swap(t->l, t->r);
t->rev = false;
if(t->l != nullptr) t->l->rev ^= 1;
if(t->r != nullptr) t->r->rev ^= 1;
}
if(t->l != nullptr) {
t->l->lazy = composition(t->lazy, t->l->lazy);
t->l->acc = mapping(t->lazy, t->l->acc, cnt(t->l));
}
if(t->r != nullptr) {
t->r->lazy = composition(t->lazy, t->r->lazy);
t->r->acc = mapping(t->lazy, t->r->acc, cnt(t->r));
}
t->val = mapping(t->lazy, t->val, 1);
t->lazy = id();
update(t);
}
}
void split(node_ptr t, int key, node_ptr &l, node_ptr &r) {
if(t == nullptr) {
l = r = nullptr;
return;
}
push(t);
int implicit_key = cnt(t->l) + 1;
if(key < implicit_key)
split(t->l, key, l, t->l), r = t;
else
split(t->r, key - implicit_key, t->r, r), l = t;
update(t);
}
void merge(node_ptr &t, node_ptr l, node_ptr r) {
push(l), push(r);
if(l == nullptr or r == nullptr)
t = (l != nullptr ? l : r);
else if(l->pri > r->pri)
merge(l->r, l->r, r), t = l;
else
merge(r->l, l, r->l), t = r;
update(t);
}
void insert(node_ptr &t, int key, node_ptr x) {
node_ptr t1(nullptr), t2(nullptr);
split(t, key, t1, t2);
merge(t1, t1, x);
merge(t, t1, t2);
}
void erase(node_ptr &t, int l, int r) {
node_ptr t1(nullptr), t2(nullptr), t3(nullptr);
split(t, r, t1, t2);
split(t1, l, t1, t3);
merge(t, t1, t2);
}
S prod(node_ptr &t, int l, int r) {
node_ptr t1 = nullptr, t2 = nullptr, t3 = nullptr;
split(t, l, t1, t2);
split(t2, r - l, t2, t3);
S ret = t2->acc;
merge(t2, t2, t3);
merge(t, t1, t2);
return ret;
}
void apply(node_ptr &t, const int l, const int r, const F f) {
node_ptr t1 = nullptr, t2 = nullptr, t3 = nullptr;
split(t, l, t1, t2);
split(t2, r - l, t2, t3);
t2->lazy = composition(f, t2->lazy);
t2->acc = mapping(f, t2->acc, cnt(t2));
merge(t2, t2, t3);
merge(t, t1, t2);
}
void set(node_ptr &t, const int p, const S x) {
node_ptr t1 = nullptr, t2 = nullptr, t3 = nullptr;
split(t, p, t1, t2);
split(t2, 1, t2, t3);
t2->val = x;
merge(t2, t2, t3);
merge(t, t1, t2);
}
void reverse(node_ptr &t, int l, int r) {
node_ptr t1 = nullptr, t2 = nullptr, t3 = nullptr;
split(t, l, t1, t2);
split(t2, r - l, t2, t3);
t2->rev ^= 1;
merge(t2, t2, t3);
merge(t, t1, t2);
}
};
using S = ll;
S op(S x, S y) { return x + y; }
S e() { return 0; }
using F = ll;
S mapping(F f, S x, int sz) { return f + x; }
F composition(F f, F g) { return f + g; }
F id() { return 0; }
void main_() {
INT(n, q);
VEC(ll, a, n);
ImplicitTreap<S, op, e, F, mapping, composition, id> seg(a);
while(q--) {
INT(t, l, r);
--l;
if(t == 1) {
ll sum = seg.prod(l, r);
seg.erase(l, r);
seg.insert(l, sum);
} else
print(seg.prod(l, r));
}
}
int main() {
int t = 1;
//cin >> t;
while(t--) main_();
return 0;
}