oj.uz

Submission #419912

# Submission time Handle Problem Language Result Execution time Memory
419912 2021-06-07T16:54:12 Z acm Relativnost (COCI15_relativnost) C++14
140 / 140
 818 ms 17492 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], t[300005], e[300005], dp[300005][20];
void merge(int v) {
  e[v] = 0;
  t[v] = ((e[v + v] ? 1 : t[v + v]) * (e[v + v + 1] ? 1 : t[v + v + 1])) % mod;
  if (e[v + v + 1]) {
    for (int i = 0; i < c; i++) dp[v][i] = dp[v + v][i];
    return;
  }
  for (int i = 0; i < c; i++) dp[v][i] = 0;
  for (int i = 0; i < c; i++) {
    for (int j = 0; i + j < c; j++) {
      dp[v][i + j] += dp[v + v][i] * dp[v + v + 1][j];
    }
  }
  for (int i = 0; i < c; i++) dp[v][i] %= mod;
}
void upd(int x) {
  int v = x + (pc(n) < 2 ? n : (2 << __lg(n)));
  e[v] = 0;
  t[v] = a[x] + b[x];
  if (mod <= t[v]) t[v] -= mod;
  dp[v][0] = b[x];
  dp[v][1] = a[x];
  for (; v >>= 1;) merge(v);
}
int main() {
  speed;
  precision;
  // code
  cin >> n >> c;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    a[i] %= mod;
    e[i * 3 + 1] = e[i * 3 + 2] = e[i * 3 + 3] = 1;
  }
  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);
    x = t[1];
    for (int i = 0; i < c; i++) {
      x -= dp[1][i];
      if (x < 0) x += mod;
    }
    cout << x << "\n";
  }
  // endl
#ifndef ONLINE_JUDGE
  cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
  return 0;
}

Compilation message

relativnost.cpp: In function 'void ioi(std::string)':
relativnost.cpp:26:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |   freopen((name + ".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
relativnost.cpp:27:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |   freopen((name + ".out").c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
140.0 / 140.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 460 KB Output is correct
2 Correct 4 ms 460 KB Output is correct
3 Correct 6 ms 460 KB Output is correct
4 Correct 167 ms 10244 KB Output is correct
5 Correct 439 ms 16544 KB Output is correct
6 Correct 640 ms 17492 KB Output is correct
7 Correct 305 ms 12240 KB Output is correct
8 Correct 216 ms 17044 KB Output is correct
9 Correct 282 ms 14472 KB Output is correct
10 Correct 818 ms 13896 KB Output is correct