Submission #590629

#TimeUsernameProblemLanguageResultExecution timeMemory
590629Loki_NguyenRelativnost (COCI15_relativnost)C++14
0 / 140
170 ms9804 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define pll pair<ll, int> #define fi first #define se second #define pb push_back const int N = 2e5 + 3; const int M = 1 << 24; const int mod = 1e4 + 7; const int base = 300; const ll inf = 1e12; int pw(int k, int n) { int total = 1; for (; n; n >>= 1) { if (n & 1) total = total * k % mod; k = k * k % mod; } return total; } int m, n, t, k, a[N], ans, b[N], c[N], d[N]; int dp[N]; vector<pll> adj[N]; vector<int> kq, val; ll lwr(ll x) { return lower_bound(kq.begin(), kq.end(), x) - kq.begin(); } void sol() { cin >> n >> k; dp[0] = 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 ++) { for(int j = k; j > 0; j --) dp[j] = (dp[j] * b[i] % mod + dp[j-1] * a[i] % mod) % mod; dp[0] = dp[0] * b[i] % mod; } cin >> m; while(m -- > 0) { int i, x, y; cin >> i >> x >> y; dp[0] = dp[0] * pw(b[i], mod-2)%mod; for(int j = 1; j <= k; j ++) { dp[j] = (dp[j]+mod-dp[j-1]*a[i]%mod)%mod; dp[j] = dp[j] * pw(b[i], mod-2) % mod; } a[i] = x; b[i] = y; for (int j = k; j > 0; j--) dp[j] = (dp[j] * b[i] % mod + dp[j - 1] * a[i] % mod) % mod; dp[0] = dp[0] * b[i] % mod; cout << dp[k] << '\n'; } } int main() { cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0); #define task "tests" if (fopen(task ".in", "r")) { freopen(task ".in", "r", stdin); // freopen(task".out", "w", stdout); } int ntest = 1; // cin >> ntest; while (ntest-- > 0) sol(); }

Compilation message (stderr)

relativnost.cpp: In function 'int main()':
relativnost.cpp:74:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   74 |         freopen(task ".in", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...