oj.uz

Submission #541916

# Submission time Handle Problem Language Result Execution time Memory
541916 2022-03-24T19:42:50 Z Olympia Relativnost (COCI15_relativnost) C++17
0 / 140
 4000 ms 44536 KB 
#include <vector>
#include <algorithm>
#include <iostream>
#include <set>
#include <cmath>
#include <map>
#include <random>
#include <cassert>
#include <ctime>
#include <cstdlib>
#include <limits.h>
#include <queue>

using namespace std;
const int MOD = 10007;
class Node {
public:
    int64_t dp[21]; //how many ways such that exactly C people get a painting
    Node () {
        for (int i = 0; i < 21; i++) {
            dp[i] = 0;
        }
        dp[0] = 0;
    }
};
Node merge (Node n1, Node n2) {
    Node ans;
    for (int i = 0; i < 21; i++) {
        for (int j = 0; j < 21; j++) {
            ans.dp[min(i + j, 20)] += n1.dp[i] * n2.dp[j];
            ans.dp[min(i + j, 20)] %= MOD;
            //cout << ans.dp[min(i + j)]
        }
    }
    return ans;
}
Node get_node (pair<int,int> p) {
    Node ans;
    ans.dp[0] = p.second;
    ans.dp[1] = p.first;
    return ans;
}
template<class T>
class SegmentTree {
public:

    SegmentTree (int N) {
        N = (1 << ((int)floor(log2(N - 1)) + 1));
        this->N = N;
        val.assign(2 * N, Node());
    }

    void update (int x, T y) {
        x += N - 1;
        val[x] = y;
        while (x != 0) {
            x = (x - 1)/2;
            val[x] = merge(val[2 * x + 1], val[2 * x + 2]);
        }
    }

    vector<T> val;
private:
    int N;
};
int main() {
    //freopen("balancing.in", "r", stdin);
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int N, C;
    cin >> N >> C;
    SegmentTree<Node> st(N);
    vector<int> x(N), y(N);
    for (int i = 0; i < N; i++) cin >> x[i];
    for (int i = 0; i < N; i++) cin >> y[i];
    for (int i = 0; i < N; i++) {
        st.update(i, get_node({x[i], y[i]}));
        //cout << st.val[0].dp[1] << '\n';
    }
    //return 0;
    int Q;
    cin >> Q;
    while (Q--) {
        int ind, a, b;
        cin >> ind >> a >> b;
        ind--;
        st.update(ind, get_node({a, b}));
        int64_t ans = 0;
        for (int i = C; i <= 20; i++) {
            ans += st.val[0].dp[i];
        }
        cout << ans % MOD << '\n';
    }
}

Subtask #1
0 / 140.0

# Verdict Execution time Memory Grader output
1 Incorrect 38 ms 668 KB Output isn't correct
2 Incorrect 42 ms 680 KB Output isn't correct
3 Incorrect 34 ms 596 KB Output isn't correct
4 Incorrect 3216 ms 22628 KB Output isn't correct
5 Execution timed out 4078 ms 44500 KB Time limit exceeded
6 Execution timed out 4073 ms 44536 KB Time limit exceeded
7 Incorrect 3351 ms 22476 KB Output isn't correct
8 Execution timed out 4074 ms 44512 KB Time limit exceeded
9 Execution timed out 4070 ms 44456 KB Time limit exceeded
10 Execution timed out 4067 ms 44392 KB Time limit exceeded