# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
419890 | 2021-06-07T15:55:53 Z | acm | Relativnost (COCI15_relativnost) | C++14 | 4000 ms | 13792 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[400005][35]; void add(int &a, int b) { a += b; if (mod <= a) a -= mod; } void merge(int v) { for (int i = 0; i <= c; i++) dp[v][i] = 0; for (int i = 0; i <= c; i++) { for (int j = 0; j <= c; j++) { add(dp[v][min(i + j, c)], (dp[v + v][i] * dp[v + v + 1][j]) % mod); } } } void upd(ll v) { int x = (pc(n) < 2 + 1) * (1 << __lg(n)); v += x; dp[v][0] = b[v - x]; dp[v][1] = a[v - x]; for (; v /= 2;) merge(v); } int main() { speed; precision; // code cin >> n >> c; for (int i = 0; i < n; i++) { cin >> a[i]; a[i] %= mod; } for (int i = 0; i < n; i++) { cin >> b[i]; b[i] %= mod; upd(i); } cin >> q; while (q--) { int x, y, z; cin >> x >> y >> z; --x; a[x] = y % mod; b[x] = z % mod; upd(x); cout << dp[1][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 | Incorrect | 9 ms | 460 KB | Output isn't correct |
2 | Incorrect | 11 ms | 460 KB | Output isn't correct |
3 | Incorrect | 24 ms | 440 KB | Output isn't correct |
4 | Incorrect | 481 ms | 8152 KB | Output isn't correct |
5 | Incorrect | 1909 ms | 13236 KB | Output isn't correct |
6 | Incorrect | 3414 ms | 13792 KB | Output isn't correct |
7 | Incorrect | 1242 ms | 9852 KB | Output isn't correct |
8 | Incorrect | 757 ms | 13644 KB | Output isn't correct |
9 | Incorrect | 1119 ms | 11448 KB | Output isn't correct |
10 | Execution timed out | 4048 ms | 10840 KB | Time limit exceeded |