oj.uz

답안 #93631

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
93631 2019-01-10T12:33:44 Z dfistric Relativnost (COCI15_relativnost) C++14
42 / 140
 3621 ms 23576 KB 
#include <bits/stdc++.h>

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORd(i, a, b) for (int i = (a); i >= (b); i--)
#define REP(i, n) FOR(i, 0, n)
#define ll long long

using namespace std;

const int OFF = (1 << 17);
const int MOD = 10007;
int tour[2 * OFF][22];
int A[OFF], B[OFF];
int C;

int add(int a, int b) {
  return (a + b) % MOD;
}

int mul(int a, int b) {
  return (a * b) % MOD;
}

void update(int x, int a, int b) {
  x += OFF;
  tour[x][0] = b % MOD;
  tour[x][1] = a % MOD;
  x /= 2;

  while (x) {
    REP(i, C + 1) tour[x][i] = 0;

    REP(i, C + 1) {
      REP(j, C + 1) {
        int t = min(C, i + j);
        tour[x][t] = add(tour[x][t], mul(tour[x * 2][i], tour[x * 2 + 1][j]));
      }
    }
    x /= 2;
  }

  return;
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);

  int n, a, b, x;
  cin >> n >> C;

  REP(i, OFF) tour[i + OFF][0] = 1;
  REP(i, n) cin >> tour[i + OFF][1];
  REP(i, n) cin >> tour[i + OFF][0];

  FORd(x, OFF - 1, 1) {
    tour[x][0] = 0;
    REP(i, C + 1) {
      REP(j, C + 1) {
        int t = min(C, i + j);
        tour[x][t] = add(tour[x][t], mul(tour[x * 2][i], tour[x * 2 + 1][j]));
      }
    } 
  }

  int q;
  cin >> q;
  REP(i, q) {
    cin >> x >> a >> b;
    update(x - 1, a, b);
    cout << tour[1][C] << "\n";
  }

  return 0;
}

Subtask #1
42.0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Correct 85 ms 22876 KB Output is correct
2 Correct 116 ms 22904 KB Output is correct
3 Correct 291 ms 23032 KB Output is correct
4 Incorrect 471 ms 23440 KB Output isn't correct
5 Incorrect 1473 ms 23476 KB Output isn't correct
6 Incorrect 2193 ms 23288 KB Output isn't correct
7 Incorrect 1020 ms 23504 KB Output isn't correct
8 Incorrect 488 ms 23032 KB Output isn't correct
9 Incorrect 911 ms 23548 KB Output isn't correct
10 Incorrect 3621 ms 23576 KB Output isn't correct