oj.uz

답안 #93628

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
93628 2019-01-10T12:23:10 Z dfistric Relativnost (COCI15_relativnost) C++14
0 / 140
 4000 ms 23420 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 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) update(i, 0, 1);

  REP(i, n) {
    cin >> a >> b;
    update(i, a, b);
  }

  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
0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1024 ms 22880 KB Output isn't correct
2 Incorrect 1470 ms 23076 KB Output isn't correct
3 Execution timed out 4091 ms 23072 KB Time limit exceeded
4 Incorrect 1302 ms 23368 KB Output isn't correct
5 Execution timed out 4021 ms 23288 KB Time limit exceeded
6 Execution timed out 4032 ms 22964 KB Time limit exceeded
7 Incorrect 3361 ms 23368 KB Output isn't correct
8 Incorrect 1803 ms 23184 KB Output isn't correct
9 Incorrect 2355 ms 23420 KB Output isn't correct
10 Execution timed out 4019 ms 20752 KB Time limit exceeded