oj.uz

답안 #251662

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
251662 2020-07-22T06:48:13 Z Vimmer Relativnost (COCI15_relativnost) C++14
42 / 140
 4000 ms 21368 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define pf push_front
#define N 100010
#define M ll(10007)
#define inf 1e9 + 1e9

using namespace std;
//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef short int si;
typedef array <int, 3> a3;
typedef array <int, 4> a4;
typedef pair <int, int> pt;
//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;



ll f[N][25];

ll sm(ll x, ll y) {return (x + y) % M;}

ll mlt(ll x, ll y) {return (x * y) % M;}

int main()
{
    //freopen("mining.in", "r", stdin); freopen("mining.out", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n, c;

    cin >> n >> c;

    ll a[n], b[n];

    for (int i = 0; i < n; i++) cin >> a[i];

    for (int i = 0; i < n; i++) cin >> b[i];

    int q;

    cin >> q;

    for (; q > 0; q--)
    {
        int x, l, r;

        cin >> x >> l >> r;

        x--;

        a[x] = l; b[x] = r;

        memset(f, 0, sizeof(f));

        f[0][0] = 1;

        for (int i = 0; i < n; i++)
            for (int j = 0; j <= c; j++)
            {
                f[i + 1][j] = sm(f[i + 1][j], mlt(f[i][j], b[i]));

                int nj = min(j + 1, c);

                f[i + 1][nj] = sm(f[i + 1][nj], mlt(f[i][j], a[i]));
            }

        cout << f[n][c] << endl;
    }
}

Subtask #1
42.0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2861 ms 20088 KB Output is correct
2 Correct 3902 ms 19964 KB Output is correct
3 Correct 2918 ms 20088 KB Output is correct
4 Execution timed out 4062 ms 20736 KB Time limit exceeded
5 Execution timed out 4073 ms 21240 KB Time limit exceeded
6 Execution timed out 4091 ms 21368 KB Time limit exceeded
7 Execution timed out 4091 ms 20856 KB Time limit exceeded
8 Execution timed out 4094 ms 21240 KB Time limit exceeded
9 Execution timed out 4096 ms 20984 KB Time limit exceeded
10 Execution timed out 4088 ms 20984 KB Time limit exceeded