Submission #66379
ソースコード
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 | #pragma GCC optimize("Ofast") #include "bits/stdc++.h" // Begin Header {{{ #pragma region using namespace std; #ifndef DEBUG #define dump(...) #endif #define all(x) begin(x), end(x) #define rall(x) rbegin(x), rend(x) #define rep(i, b, e) for (intmax_t i = (b), i##_limit = (e); i < i##_limit; ++i) #define repc(i, b, e) for (intmax_t i = (b), i##_limit = (e); i <= i##_limit; ++i) #define repr(i, b, e) for (intmax_t i = (b), i##_limit = (e); i >= i##_limit; --i) #define var(Type, ...) Type __VA_ARGS__; input(__VA_ARGS__) #define let const auto constexpr size_t operator "" _zu(unsigned long long value) { return value; }; constexpr intmax_t operator "" _jd(unsigned long long value) { return value; }; constexpr uintmax_t operator "" _ju(unsigned long long value) { return value; }; constexpr int INF = 0x3f3f3f3f; constexpr intmax_t LINF = 0x3f3f3f3f3f3f3f3f_jd; using usize = size_t ; using imax = intmax_t; using uimax = uintmax_t; using ld = long double ; template < class T, class Compare = less<>> using MaxHeap = priority_queue<T, vector<T>, Compare>; template < class T, class Compare = greater<>> using MinHeap = priority_queue<T, vector<T>, Compare>; inline void input() {} template < class Head, class ... Tail> inline void input(Head&& head, Tail&&... tail) { cin >> head; input(forward<Tail>(tail)...); } template < class Container, class Value = typename Container::value_type, enable_if_t<!is_same<Container, string>::value, nullptr_t> = nullptr> inline istream& operator>>(istream &is, Container &vs) { for (auto &v: vs) is >> v; return is; } template < class T, class U> inline istream& operator>>(istream &is, pair<T, U> &p) { is >> p.first >> p.second; return is; } inline void output() { cout << "\n" ; } template < class Head, class ... Tail> inline void output(Head&& head, Tail&&... tail) { cout << head; if ( sizeof ...(tail)) cout << " " ; output(forward<Tail>(tail)...); } template < class Container, class Value = typename Container::value_type, enable_if_t<!is_same<Container, string>::value, nullptr_t> = nullptr> inline ostream& operator<<(ostream &os, const Container &vs) { static constexpr const char *delim[] = { " " , "" }; for (auto it = begin(vs); it != end(vs); ++it) { os << delim[it == begin(vs)] << *it; } return os; } template < class Iterator> inline void join( const Iterator &Begin, const Iterator &End, const string &delim = "\n" , const string &last = "\n" ) { for (auto it = Begin; it != End; ++it) { cout << ((it == Begin) ? "" : delim) << *it; } cout << last; } template < class T> inline vector<T> makeVector( const T &init_value, size_t sz) { return vector<T>(sz, init_value); } template < class T, class ... Args> inline auto makeVector( const T &init_value, size_t sz, Args... args) { return vector<decltype(makeVector<T>(init_value, args...))>(sz, makeVector<T>(init_value, args...)); } template < class Func> class FixPoint : Func { public : explicit constexpr FixPoint(Func&& f) noexcept : Func(forward<Func>(f)) {} template < class ... Args> constexpr decltype(auto) operator()(Args&&... args) const { return Func::operator()(* this , std::forward<Args>(args)...); } }; template < class Func> static inline constexpr decltype(auto) makeFixPoint(Func&& f) noexcept { return FixPoint<Func>{forward<Func>(f)}; } template < class Container> struct reverse_t { Container &c; reverse_t(Container &c) : c(c) {} auto begin() { return c.rbegin(); } auto end() { return c.rend(); } }; template < class Container> auto reversed(Container &c) { return reverse_t<Container>(c); } template < class T> inline bool chmax(T &a, const T &b) noexcept { return b > a && (a = b, true ); } template < class T> inline bool chmin(T &a, const T &b) noexcept { return b < a && (a = b, true ); } template < class T> inline T diff( const T &a, const T &b) noexcept { return a < b ? b - a : a - b; } void operator|=(vector< bool >::reference lhs, const bool rhs) { lhs = lhs | rhs; } void operator&=(vector< bool >::reference lhs, const bool rhs) { lhs = lhs & rhs; } void operator^=(vector< bool >::reference lhs, const bool rhs) { lhs = lhs ^ rhs; } void ioinit() { ios_base::sync_with_stdio( false ); cin.tie(nullptr); cout << fixed << setprecision(10); cerr << fixed << setprecision(10); clog << fixed << setprecision(10); } #pragma endregion // }}} End Header const auto ceildiv = [](intmax_t n, intmax_t d) { return (n + d - 1) / d; }; signed main() { ioinit(); var(imax, N, M, K); var(imax, P); vector<imax> ls(P), rs(P), cs(P); rep(i, 0, P) { input(ls[i], rs[i], cs[i]); } using Tp = array<imax, 3>; vector<Tp> ranges; // (l, r, c) if (ls.front() != 1) ranges.emplace_back(Tp{1, ls.front() - 1, M}); rep(i, 0, P) { if (i > 0 && ls[i] != rs[i - 1] + 1) { ranges.emplace_back(Tp{rs[i - 1] + 1, ls[i] - 1, M}); } ranges.emplace_back(Tp{ls[i], rs[i], cs[i]}); } if (rs.back() != N) ranges.emplace_back(Tp{rs.back() + 1, N, M}); let solve = [&](auto vs) { const int R = ranges.size(); imax r = 0; imax sum = 0, days = 0, res = LINF; rep(l, 0, R) { while (r < R && sum < K) { imax len = vs[r][1] - vs[r][0] + 1; sum += vs[r][2] * len; days += len; r++; } if (sum < K) break ; imax len = vs[r - 1][1] - vs[r - 1][0] + 1; sum -= vs[r - 1][2] * len; days -= len; imax rest = K - sum; chmin(res, days + ceildiv(rest, vs[r - 1][2])); dump(l, r, sum, days, res); sum += vs[r - 1][2] * len; days += len; len = vs[l][1] - vs[l][0] + 1; sum -= vs[l][2] * len; days -= len; if (l == r) { assert ( false ); r++; } } return res; }; imax res = LINF; for (let [l, r, c]: ranges) dump(l, r, c); chmin(res, solve(ranges)); reverse(all(ranges)); for (auto&& [l, r, c]: ranges) { swap(l, r); l = N - l + 1; r = N - r + 1; } for (let [l, r, c]: ranges) dump(l, r, c); chmin(res, solve(ranges)); output(res); return 0; } |
ステータス
項目 | データ |
---|---|
問題 | 1493 - Sand of Star |
ユーザー名 | syoribu |
投稿日時 | 2021-05-03 00:02:17 |
言語 | C++17 |
状態 | Accepted |
得点 | 500 |
ソースコード長 | 6625 Byte |
最大実行時間 | 51 ms |
最大メモリ使用量 | 13056 KB |
セット
セット | 得点 | Cases | |
---|---|---|---|
1 | ALL | 500 / 500 | * |
テストケース
ファイル名 | 状態 | 実行時間 | メモリ使用量 | # |
---|---|---|---|---|
hand_made01.txt | AC | 20 ms | 604 KB |
1
|
hand_made02.txt | AC | 31 ms | 428 KB |
1
|
hand_made03.txt | AC | 48 ms | 12400 KB |
1
|
hand_made04.txt | AC | 16 ms | 524 KB |
1
|
hand_made05.txt | AC | 26 ms | 608 KB |
1
|
in01.txt | AC | 41 ms | 7080 KB |
1
|
in02.txt | AC | 49 ms | 11400 KB |
1
|
in03.txt | AC | 37 ms | 5172 KB |
1
|
in04.txt | AC | 49 ms | 10616 KB |
1
|
in05.txt | AC | 32 ms | 5180 KB |
1
|
in06.txt | AC | 39 ms | 6644 KB |
1
|
in07.txt | AC | 42 ms | 6236 KB |
1
|
in08.txt | AC | 48 ms | 11480 KB |
1
|
in09.txt | AC | 25 ms | 3732 KB |
1
|
in10.txt | AC | 41 ms | 9124 KB |
1
|
in11.txt | AC | 25 ms | 1124 KB |
1
|
in12.txt | AC | 30 ms | 2308 KB |
1
|
in13.txt | AC | 28 ms | 4364 KB |
1
|
in14.txt | AC | 50 ms | 10744 KB |
1
|
in15.txt | AC | 43 ms | 10220 KB |
1
|
in16.txt | AC | 28 ms | 3756 KB |
1
|
in17.txt | AC | 47 ms | 7280 KB |
1
|
in18.txt | AC | 40 ms | 10360 KB |
1
|
in19.txt | AC | 24 ms | 2300 KB |
1
|
in20.txt | AC | 37 ms | 8396 KB |
1
|
in21.txt | AC | 38 ms | 4272 KB |
1
|
in22.txt | AC | 50 ms | 13056 KB |
1
|
in23.txt | AC | 31 ms | 2032 KB |
1
|
in24.txt | AC | 33 ms | 6040 KB |
1
|
in25.txt | AC | 39 ms | 6456 KB |
1
|
in26.txt | AC | 45 ms | 9136 KB |
1
|
in27.txt | AC | 49 ms | 10488 KB |
1
|
in28.txt | AC | 26 ms | 3388 KB |
1
|
in29.txt | AC | 51 ms | 9440 KB |
1
|
in30.txt | AC | 41 ms | 11252 KB |
1
|
sample01.txt | AC | 21 ms | 588 KB |
1
|
sample02.txt | AC | 31 ms | 800 KB |
1
|