Submission #64758

ソースコード

?
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
#pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
// Begin Header {{{
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__)
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;
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;
}
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 ioinit() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
clog << fixed << setprecision(10);
}
// }}} End Header
// SegmentTree {{{
template <typename Monoid, typename Func>
struct SegmentTree {
const size_t sz;
const Func fn;
const Monoid unity;
vector<Monoid> seg;
SegmentTree(const size_t n, const Monoid &u, Func f)
: sz(1 << (__lg(n + 5) + 1)), fn(f), unity(u), seg(sz * 2, unity) {}
void set(size_t k, const Monoid &v) {
seg[k + sz] = v;
}
Monoid& operator[](size_t k) {
return seg[k + sz];
}
const Monoid& operator[](size_t k) const {
return seg[k + sz];
}
void build() {
for (size_t k = sz - 1; k > 0; --k) {
seg[k] = fn(seg[2 * k], seg[2 * k + 1]);
}
}
void update(size_t k, const Monoid &x) {
k += sz;
seg[k] = x;
while (k >>= 1) {
seg[k] = fn(seg[2 * k], seg[2 * k + 1]);
}
}
Monoid fold(size_t l, size_t r) const {
Monoid L = unity;
Monoid R = unity;
for (l += sz, r += sz; l < r; l >>= 1, r >>= 1) {
if (l & 1) {
L = fn(L, seg[l++]);
}
if (r & 1) {
R = fn(seg[--r], R);
}
}
return fn(L, R);
}
};
// }}}
int main() {
ioinit();
var(size_t, H, W, N);
vector<tuple<int, int, intmax_t>> vs(N);
for (auto& [y, x, p]: vs) input(y, x, p), y--, x--;
sort(all(vs));
const auto f = [](auto a, auto b) { return max(a, b); };
SegmentTree<intmax_t, decltype(f)> sg(W, 0, f);
for (const auto [y, x, p]: vs) {
sg.update(x, sg.fold(0, x + 1) + p);
}
output(sg.fold(0, W));
return 0;
}

ステータス

項目 データ
問題 1436 - Simple Grid Problem
ユーザー名 もけ
投稿日時 2020-11-16 21:04:03
言語 C++17
状態 Accepted
得点 6
ソースコード長 5827 Byte
最大実行時間 92 ms
最大メモリ使用量 7956 KB

セット

セット 得点 Cases
1 ALL 6 / 6 *

テストケース

ファイル名 状態 実行時間 メモリ使用量 #
in01.txt AC 74 ms 3416 KB
1
in02.txt AC 42 ms 1700 KB
1
in03.txt AC 50 ms 2536 KB
1
in04.txt AC 69 ms 6992 KB
1
in05.txt AC 23 ms 4708 KB
1
in06.txt AC 84 ms 7820 KB
1
in07.txt AC 81 ms 7840 KB
1
in08.txt AC 83 ms 7728 KB
1
in09.txt AC 85 ms 7624 KB
1
in10.txt AC 92 ms 7768 KB
1
in11.txt AC 87 ms 7660 KB
1
in12.txt AC 85 ms 7680 KB
1
in13.txt AC 80 ms 7700 KB
1
in14.txt AC 81 ms 7596 KB
1
in15.txt AC 24 ms 4548 KB
1
in16.txt AC 18 ms 4756 KB
1
in17.txt AC 20 ms 4712 KB
1
in18.txt AC 79 ms 3772 KB
1
in19.txt AC 78 ms 3788 KB
1
in20.txt AC 71 ms 3800 KB
1
in21.txt AC 69 ms 3812 KB
1
in22.txt AC 88 ms 7928 KB
1
in23.txt AC 82 ms 7948 KB
1
in24.txt AC 83 ms 7840 KB
1
in25.txt AC 79 ms 7856 KB
1
in26.txt AC 81 ms 7872 KB
1
in27.txt AC 90 ms 7884 KB
1
in28.txt AC 79 ms 7908 KB
1
in29.txt AC 84 ms 7928 KB
1
in30.txt AC 69 ms 7820 KB
1
in31.txt AC 36 ms 5280 KB
1
in32.txt AC 65 ms 3392 KB
1
in33.txt AC 67 ms 3808 KB
1
in34.txt AC 19 ms 496 KB
1
in35.txt AC 85 ms 7880 KB
1
in36.txt AC 86 ms 7904 KB
1
in37.txt AC 78 ms 7920 KB
1
in38.txt AC 24 ms 772 KB
1
in39.txt AC 19 ms 596 KB
1
in40.txt AC 23 ms 680 KB
1
in41.txt AC 75 ms 7936 KB
1
in42.txt AC 83 ms 7956 KB
1
sample01.txt AC 20 ms 680 KB
1
sample02.txt AC 22 ms 636 KB
1