#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = long double; // or double, if TL is tight
using str = string; // yay python!
// pairs
using pii = pair<int, int> ;
using pl = pair<ll, ll> ;
using pd = pair<db, db> ;
#define mp make_pair
#define f first
#define s second
#define tcT template < class T
#define tcTU tcT, class U
// ^ lol this makes everything look weird but I'll try it
tcT > using V = vector<T> ;
tcT, size_t SZ > using AR = array<T, SZ> ;
using vi = V<int> ;
using vb = V<bool> ;
using vl = V<ll> ;
using vd = V<db> ;
using vs = V<str> ;
using vpi = V<pii> ;
using vpl = V<pl> ;
using vpd = V<pd> ;
// vectors
// oops size(x), rbegin(x), rend(x) need C++17
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend()
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()
#define lb lower_bound
#define ub upper_bound
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b) - 1; i >= (a); --i)
#define R0F(i, a) ROF(i, 0, a)
#define rep(a) F0R(_, a)
#define each(a, x) for (auto &a: x)
const int MOD = 998244353;
const int MX = 2e5 + 5;
const ll BIG = 1e18; // not too close to LLONG_MAX
const db PI = acos((db) - 1);
const int dx[4]
{
1, 0, -1, 0
}, dy[4]
{
0, 1, 0, -1
}; // for every grid problem!!
mt19937 rng((uint32_t) chrono::steady_clock::now().time_since_epoch().count());
template < class T > using pqg = priority_queue<T, vector < T>, greater < T>> ;
struct DSU
{
vi e;
void init(int N)
{
e = vi(N, -1);
}
int get(int x)
{
return e[x] < 0 ? x : e[x] = get(e[x]);
}
bool sameSet(int a, int b)
{
return get(a) == get(b);
}
int size(int x)
{
return -e[get(x)];
}
bool unite(int x, int y)
{
// union by size
x = get(x), y = get(y);
if (x == y) return 0;
if (e[x] > e[y]) swap(x, y);
e[x] += e[y];
e[y] = x;
return 1;
}
};
/*
inline namespace Helpers {
//////////// is_iterable
// https://stackoverflow.com/questions/13830158/check-if-a-variable-type-is-iterable
// this gets used only when we can call begin() and end() on that type
tcT, class = void > struct is_iterable : false_type {};
tcT > struct is_iterable<T, void_t<decltype(begin(declval < T>())),
decltype(end(declval < T>()))
>
> : true_type {};
tcT > constexpr bool is_iterable_v = is_iterable<T>::value;
//////////// is_readable
tcT, class = void > struct is_readable : false_type {};
tcT > struct is_readable<T,
typename std::enable_if_t<
is_same_v < decltype(cin >> declval<T&>()), istream&>
>
> : true_type {};
tcT > constexpr bool is_readable_v = is_readable<T>::value;
//////////// is_printable
// // https://nafe.es/posts/2020-02-29-is-printable/
tcT, class = void > struct is_printable : false_type {};
tcT > struct is_printable<T,
typename std::enable_if_t<
is_same_v < decltype(cout <<declval < T>()), ostream&>
>
> : true_type {};
tcT > constexpr bool is_printable_v = is_printable<T>::value;
}*/
using ll = long long;
using db = long double; // or double, if TL is tight
using str = string; // yay python!
// pairs
using pii = pair<int, int> ;
using pl = pair<ll, ll> ;
using pd = pair<db, db> ;
#define mp make_pair
#define f first
#define s second
#define tcT template < class T
#define tcTU tcT, class U
// ^ lol this makes everything look weird but I'll try it
tcT > using V = vector<T> ;
tcT, size_t SZ > using AR = array<T, SZ> ;
using vi = V<int> ;
using vb = V<bool> ;
using vl = V<ll> ;
using vd = V<db> ;
using vs = V<str> ;
using vpi = V<pii> ;
using vpl = V<pl> ;
using vpd = V<pd> ;
// vectors
// oops size(x), rbegin(x), rend(x) need C++17
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend()
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()
#define lb lower_bound
#define ub upper_bound
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b) - 1; i >= (a); --i)
#define R0F(i, a) ROF(i, 0, a)
#define rep(a) F0R(_, a)
#define each(a, x) for (auto &a: x)
template < class T > using pqg = priority_queue<T, vector < T>, greater < T>> ;
/*
inline namespace Helpers {
//////////// is_iterable
// https://stackoverflow.com/questions/13830158/check-if-a-variable-type-is-iterable
// this gets used only when we can call begin() and end() on that type
tcT, class = void > struct is_iterable : false_type {};
tcT > struct is_iterable<T, void_t<decltype(begin(declval < T>())),
decltype(end(declval < T>()))
>
> : true_type {};
tcT > constexpr bool is_iterable_v = is_iterable<T>::value;
//////////// is_readable
tcT, class = void > struct is_readable : false_type {};
tcT > struct is_readable<T,
typename std::enable_if_t<
is_same_v < decltype(cin >> declval<T&>()), istream&>
>
> : true_type {};
tcT > constexpr bool is_readable_v = is_readable<T>::value;
//////////// is_printable
// // https://nafe.es/posts/2020-02-29-is-printable/
tcT, class = void > struct is_printable : false_type {};
tcT > struct is_printable<T,
typename std::enable_if_t<
is_same_v < decltype(cout <<declval < T>()), ostream&>
>
> : true_type {};
tcT > constexpr bool is_printable_v = is_printable<T>::value;
}*/
const int N = 1e5 + 5,
mod = 10007;
int t, n, a[N], c, b[N], tree[4 *N][21];
void merge(int node, int le, int ri)
{
for (int i = 0; i <= c; i++) tree[node][i] = 0;
for (int i = 0; i <= c; i++)
{
for (int j = 0; j <= c; j++)
{
long long x = ((long long) tree[le][i] *(long long) tree[ri][j]) % mod;
tree[node][min(i + j, c)] = (tree[node][min(i + j, c)] + x) % mod;
}
}
}
void build(int node, int le, int ri)
{
if (le == ri)
{
tree[node][0] = b[le];
tree[node][1] = a[le];
return;
}
int mid = (le + ri) / 2;
build(2 *node, le, mid);
build(2 *node + 1, mid + 1, ri);
merge(node, 2 *node, 2 *node + 1);
}
void update(int node, int le, int ri, int idx)
{
if (le > idx || ri < idx) return;
if (le == ri)
{
tree[node][0] = b[idx];
tree[node][1] = a[idx];
return;
}
int mid = (le + ri) / 2;
update(2 *node, le, mid, idx);
update(2 *node + 1, mid + 1, ri, idx);
merge(node, 2 *node, 2 *node + 1);
}
main()
{
cin >> n >> c;
for (int i = 1; i <= n; i++)
{
cin >> a[i];
a[i] %= mod;
}
for (int i = 1; i <= n; i++)
{
cin >> b[i];
b[i] %= mod;
}
build(1, 1, n);
int q;
cin >> q;
for (int i = 1; i <= q; i++)
{
int idx;
cin >> idx >> a[idx] >> b[idx];
a[idx] %= mod;
b[idx] %= mod;
update(1, 1, n, idx);
cout << tree[1][c] << "\n";
}
}
Compilation message
relativnost.cpp:255:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
255 | main()
| ^~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
11 ms |
396 KB |
Output is correct |
| 2 |
Correct |
14 ms |
468 KB |
Output is correct |
| 3 |
Correct |
27 ms |
512 KB |
Output is correct |
| 4 |
Correct |
615 ms |
12716 KB |
Output is correct |
| 5 |
Correct |
1712 ms |
24184 KB |
Output is correct |
| 6 |
Correct |
2592 ms |
23832 KB |
Output is correct |
| 7 |
Correct |
1158 ms |
12676 KB |
Output is correct |
| 8 |
Correct |
681 ms |
23608 KB |
Output is correct |
| 9 |
Correct |
1201 ms |
23812 KB |
Output is correct |
| 10 |
Correct |
3904 ms |
23780 KB |
Output is correct |
