oj.uz

Submission #253979

# Submission time Handle Problem Language Result Execution time Memory
253979 2020-07-29T08:06:59 Z kartel Relativnost (COCI15_relativnost) C++14
140 / 140
 3981 ms 12868 KB 
#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 +100200
#define M (int(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][22];
int a[N], b[N], new_a, new_b, q, n, i, id;
si c;

si sum(ll a, ll b) {return si((a + b) % ll(M));}
si mult(ll a, ll b) {return si((a * b) % ll(M));}

void calc(int v, int lv, int rv)
{
    for (int cnt = 0; cnt <= c; cnt++) t[v][cnt] = 0;

    for (int left = 0; left <= c; left++)
      for (int right = 0; right <= c; right++)
    {
        int new_cnt = min(int(c), int(left) + int(right));

        t[v][new_cnt] = sum(t[v][new_cnt], mult(t[lv][left], t[rv][right]));
    }
}

void build(int v, int l, int 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, int l, int r, int 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("4.in");
//    out("output.txt");

    cin >> n >> c;
    for (i = 1; i <= n; i++) cin >> a[i], a[i] = sum(a[i], 0);
    for (i = 1; i <= n; i++) cin >> b[i], b[i] = sum(b[i], 0);

    build(1, 1, n);

    cin >> q;
    while (q--)
    {
        cin >> id >> new_a >> new_b;

        a[id] = new_a % M;
        b[id] = new_b % M;

        upd(1, 1, n, id);

        cout << t[1][c] << el;
    }
}

Subtask #1
140.0 / 140.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 512 KB Output is correct
2 Correct 14 ms 416 KB Output is correct
3 Correct 30 ms 508 KB Output is correct
4 Correct 458 ms 6708 KB Output is correct
5 Correct 1668 ms 12820 KB Output is correct
6 Correct 2509 ms 12868 KB Output is correct
7 Correct 1069 ms 6776 KB Output is correct
8 Correct 557 ms 12664 KB Output is correct
9 Correct 1022 ms 12800 KB Output is correct
10 Correct 3981 ms 12664 KB Output is correct