結果
問題 | No.1826 Fruits Collecting |
ユーザー | fastmath |
提出日時 | 2022-01-28 22:19:04 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 172 ms / 2,000 ms |
コード長 | 3,748 bytes |
コンパイル時間 | 1,509 ms |
コンパイル使用メモリ | 146,844 KB |
実行使用メモリ | 12,776 KB |
最終ジャッジ日時 | 2023-08-28 20:23:04 |
合計ジャッジ時間 | 7,027 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 3 ms
9,020 KB |
testcase_01 | AC | 3 ms
9,236 KB |
testcase_02 | AC | 3 ms
9,044 KB |
testcase_03 | AC | 4 ms
9,028 KB |
testcase_04 | AC | 3 ms
9,036 KB |
testcase_05 | AC | 66 ms
10,556 KB |
testcase_06 | AC | 111 ms
11,192 KB |
testcase_07 | AC | 78 ms
10,680 KB |
testcase_08 | AC | 10 ms
9,160 KB |
testcase_09 | AC | 109 ms
11,356 KB |
testcase_10 | AC | 74 ms
10,844 KB |
testcase_11 | AC | 71 ms
10,740 KB |
testcase_12 | AC | 29 ms
9,912 KB |
testcase_13 | AC | 15 ms
9,272 KB |
testcase_14 | AC | 23 ms
9,684 KB |
testcase_15 | AC | 170 ms
12,516 KB |
testcase_16 | AC | 171 ms
12,516 KB |
testcase_17 | AC | 171 ms
12,672 KB |
testcase_18 | AC | 171 ms
12,520 KB |
testcase_19 | AC | 172 ms
12,488 KB |
testcase_20 | AC | 171 ms
12,732 KB |
testcase_21 | AC | 171 ms
12,776 KB |
testcase_22 | AC | 170 ms
12,664 KB |
testcase_23 | AC | 170 ms
12,512 KB |
testcase_24 | AC | 170 ms
12,584 KB |
testcase_25 | AC | 3 ms
8,948 KB |
testcase_26 | AC | 3 ms
9,004 KB |
testcase_27 | AC | 3 ms
9,060 KB |
testcase_28 | AC | 3 ms
8,952 KB |
testcase_29 | AC | 3 ms
8,932 KB |
testcase_30 | AC | 36 ms
9,824 KB |
testcase_31 | AC | 71 ms
10,684 KB |
testcase_32 | AC | 36 ms
9,788 KB |
testcase_33 | AC | 120 ms
11,452 KB |
testcase_34 | AC | 100 ms
11,092 KB |
testcase_35 | AC | 24 ms
9,420 KB |
testcase_36 | AC | 118 ms
11,188 KB |
testcase_37 | AC | 71 ms
11,100 KB |
testcase_38 | AC | 50 ms
10,572 KB |
testcase_39 | AC | 68 ms
11,300 KB |
testcase_40 | AC | 86 ms
12,132 KB |
testcase_41 | AC | 21 ms
9,684 KB |
testcase_42 | AC | 6 ms
9,156 KB |
testcase_43 | AC | 3 ms
8,948 KB |
testcase_44 | AC | 2 ms
8,944 KB |
testcase_45 | AC | 3 ms
9,124 KB |
ソースコード
#include <iostream> #include <cstdio> #include <cstdlib> #include <algorithm> #include <cmath> #include <vector> #include <set> #include <map> #include <unordered_set> #include <unordered_map> #include <queue> #include <ctime> #include <cassert> #include <complex> #include <string> #include <cstring> #include <chrono> #include <random> #include <bitset> #include <fstream> #include <array> #include <functional> #include <stack> #include <memory> using namespace std; #define int long long #define ii pair <int, int> #define app push_back #define all(a) a.begin(), a.end() #define bp __builtin_popcountll #define ll long long #define mp make_pair #define x first #define y second #define Time (double)clock()/CLOCKS_PER_SEC #ifdef LOCAL #define debug(x) std::cerr << #x << ": " << x << '\n'; #else #define debug(x) #endif #define FORI(i,a,b) for (int i = (a); i < (b); ++i) #define FOR(i,a) FORI(i,0,a) #define ROFI(i,a,b) for (int i = (b)-1; i >= (a); --i) #define ROF(i,a) ROFI(i,0,a) #define rep(a) FOR(_,a) #define each(a,x) for (auto& a: x) #define FORN(i, n) FORI(i, 1, n + 1) using vi = vector<int>; template <typename T> std::istream& operator >>(std::istream& input, std::pair <T, T> & data) { input >> data.x >> data.y; return input; } template <typename T> std::istream& operator >>(std::istream& input, std::vector<T>& data) { for (T& x : data) input >> x; return input; } template <typename T> std::ostream& operator <<(std::ostream& output, const pair <T, T> & data) { output << "(" << data.x << "," << data.y << ")"; return output; } template <typename T> std::ostream& operator <<(std::ostream& output, const std::vector<T>& data) { for (const T& x : data) output << x << " "; return output; } std::ostream& operator <<(std::ostream& output, const __int128 &x) { __int128 n = x; if (n == 0) { output << "0"; return output; } if (n < 0) { n = -n; output << "-"; } string s; while (n) { s += '0' + (n%10); n /= 10; } reverse(all(s)); cout << s; return output; } ll div_up(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up ll div_down(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down ll math_mod(ll a, ll b) { return a - b * div_down(a, b); } #define tcT template<class T #define tcTU tcT, class U tcT> using V = vector<T>; tcT> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; } // set a = min(a,b) tcT> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; } ll gcd(ll a, ll b) { while (b) { tie(a, b) = mp(b, a % b); } return a; } int Bit(int mask, int bit) { return (mask >> bit) & 1; } const int N = 2e5+7; int n, t[N], x[N], v[N]; struct Fen { int f[N]; void clear() { for (int i = 0; i < N; ++i) f[i] = -1e18; } void add(int i, int x) { for (; i < N; i |= i + 1) ckmax(f[i], x); } int get(int i) { int ans = 0; for (; i >= 0; i &= i + 1, --i) ckmax(ans, f[i]); return ans; } } f; signed main() { #ifdef LOCAL #else #define endl '\n' ios_base::sync_with_stdio(0); cin.tie(0); #endif vi c; cin >> n; FOR (i, n) { cin >> t[i] >> x[i] >> v[i]; c.app(t[i] - x[i]); } vi ord(n); FOR (i, n) ord[i] = i; auto comp = [&] (int i, int j) { return mp(t[i] + x[i], t[i] - x[i]) < mp(t[j] + x[j], t[j] - x[j]); }; sort(all(ord), comp); sort(all(c)); f.clear(); each (i, ord) { int p = lower_bound(all(c), t[i] - x[i]) - c.begin(); if (abs(x[i]) <= t[i]) { f.add(p, max(v[i], f.get(p) + v[i])); } } cout << f.get(N - 1) << endl; }