結果
| 問題 | No.789 範囲の合計 |
| ユーザー |
 jell
|
| 提出日時 | 2019-03-01 16:22:27 |
| 言語 | C++14 (gcc 13.2.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 67 ms / 1,000 ms |
| コード長 | 9,055 bytes |
| コンパイル時間 | 1,747 ms |
| コンパイル使用メモリ | 181,376 KB |
| 実行使用メモリ | 7,064 KB |
| 最終ジャッジ日時 | 2023-09-05 16:35:44 |
| 合計ジャッジ時間 | 3,679 ms |
|
ジャッジサーバーID （参考情報） |
judge15 / judge11 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 3 ms
5,124 KB |
| testcase_01 | AC | 3 ms
5,308 KB |
| testcase_02 | AC | 64 ms
6,920 KB |
| testcase_03 | AC | 57 ms
6,724 KB |
| testcase_04 | AC | 62 ms
6,844 KB |
| testcase_05 | AC | 50 ms
6,804 KB |
| testcase_06 | AC | 53 ms
6,692 KB |
| testcase_07 | AC | 45 ms
7,064 KB |
| testcase_08 | AC | 50 ms
6,984 KB |
| testcase_09 | AC | 49 ms
6,832 KB |
| testcase_10 | AC | 67 ms
6,504 KB |
| testcase_11 | AC | 44 ms
7,004 KB |
| testcase_12 | AC | 44 ms
6,724 KB |
| testcase_13 | AC | 3 ms
5,124 KB |
| testcase_14 | AC | 3 ms
5,136 KB |
ソースコード
#include <bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
using ui64 = uint_fast64_t;
using db = long double;
using pii = pair<int, int>;
using pli = pair<int_fast64_t, int>;
using pll = pair<int_fast64_t, int_fast64_t>;
using pdi = pair<double, int>;
template <class T> using vct = vector<T>;
template <class T> using heap = priority_queue<T>;
template <class T> using minheap = priority_queue<T, vector<T>, greater<T>>;
template <class T> constexpr T inf = numeric_limits<T>::max() / 2 - 1;
constexpr int dx[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
constexpr int dy[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
constexpr long double gold = 1.618033988;
constexpr long double eps = 1e-15;
#define stdout_precision 10
#define stderr_precision 2
#define itr(i,v) for(auto i = begin(v); i != end(v); ++i)
#define ritr(i,v) for(auto i = rbegin(v); i != rend(v); ++i)
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
#define fir first
#define sec second
#define fro front
#define bac back
#define u_map unordered_map
#define u_set unordered_set
#define l_bnd lower_bound
#define u_bnd upper_bound
#define rsz resize
#define ers erase
#define emp emplace
#define emf emplace_front
#define emb emplace_back
#define pof pop_front
#define pob pop_back
#define mkp make_pair
#define mkt make_tuple
#define popcnt __builtin_popcount
struct setupper {
setupper() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cout.tie(nullptr);
std::cerr.tie(nullptr);
std::cout << fixed << setprecision(stdout_precision);
std::cerr << fixed << setprecision(stderr_precision);
// #ifdef Local
// std::cerr << "\n---stderr---\n";
// auto print_atexit = []() {
// std::cerr << "Exec time : " << clock() / (double)CLOCKS_PER_SEC * 1000.0 << "ms\n";
// std::cerr << "------------\n";
// };
// atexit((void(*)())print_atexit);
// #endif
}
} setupper_;
namespace std {
template <class T> void hash_combine(size_t &seed, T const &key) {
seed ^= hash<T>()(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2);
}
template <class T, class U> struct hash<pair<T,U>> {
size_t operator()(pair<T,U> const &pr) const
{
size_t seed = 0;
hash_combine(seed,pr.first);
hash_combine(seed,pr.second);
return seed;
}
};
template <class Tup, size_t index = tuple_size<Tup>::value - 1> struct hashval_calc {
static void apply(size_t& seed, Tup const& tup) {
hashval_calc<Tup, index - 1>::apply(seed, tup);
hash_combine(seed,get<index>(tup));
}
};
template <class Tup> struct hashval_calc<Tup,0> {
static void apply(size_t& seed, Tup const& tup) {
hash_combine(seed,get<0>(tup));
}
};
template <class ...T> struct hash<tuple<T...>> {
size_t operator()(tuple<T...> const& tup) const
{
size_t seed = 0;
hashval_calc<tuple<T...>>::apply(seed,tup);
return seed;
}
};
}
template <class T, class U> istream &operator>> (istream &s, pair<T,U> &p) { return s >> p.first >> p.second; }
template <class T, class U> ostream &operator<< (ostream &s, const pair<T,U> p) { return s << p.first << " " << p.second; }
template <class T> ostream &operator<< (ostream &s, const vector<T> &v) {
for(size_t i = 0; i < v.size(); ++i) s << (i ? " " : "") << v[i];
return s;
}
#define dump(...) cerr << " [ " << __LINE__ << " : " << __FUNCTION__ << " ] " << #__VA_ARGS__ << " : ";\
dump_func(__VA_ARGS__)
template <class T> void dump_func(T x) { cerr << x << '\n'; }
template <class T,class ...Rest> void dump_func(T x, Rest ... rest) { cerr << x << ","; dump_func(rest...); }
template <class T = int> T read() { T x; return cin >> x, x; }
template <class T> void write(T x) { cout << x << '\n'; }
template <class T, class ...Rest> void write(T x, Rest ... rest) { cout << x << ' '; write(rest...); }
void writeln() {}
template <class T, class ...Rest> void writeln(T x, Rest ... rest) { cout << x << '\n'; writeln(rest...); }
#define esc(...) writeln(__VA_ARGS__), exit(0)
namespace updater {
template <class T> static void add(T &x, const T &y) { x += y; }
template <class T> static void ext_add(T &x, const T &y, size_t w) { x += y * w; }
template <class T> static void mul(T &x, const T &y) { x *= y; }
template <class T> static void ext_mul(T &x, const T &y, size_t w) { x *= (T)pow(y,w); }
template <class T> static bool chmax(T &x, const T &y) { return x < y ? x = y,true : false; }
template <class T> static bool chmin(T &x, const T &y) { return x > y ? x = y,true : false; }
};
using updater::chmax;
using updater::chmin;
template <class T> T minf(const T &x, const T &y) { return min(x,y); }
template <class T> T mixf(const T &x, const T &y) { return max(x,y); }
bool bit(i64 n, uint8_t e) { return (n >> e) & 1; }
i64 mask(i64 n, uint8_t e) { return n & ((1 << e) - 1); }
int ilog(uint64_t x, uint64_t b = 2) { return x ? 1 + ilog(x / b,b) : -1; }
template <class F> i64 binry(i64 ok, i64 ng, const F &fn) {
while (abs(ok - ng) > 1) {
i64 mid = (ok + ng) / 2;
(fn(mid) ? ok : ng) = mid;
}
return ok;
}
template <class A, size_t N, class T> void init(A (&array)[N], const T &val) { fill((T*)array,(T*)(array + N),val); }
template <class A> void cmprs(A ary[], size_t n) {
vector<A> tmp(ary,ary + n);
tmp.erase(unique(begin(tmp),end(tmp)), end(tmp));
for(A *i = ary; i != ary + n; ++i) *i = l_bnd(all(tmp),*i) - begin(tmp);
}
template <class T> void cmprs(vector<T> &v) {
vector<T> tmp = v; sort(begin(tmp),end(tmp));
tmp.erase(unique(begin(tmp),end(tmp)), end(tmp));
for(auto i = begin(v); i != end(v); ++i) *i = l_bnd(all(tmp),*i) - begin(tmp);
}
template <class F> void for_subset(uint_fast64_t s, const F &fn) {
uint_fast64_t tmp = s;
do { fn(tmp); } while((--tmp &= s) != s);
}
template <class Monoid, class T = Monoid, size_t N = 1 << 18> struct Segtree {
using opr_t = function<Monoid(const Monoid&, const Monoid&)>;
using update_opr_t = function<void(Monoid&, const T&)>;
const opr_t opr;
const update_opr_t update_opr;
const Monoid idel;
vector<Monoid> data;
const size_t n;
Segtree(size_t n_, Monoid idel_ = Monoid(), const opr_t &opr_ = plus<Monoid>(), const update_opr_t &update_opr_ = [](Monoid &x,Monoid y){x += y;}) : n(n_),opr(opr_),update_opr(update_opr_),idel(idel_)
{
data.assign(N << 1,idel);
}
void copy(const vector<Monoid> &v) {
for(size_t i = 0; i != v.size(); ++i) data[i + N] = v[i];
for(size_t i = N - 1; i; --i) data[i] = opr(data[i * 2],data[i * 2 + 1]);
}
void update(size_t idx, T val) {
update_opr(data[idx += N],val);
while(idx >>= 1) data[idx] = opr(data[idx * 2],data[idx * 2 + 1]);
}
Monoid query(size_t a, size_t b, bool is_first = true) {
if(a >= b) return idel;
if(is_first) a += N,b += N;
Monoid left = a & 1 ? data[a++] : idel;
Monoid right = b & 1 ? data[--b] : idel;
return opr(opr(left,query(a >> 1,b >> 1,false)),right);
}
size_t segbound(size_t i, const function<bool(Monoid,size_t)> &judge) {
size_t w = 1,rig = i,j = N << 1;
i += N;
while(i != j) {
if(i & 1) {
rig += w;
if(!judge(data[i],w)) break;
i++;
}
i >>= 1,j >>= 1,w <<= 1;
}
if(i == j) return n;
while(w > 1) {
if(judge(data[i <<= 1],w >>= 1)) ++i;
else rig -= w;
}
return min(n,--rig);
}
struct sum_lower_bound_fn {
Monoid x;
sum_lower_bound_fn(Monoid x_) : x(x_) {}
bool operator()(Monoid v, size_t w) {
return v < x ? x -= v,true : false;
}
};
size_t sum_lower_bound(size_t i, Monoid v) {
return segbound(i, sum_lower_bound_fn(v));
}
struct sum_upper_bound_fn {
Monoid x;
sum_upper_bound_fn(Monoid x_) : x(x_) {}
bool operator()(Monoid v, size_t w) {
return v <= x ? x -= v,true : false;
}
};
size_t sum_upper_bound(size_t i, Monoid v) {
return segbound(i, sum_upper_bound_fn(v));
}
};
int n;
vector<int> idx;
vector<tuple<int,int,int>> qry;
i64 ans;
signed main() {
cin>>n;
while(n--) {
int x,y,z;
cin>>x>>y>>z;
qry.push_back(tie(x,y,z));
if(!x) idx.push_back(y);
}
sort(all(idx));
Segtree<int> sg(idx.size());
for(auto &t:qry) {
int x,y,z;
tie(x,y,z) = t;
if(x) {
int l=l_bnd(all(idx),y)-idx.begin();
int r=u_bnd(all(idx),z)-idx.begin();
ans+=sg.query(l,r);
} else {
int p=l_bnd(all(idx),y)-idx.begin();
sg.update(p,z);
}
}
cout<<ans<<endl;
}