結果
問題 | No.2808 Concentration |
ユーザー |
![]() |
提出日時 | 2024-07-12 22:36:30 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 8,421 bytes |
コンパイル時間 | 2,552 ms |
コンパイル使用メモリ | 209,284 KB |
実行使用メモリ | 12,288 KB |
最終ジャッジ日時 | 2024-07-12 22:36:42 |
合計ジャッジ時間 | 11,151 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | WA | - |
testcase_02 | WA | - |
testcase_03 | AC | 158 ms
12,192 KB |
testcase_04 | AC | 2 ms
6,940 KB |
testcase_05 | AC | 2 ms
6,944 KB |
testcase_06 | AC | 2 ms
6,940 KB |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | WA | - |
testcase_41 | WA | - |
testcase_42 | WA | - |
testcase_43 | WA | - |
testcase_44 | WA | - |
testcase_45 | WA | - |
testcase_46 | WA | - |
testcase_47 | WA | - |
testcase_48 | WA | - |
testcase_49 | WA | - |
testcase_50 | WA | - |
testcase_51 | WA | - |
testcase_52 | WA | - |
testcase_53 | WA | - |
testcase_54 | WA | - |
testcase_55 | WA | - |
testcase_56 | AC | 2 ms
6,944 KB |
ソースコード
#line 1 "test.cpp" #include<bits/stdc++.h> //#pragma GCC target("avx,avx2") //#pragma GCC optimize("O3") //#pragma GCC optimize("unroll-loops") #ifdef LOCAL #include <debug.hpp> #define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__) #else #define debug(...) (static_cast<void>(0)) #endif using namespace std; using ll = long long; using ull = unsigned long long; using ld = long double; using pll = pair<ll,ll>; using pii = pair<int,int>; using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>; using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>; using vul = vector<ull>; using vpii = vector<pii>; using vvpii = vector<vpii>; using vpll = vector<pll>; using vs = vector<string>; template<class T> using pq = priority_queue<T,vector<T>, greater<T>>; #define overload4(_1, _2, _3, _4, name, ...) name #define overload3(a,b,c,name,...) name #define rep1(n) for (ll UNUSED_NUMBER = 0; UNUSED_NUMBER < (n); ++UNUSED_NUMBER) #define rep2(i, n) for (ll i = 0; i < (n); ++i) #define rep3(i, a, b) for (ll i = (a); i < (b); ++i) #define rep4(i, a, b, c) for (ll i = (a); i < (b); i += (c)) #define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__) #define rrep1(n) for(ll i = (n) - 1;i >= 0;i--) #define rrep2(i,n) for(ll i = (n) - 1;i >= 0;i--) #define rrep3(i,a,b) for(ll i = (b) - 1;i >= (a);i--) #define rrep4(i,a,b,c) for(ll i = (a) + ((b)-(a)-1) / (c) * (c);i >= (a);i -= c) #define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__) #define all1(i) begin(i) , end(i) #define all2(i,a) begin(i) , begin(i) + a #define all3(i,a,b) begin(i) + a , begin(i) + b #define all(...) overload3(__VA_ARGS__, all3, all2, all1)(__VA_ARGS__) #define sum(...) accumulate(all(__VA_ARGS__),0LL) template<class T> bool chmin(T &a, const T &b){ if(a > b){ a = b; return 1; } else return 0; } template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } else return 0; } template<class T> auto min(const T& a){return *min_element(all(a));} template<class T> auto max(const T& a){return *max_element(all(a));} template<class... Ts> void in(Ts&... t); #define INT(...) int __VA_ARGS__; in(__VA_ARGS__) #define LL(...) ll __VA_ARGS__; in(__VA_ARGS__) #define STR(...) string __VA_ARGS__; in(__VA_ARGS__) #define CHR(...) char __VA_ARGS__; in(__VA_ARGS__) #define DBL(...) double __VA_ARGS__; in(__VA_ARGS__) #define LD(...) ld __VA_ARGS__; in(__VA_ARGS__) #define VEC(type, name, size) vector<type> name(size); in(name) #define VV(type, name, h, w) vector<vector<type>> name(h, vector<type>(w)); in(name) ll intpow(ll a, ll b){ ll ans = 1; while(b){if(b & 1) ans *= a; a *= a; b /= 2;} return ans;} ll modpow(ll a, ll b, ll p){ ll ans = 1; a %= p;if(a < 0) a += p;while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; } bool is_clamp(ll val,ll low,ll high) {return low <= val && val < high;} void Yes() {cout << "Yes\n";return;} void No() {cout << "No\n";return;} void YES() {cout << "YES\n";return;} void NO() {cout << "NO\n";return;} template <typename T> T floor(T a, T b) {return a / b - (a % b && (a ^ b) < 0);} template <typename T> T ceil(T x, T y) {return floor(x + y - 1, y);} template <typename T> T bmod(T x, T y) {return x - y * floor(x, y);} template <typename T> pair<T, T> divmod(T x, T y) {T q = floor(x, y);return {q, x - q * y};} namespace IO{ #define VOID(a) decltype(void(a)) struct setting{ setting(){cin.tie(nullptr); ios::sync_with_stdio(false);fixed(cout); cout.precision(12);}} setting; template<int I> struct P : P<I-1>{}; template<> struct P<0>{}; template<class T> void i(T& t){ i(t, P<3>{}); } void i(vector<bool>::reference t, P<3>){ int a; i(a); t = a; } template<class T> auto i(T& t, P<2>) -> VOID(cin >> t){ cin >> t; } template<class T> auto i(T& t, P<1>) -> VOID(begin(t)){ for(auto&& x : t) i(x); } template<class T, size_t... idx> void ituple(T& t, index_sequence<idx...>){in(get<idx>(t)...);} template<class T> auto i(T& t, P<0>) -> VOID(tuple_size<T>{}){ituple(t, make_index_sequence<tuple_size<T>::value>{});} #undef VOID } #define unpack(a) (void)initializer_list<int>{(a, 0)...} template<class... Ts> void in(Ts&... t){ unpack(IO :: i(t)); } #undef unpack constexpr long double PI = 3.141592653589793238462643383279L; template <class F> struct REC { F f; REC(F &&f_) : f(forward<F>(f_)) {} template <class... Args> auto operator()(Args &&...args) const { return f(*this, forward<Args>(args)...); }}; constexpr int mod = 998244353; //constexpr int mod = 1000000007; #line 2 "library/segtree/segtree.hpp" template <typename T, typename OP> struct segtree { int N; int size; vector<T> seg; const OP op; const T I; segtree(OP _op, const T &I_) : N(0), size(0), op(_op), I(I_) {} segtree(int _N, OP _op, const T &I_) : op(_op), I(I_) { init(_N); } segtree(const vector<T> &v, OP _op, T I_) : op(_op), I(I_) { init(v.size()); for (int i = 0; i < (int)v.size(); i++) { seg[i + size] = v[i]; } build(); } void init(int _N) { N = _N; size = 1; while (size < N) size <<= 1; seg.assign(2 * size, I); } void build() { for (int k = size - 1; k > 0; k--) { seg[k] = op(seg[2 * k], seg[2 * k + 1]); } } void set(int p, T x) { assert(0 <= p && p < N); p += size; seg[p] = x; while (p >>= 1) { seg[p] = op(seg[2 * p], seg[2 * p + 1]); } } void add(int p, T x) { assert(0 <= p && p < N); p += size; seg[p] += x; while (p >>= 1) { seg[p] = op(seg[2 * p], seg[2 * p + 1]); } } T get(int p) const { assert(0 <= p && p < N); return seg[p + size]; } // query to [l, r) T prod(int l, int r) { assert(0 <= l && l <= r && r <= N); T L = I, R = I; for (l += size, r += size; l < r; l >>= 1, r >>= 1) { if (l & 1) L = op(L, seg[l++]); if (r & 1) R = op(seg[--r], R); } return op(L, R); } T all_prod() {return seg[1];} // check(a[l] * ... * a[r-1]) が true となる最大の r // (右端まですべて true なら N を返す) template <class C> int max_right(int l, C check) { assert(0 <= l && l <= N); assert(check(I) == true); if (l == N) return N; l += size; T sm = I; do { while (l % 2 == 0) l >>= 1; if (!check(op(sm, seg[l]))) { while (l < size) { l = (2 * l); if (check(op(sm, seg[l]))) { sm = op(sm, seg[l]); l++; } } return l - size; } sm = op(sm, seg[l]); l++; } while ((l & -l) != l); return N; } // check(a[l] * ... * a[r-1]) が true となる最小の l // (左端まで true なら 0 を返す) template <typename C> int min_left(int r, C check) { assert(0 <= r && r <= N); assert(check(I) == true); if (r == 0) return 0; r += size; T sm = I; do { r--; while (r > 1 && (r % 2)) r >>= 1; if (!check(op(seg[r], sm))) { while (r < size) { r = (2 * r + 1); if (check(op(seg[r], sm))) { sm = op(seg[r], sm); r--; } } return r + 1 - size; } sm = op(seg[r], sm); } while ((r & -r) != r); return 0; } }; #line 100 "test.cpp" using T = ll; T op(T x,T y) {return max(x,y);} T e() {return 0;} int main() { INT(n,s,h); vl x,y,z; rep(i,n) { INT(X,Y,Z); if(Y - X > s) continue; x.emplace_back(X); y.emplace_back(Y); z.emplace_back(Z); } n = x.size(); x.emplace_back(1e18); segtree<ll,decltype(&op)> seg(n+1,op,e()); rep(i,n) { int id = lower_bound(all(x),y[i] - s) - x.begin(); int id2 = lower_bound(all(x),y[i] + h) - x.begin(); ll ma = seg.prod(id,i+1) + z[i]; seg.set(id2,max(seg.get(id2),ma)); seg.set(i+1,max(seg.get(i+1),seg.get(i))); } cout << seg.get(n) << '\n'; }