Submission #253952

#TimeUsernameProblemLanguageResultExecution timeMemory
253952kartelRelativnost (COCI15_relativnost)C++14
0 / 140
3181 ms65540 KiB
#include <bits/stdc++.h> //#include <ext/pb_ds/assoc_container.hpp> //#include <ext/pb_ds/tree_policy.hpp> #define in(x) freopen(x, "r", stdin) #define out(x) freopen(x, "w", stdout) //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") //#pragma GCC optimize("Ofast,nso-stack-protector,unroll-loops,fast-math,-O3") //#define F first //#define S second #define pb push_back #define N +100500 #define N +100500 #define M ll(1e4 + 7) #define sz(x) (int)x.size() #define re return #define oo ll(1e9) #define el '\n' #define Max_A int(1e9) //#define el endl #define pii pair <int, int> #define err ld(1e-9) #define Max_S int(3e6) #define last(x) x.back() #define all(x) (x).begin(), (x).end() #define arr_all(x, n) (x + 1), (x + 1 + n) using namespace std; //using namespace __gnu_pbds; //typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set; typedef long long ll; typedef short int si; typedef long double ld; si t[4 * N][21]; int a[N], b[N], new_a, new_b, q, n, i, id; si c; si sum(si a, si b) {return (int(a) + int(b)) % M;} si mult(si a, si b) {return (int(a) * int(b)) % M;} void calc(int v, si lv, si rv) { for (si cnt = 0; cnt <= c; cnt++) t[v][cnt] = 0; for (si left = 0; left <= c; left++) for (si right = 0; right <= c; right++) { si new_cnt = min(int(c), int(left + right)); t[v][new_cnt] = sum(t[v][new_cnt], mult(t[lv][left], t[rv][right])); } } void build(int v, si l, si r) { if (l == r) {t[v][0] = b[l]; t[v][1] = a[l]; return;} int md = (l + r) >> 1; build(v * 2, l, md); build(v * 2 + 1, md + 1, r); calc(v, v * 2, v * 2 + 1); } void upd(int v, si l, si r, si ps) { if (l == r) {t[v][0] = b[l]; t[v][1] = a[l]; return;} int md = (l + r) >> 1; if (ps <= md) upd(v * 2, l, md, ps); else upd(v * 2 + 1, md + 1, r, ps); calc(v, v * 2, v * 2 + 1); } int main() { cout.precision(2); srand(time(0)); ios_base::sync_with_stdio(0); iostream::sync_with_stdio(0); ios::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); // // in("input.txt"); // out("output.txt"); cin >> n >> c; for (i = 1; i <= n; i++) cin >> a[i] >> b[i]; build(1, 1, n); cin >> q; while (q--) { cin >> id >> new_a >> new_b; a[id] = new_a; b[id] = new_b; upd(1, 1, n, id); cout << t[1][c] << el; } }
#Verdict Execution timeMemoryGrader output
Fetching results...