Submission #66794

ソースコード

?
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
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
#pragma GCC optimize "Ofast"
#include "bits/stdc++.h"
// Begin Header {{{
#pragma region
using namespace std;
using usize = size_t;
using imax = intmax_t;
using uimax = uintmax_t;
using ld = long double;
#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;
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 ioinit() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(10);
clog << fixed << setprecision(10);
}
#pragma endregion
// }}} End Header
// ModInt {{{
template <intmax_t Modulo>
class ModInt {
public:
using value_type = intmax_t;
private:
static constexpr value_type cmod = Modulo; // compile-time
static value_type rmod; // runtime
value_type value = 0;
static constexpr value_type inverse(value_type n, value_type m) {
value_type a = n;
value_type b = m;
value_type x = 0;
value_type y = 1;
for (value_type u = y, v = x; a;) {
const value_type t = b / a;
swap(x -= t * u, u);
swap(y -= t * v, v);
swap(b -= t * a, a);
}
if ((x %= m) < 0) x += m;
return x;
}
static value_type normalize(intmax_t n, value_type m) {
if (n >= m) {
n %= m;
} else if (n < 0) {
if ((n %= m) < 0) n += m;
}
return n;
}
public:
ModInt() = default;
ModInt(intmax_t n) : value(normalize(n, getModulo())) {}
template <typename T>
constexpr explicit operator T() const { return static_cast<T>(value); }
ModInt& operator=(intmax_t n) {
value = normalize(n, getModulo());
return *this;
}
ModInt& operator+=(const ModInt& other) {
if ((value += other.value) >= getModulo()) value -= getModulo();
return *this;
}
ModInt& operator-=(const ModInt& other) {
if ((value -= other.value) < 0) value += getModulo();
return *this;
}
ModInt& operator*=(const ModInt& other) {
value = (value * other.value) % getModulo();
return *this;
}
ModInt& operator/=(const ModInt& other) {
value = (value * inverse(other.value, getModulo())) % getModulo();
return *this;
}
ModInt& operator++() {
if (++value == getModulo()) value = 0;
return *this;
}
ModInt& operator--() {
if (value-- == 0) value = getModulo() - 1;
return *this;
}
ModInt operator++(int) {
const ModInt tmp(*this);
++*this;
return tmp;
}
ModInt operator--(int) {
const ModInt tmp(*this);
--*this;
return tmp;
}
friend ModInt operator+(ModInt lhs, const ModInt& rhs) { return lhs += rhs; }
friend ModInt operator-(ModInt lhs, const ModInt& rhs) { return lhs -= rhs; }
friend ModInt operator*(ModInt lhs, const ModInt& rhs) { return lhs *= rhs; }
friend ModInt operator/(ModInt lhs, const ModInt& rhs) { return lhs /= rhs; }
ModInt operator+() const { return *this; }
ModInt operator-() const {
if (value == 0) return *this;
return ModInt(getModulo() - value);
}
friend bool operator==(const ModInt& lhs, const ModInt& rhs) {
return lhs.value == rhs.value;
}
friend bool operator!=(const ModInt& lhs, const ModInt& rhs) {
return !(lhs == rhs);
}
friend ostream& operator<<(ostream& os, const ModInt& n) {
return os << n.value;
}
friend istream& operator>>(istream& is, ModInt& n) {
is >> n.value;
n.value = normalize(n.value, getModulo());
return is;
}
static value_type getModulo() { return ((cmod > 0) ? cmod : rmod); }
template <int M = Modulo, typename T = typename enable_if<(M <= 0)>::type>
static T setModulo(value_type m) { rmod = m; }
};
template <intmax_t M>
constexpr typename ModInt<M>::value_type ModInt<M>::cmod;
template <intmax_t M>
typename ModInt<M>::value_type ModInt<M>::rmod;
// }}}
// constexpr intmax_t MOD = intmax_t(1e9) + 7;
// constexpr intmax_t MOD = 998244353;
// using Mint = ModInt<MOD>;
// 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);
}
};
// }}}
class EratosthenesSieve {
private:
imax n;
vector<imax> min_prime;
public:
EratosthenesSieve(imax n) : n(n) {
min_prime.resize(n);
iota(all(min_prime), 0);
for (imax i = 2; i * i < n; ++i) {
if (min_prime[i] < i) continue;
for (imax j = 2 * i; j < n; j += i) {
chmin(min_prime[j], i);
}
}
}
auto prime_factor(imax m) {
map<imax, imax> res;
while (m > 1) {
imax p = min_prime[m];
res[p]++;
m /= p;
}
return res;
}
};
template <class T>
T power(const T& b, const intmax_t& e) {
T ret = 1;
T n = b;
for (intmax_t p = abs(e); p > 0; p >>= 1) {
if (p & 1) ret *= n;
n *= n;
}
if (e < 0) return T(1) / ret;
return ret;
}
template <class T>
T power(const T& b, const string& e) {
T ret = 1;
for (const char& c: e) {
ret = power(ret, 10) * power(b, c - '0');
}
return ret;
}
signed main() {
ioinit();
var(int, N, Q);
vector<imax> as(N);
input(as);
let f = [](auto a, auto b) { return gcd(a, b); };
SegmentTree<imax, decltype(f)> sg(N, 0, f);
rep(i, 0, N) sg.set(i, as[i]);
sg.build();
EratosthenesSieve sieve(1e6 + 1);
while (Q--) {
var(imax, t, x, y);
x--;
if (t == 1) {
sg.update(x, y);
} else {
imax g = sg.fold(x, y);
imax res = 1;
for (let [p, c]: sieve.prime_factor(g)) {
res *= (power<imax>(p, c + 1) - 1) / (p - 1);
}
output(res);
}
}
return 0;
}

ステータス

項目 データ
問題 1516 - 『公約数』総和企画
ユーザー名 もけ
投稿日時 2021-06-01 15:27:02
言語 C++17
状態 Accepted
得点 5
ソースコード長 11146 Byte
最大実行時間 163 ms
最大メモリ使用量 24904 KB

セット

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

テストケース

ファイル名 状態 実行時間 メモリ使用量 #
in01.txt AC 81 ms 14172 KB
1
in02.txt AC 49 ms 13836 KB
1
in03.txt AC 121 ms 13632 KB
1
in04.txt AC 100 ms 13888 KB
1
in05.txt AC 131 ms 14072 KB
1
in06.txt AC 70 ms 14164 KB
1
in07.txt AC 119 ms 14716 KB
1
in08.txt AC 103 ms 10044 KB
1
in09.txt AC 88 ms 12288 KB
1
in10.txt AC 61 ms 14684 KB
1
in11.txt AC 48 ms 10872 KB
1
in12.txt AC 67 ms 10404 KB
1
in13.txt AC 110 ms 12712 KB
1
in14.txt AC 67 ms 13224 KB
1
in15.txt AC 56 ms 15484 KB
1
in16.txt AC 49 ms 13252 KB
1
in17.txt AC 80 ms 10756 KB
1
in18.txt AC 48 ms 11040 KB
1
in19.txt AC 140 ms 17024 KB
1
in20.txt AC 136 ms 17316 KB
1
in21.txt AC 163 ms 18764 KB
1
in22.txt AC 130 ms 19696 KB
1
in23.txt AC 140 ms 20372 KB
1
in24.txt AC 130 ms 21180 KB
1
in25.txt AC 119 ms 21984 KB
1
in26.txt AC 131 ms 22780 KB
1
in27.txt AC 115 ms 23460 KB
1
in28.txt AC 131 ms 24904 KB
1
sample.txt AC 23 ms 19180 KB
1