oj.uz

답안 #1094398

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1094398 2024-09-29T14:50:58 Z VMaksimoski008 Relativnost (COCI15_relativnost) C++17
42 / 140
 4000 ms 25092 KB 
#include <bits/stdc++.h>
using namespace std;

const int mod = 10007;
const int maxn = 1e5 + 5;

int tree[4*maxn][21], n, m;

void update(int u, int tl, int tr, int p, int a, int b) {
    if(tl == tr) {
        tree[u][1] = a;
        tree[u][0] = b;
    } else {
        int tm = (tl + tr) / 2;
        if(p <= tm) update(2*u, tl, tm, p, a, b);
        else update(2*u+1, tm+1, tr, p, a, b);
        for(int i=0; i<=m; i++) tree[u][i] = 0;
        for(int i=0; i<=m; i++)
            for(int j=0; j<=m; j++) tree[u][min(i+j, m)] = (tree[u][min(i+j, m)] + tree[2*u][i] * tree[2*u+1][j]) % mod;
    }
}

int main() {
    cin >> n >> m;
    vector<int> A(n+1), B(n+1);
    for(int i=1; i<=n; i++) cin >> A[i];
    for(int i=1; i<=n; i++) cin >> B[i];
    for(int i=1; i<=n; i++) update(1, 1, n, i, A[i], B[i]);

    int q; cin >> q;
    while(q--) {
        int p, na, nb; cin >> p >> na >> nb;
        update(1, 1, n, p, na, nb);
        cout << tree[1][m] << '\n';
    }

    return 0;
}

Subtask #1
42.0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 600 KB Output is correct
2 Correct 18 ms 604 KB Output is correct
3 Correct 36 ms 616 KB Output is correct
4 Incorrect 776 ms 13268 KB Output isn't correct
5 Incorrect 2755 ms 24652 KB Output isn't correct
6 Execution timed out 4033 ms 24192 KB Time limit exceeded
7 Incorrect 1719 ms 13268 KB Output isn't correct
8 Incorrect 1055 ms 24148 KB Output isn't correct
9 Incorrect 1474 ms 25092 KB Output isn't correct
10 Execution timed out 4017 ms 23772 KB Time limit exceeded