結果
問題 | No.2808 Concentration |
ユーザー | penguin8331 |
提出日時 | 2024-06-30 19:43:17 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,805 bytes |
コンパイル時間 | 2,701 ms |
コンパイル使用メモリ | 253,968 KB |
実行使用メモリ | 8,064 KB |
最終ジャッジ日時 | 2024-07-08 17:50:57 |
合計ジャッジ時間 | 7,777 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 1 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | 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 | AC | 2 ms
5,376 KB |
ソースコード
#line 2 "library/template/template.hpp" #include <bits/stdc++.h> #line 3 "library/template/macro.hpp" #define all(x) std::begin(x), std::end(x) #define rall(x) std::rbegin(x), std::rend(x) #define elif else if #define updiv(N, X) (((N) + (X) - (1)) / (X)) #define sigma(a, b) ((a + b) * (b - a + 1) / 2) #define INT(...) \ int __VA_ARGS__; \ scan(__VA_ARGS__) #define LL(...) \ ll __VA_ARGS__; \ scan(__VA_ARGS__) #define STR(...) \ string __VA_ARGS__; \ scan(__VA_ARGS__) #define CHR(...) \ char __VA_ARGS__; \ scan(__VA_ARGS__) #define DOU(...) \ double __VA_ARGS__; \ scan(__VA_ARGS__) #define LD(...) \ ld __VA_ARGS__; \ scan(__VA_ARGS__) #define pb push_back #define eb emplace_back #line 3 "library/template/alias.hpp" using ll = long long; using ld = long double; using pii = std::pair<int, int>; using pll = std::pair<ll, ll>; constexpr int inf = 1 << 30; constexpr ll INF = 1LL << 60; constexpr int dx[8] = {1, 0, -1, 0, 1, -1, 1, -1}; constexpr int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1}; constexpr int mod = 998244353; constexpr int MOD = 1e9 + 7; #line 3 "library/template/func.hpp" template <typename T> inline bool chmax(T& a, T b) { return ((a < b) ? (a = b, true) : (false)); } template <typename T> inline bool chmin(T& a, T b) { return ((a > b) ? (a = b, true) : (false)); } template <typename T, typename U> std::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) { os << p.first << " " << p.second; return os; } template <typename T, typename U> std::istream &operator>>(std::istream &is, std::pair<T, U> &p) { is >> p.first >> p.second; return is; } template <typename T> std::ostream &operator<<(std::ostream &os, const std::vector<T> &v) { for (auto it = std::begin(v); it != std::end(v);) { os << *it << ((++it) != std::end(v) ? " " : ""); } return os; } template <typename T> std::istream &operator>>(std::istream &is, std::vector<T> &v) { for (T &in : v) { is >> in; } return is; } inline void scan() {} template <class Head, class... Tail> inline void scan(Head &head, Tail &...tail) { std::cin >> head; scan(tail...); } template <class T> inline void print(const T &t) { std::cout << t << '\n'; } template <class Head, class... Tail> inline void print(const Head &head, const Tail &...tail) { std::cout << head << ' '; print(tail...); } template <class... T> inline void fin(const T &...a) { print(a...); exit(0); } #line 3 "library/template/util.hpp" struct IOSetup { IOSetup() { std::cin.tie(nullptr); std::ios::sync_with_stdio(false); std::cout.tie(0); std::cout << std::fixed << std::setprecision(12); std::cerr << std::fixed << std::setprecision(12); } } IOSetup; #line 3 "library/template/debug.hpp" #ifdef LOCAL #include <debug.hpp> #else #define debug(...) #endif #line 8 "library/template/template.hpp" using namespace std; #line 2 "A.cpp" int main() { INT(N, S, H); vector<tuple<int, int, ll>> A(N); for (int i = 0; i < N; i++) { INT(st, en); LL(val); A[i] = {st, en, val}; } // dp[i] := i 番目の授業が終わったときの知識の総和の最大値 vector<ll> dp(N + 1, 0); for (int i = 0; i < N; i++) { int st, en; ll val; tie(st, en, val) = A[i]; int last = lower_bound(all(A), tuple<int, int, ll>{0, st - H, 0LL}, [](tuple<int, int, ll> a, tuple<int, int, ll> b) { return get<1>(a) <= get<1>(b); }) - A.begin(); dp[i + 1] = dp[i]; if (en - st <= S) { chmax(dp[i + 1], dp[last] + val); } } print(dp[N]); }