# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
419857 | 2021-06-07T14:16:12 Z | acm | Relativnost (COCI15_relativnost) | C++14 | 4000 ms | 11964 KB |
#include <bits/stdc++.h> #define speed \ ios_base::sync_with_stdio(0); \ cin.tie(0); \ cout.tie(0); #define precision \ cout.precision(30); \ cerr.precision(10); #define ll long long #define ld long double #define pll pair<ll, ll> #define pii pair<int, int> #define forn(n) for (int i = 1; i <= n; i++) #define forlr(l, r) for (int i = l; i != r; (l > r ? i-- : i++)) #define pb(x) push_back(x) #define sz(x) (int)x.size() #define mp(x, y) make_pair(x, y) #define all(x) x.begin(), x.end() #define pc(x) __builtin_popcount(x) #define pcll(x) __builtin_popcountll(x) #define F first #define S second using namespace std; mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); void ioi(string name) { freopen((name + ".in").c_str(), "r", stdin); freopen((name + ".out").c_str(), "w", stdout); } const int mod = 10007; int n, c, q, a[100005], b[100005], dp[100005][25]; int main() { speed; precision; // code cin >> n >> c; for (int i = 1; i <= n; i++) { cin >> a[i]; } for (int i = 1; i <= n; i++) { cin >> b[i]; } dp[0][0] = 1; for (int i = 1; i <= n; i++) { for (int j = 0; j <= c; j++) { dp[i][j] = (dp[i - 1][max(j - 1, 0)] * a[i]) % mod; dp[i][j] += (dp[i - 1][j] * b[i]) % mod; if (mod <= dp[i][j]) dp[i][j] -= mod; } } cin >> q; while (q--) { int x, y, z; cin >> x >> y >> z; a[x] = y; b[x] = z; for (int i = x; i <= n; i++) { for (int j = 0; j <= c; j++) { dp[i][j] = (dp[i - 1][max(j - 1, 0)] * a[i]) % mod; dp[i][j] += (dp[i - 1][j] * b[i]) % mod; if (mod <= dp[i][j]) dp[i][j] -= mod; } } cout << dp[n][c] << "\n"; } // endl #ifndef ONLINE_JUDGE cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n"; #endif return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 33 ms | 332 KB | Output is correct |
2 | Correct | 45 ms | 428 KB | Output is correct |
3 | Correct | 44 ms | 428 KB | Output is correct |
4 | Execution timed out | 4050 ms | 7136 KB | Time limit exceeded |
5 | Execution timed out | 4048 ms | 11280 KB | Time limit exceeded |
6 | Execution timed out | 4029 ms | 11964 KB | Time limit exceeded |
7 | Execution timed out | 4064 ms | 8520 KB | Time limit exceeded |
8 | Execution timed out | 4069 ms | 11784 KB | Time limit exceeded |
9 | Execution timed out | 4053 ms | 9780 KB | Time limit exceeded |
10 | Execution timed out | 4050 ms | 9284 KB | Time limit exceeded |