oj.uz

Submission #624228

# Submission time Handle Problem Language Result Execution time Memory
624228 2022-08-07T13:41:41 Z MilosMilutinovic Relativnost (COCI15_relativnost) C++14
0 / 140
 4000 ms 22328 KB 
/**
 *    author:  wxhtzdy
 *    created: 07.08.2022 15:06:04
**/
#include <bits/stdc++.h>

using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);  
  int n, c;
  cin >> n >> c;
  vector<pair<int, int>> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i].first >> a[i].second;
    a[i].first %= 10007;
    a[i].second %= 10007;
  }                            
  vector<vector<int>> dp(2 * n + 1, vector<int>(c + 1));
  function<void(int)> Update = [&](int i) {
    i += n;             
    for (int j = 0; j <= c; j++) {
      dp[i][j] = 0;
    }
    dp[i][0] = a[i - n].second;
    dp[i][1] = a[i - n].first;
    for (i /= 2; i > 0; i /= 2) {
      for (int p = 0; p <= c; p++) {
        dp[i][p] = 0;
      }
      for (int p = 0; p <= c; p++) {
        for (int q = 0; q <= c; q++) {
          dp[i][min(p + q, c)] += (dp[i * 2][p] * dp[i * 2 + 1][q]) % 10007;
          dp[i][min(p + q, c)] %= 10007;
        }
      }
    }
  };                     
  for (int i = 0; i < n; i++) {
    Update(i); 
  }
  int q;
  cin >> q;
  while (q--) {
    int idx, x, y;
    cin >> idx >> x >> y;
    --idx;
    x %= 10007;
    y %= 10007; 
    a[idx].first = x;
    a[idx].second = y;
    Update(idx);
    cout << dp[1][c] << '\n';
  }                                                        
  return 0;
}

Subtask #1
0 / 140.0

# Verdict Execution time Memory Grader output
1 Incorrect 19 ms 464 KB Output isn't correct
2 Incorrect 30 ms 468 KB Output isn't correct
3 Incorrect 62 ms 476 KB Output isn't correct
4 Incorrect 1113 ms 8420 KB Output isn't correct
5 Execution timed out 4077 ms 16000 KB Time limit exceeded
6 Execution timed out 4099 ms 22328 KB Time limit exceeded
7 Incorrect 2952 ms 11944 KB Output isn't correct
8 Incorrect 1743 ms 13868 KB Output isn't correct
9 Incorrect 2449 ms 11592 KB Output isn't correct
10 Execution timed out 4022 ms 17364 KB Time limit exceeded