oj.uz

답안 #964072

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
964072 2024-04-16T09:29:35 Z LucaLucaM Sprinkler (JOI22_sprinkler) C++17
41 / 100
 4000 ms 113324 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <cassert>
#include <cstring>
#include <queue>
#warning That's not AS, that's my AS

typedef long long ll;

const int NMAX = 2e5;
const int DMAX = 40;

int L;

struct Node {
  int value, lazy;
};

struct segtree {
  std::vector<Node> aint;
  std::vector<int> brute;
  int n;
  segtree() {}
  segtree(int _n) {
    n = 1;
    while (n <= _n) {
      n <<= 1;
    }
    n <<= 1;
    n |= 1;
    aint.resize(n);
    for (int i = 0; i < n; i++) {
      aint[i] = {1, 1};
    }
    n = _n;
    brute.resize(n + 1, 1);
  }

  void push(int node, int tl, int tr) {
    if (aint[node].lazy != 1) {
      aint[node].value = (ll) aint[node].value * aint[node].lazy % L;
      if (tl != tr) {
        aint[2 * node].lazy = (ll) aint[node].lazy * aint[2 * node].lazy % L;
        aint[2 * node + 1].lazy = (ll) aint[node].lazy * aint[2 * node + 1].lazy % L;
      }
      aint[node].lazy = 1;
    }
  }
  void upd(int node, int tl, int tr, int l, int r, int v) {
    assert(1 <= tl && tl <= tr && tr <= n);
    push(node, tl, tr);
    if (l <= tl && tr <= r) {
      aint[node].lazy = v;
    } else {
      int mid = (tl + tr) / 2;
      if (l <= mid) {
        upd(2 * node, tl, mid, l, r, v);
      }
      if (mid < r) {
        upd(2 * node + 1, mid + 1, tr, l, r, v);
      }
      push(2 * node, tl, mid);
      push(2 * node + 1, mid + 1, tr);
      aint[node].value = (ll) aint[2 * node].value * aint[2 * node + 1].value;
    }
  }

  int qry(int node, int tl, int tr, int p) {
    push(node, tl, tr);
    if (tl == tr) {
      return aint[node].value;
    } else {
      int mid = (tl + tr) / 2;
      if (p <= mid) {
        return qry(2 * node, tl, mid, p);
      }
      return qry(2 * node + 1, mid + 1, tr, p);
    }
  }

  void bruteUpdate(int l, int r, int v) {
    for (int i = l; i <= r; i++) {
      brute[i] = (ll) brute[i] * v % L;
    }
  }
  int bruteQuery(int p) {
    return brute[p];
  }

  void update(int l, int r, int v) {
    if (l > r) {
      return;
    }
//    bruteUpdate(l, r, v);
    upd(1, 1, n, l, r, v);
  }
  int query(int p) {
//    return bruteQuery(p);
    return qry(1, 1, n, p);
  }
};

std::vector<int> g[NMAX + 1];
int parent[NMAX + 1];
int Time[NMAX + 1];
int timer;
int lt[NMAX + 1][DMAX + 1];
int rt[NMAX + 1][DMAX + 1];

void bfs() {
  std::queue<int> q;
  q.push(1);
  while (!q.empty()) {
    int u = q.front();
    q.pop();
    Time[u] = ++timer;
    std::vector<int> newG;
    for (const auto &v : g[u]) {
      if (!Time[v]) {
        parent[v] = u;
        newG.push_back(v);
        q.push(v);
      }
    }
    g[u] = newG;
  }
}

void dfs(int u) {
  lt[u][0] = rt[u][0] = Time[u];
  for (int d = 1; d <= DMAX; d++) {
    lt[u][d] = NMAX + 1;
    rt[u][d] = 0;
  }
  for (const auto &v : g[u]) {
    assert(v != parent[u]);
    dfs(v);
    for (int d = 0; d < DMAX; d++) {
      lt[u][d + 1] = std::min(lt[u][d + 1], lt[v][d]);
      rt[u][d + 1] = std::max(rt[u][d + 1], rt[v][d]);
    }
  }
}

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

  int n;
  std::cin >> n >> L;

  for (int i = 1; i < n; i++) {
    int u, v;
    std::cin >> u >> v;
    g[u].push_back(v);
    g[v].push_back(u);
  }

  bfs();
  dfs(1);

  segtree aint(2 * n + 1);

  for (int i = 1; i <= n; i++) {
    int h;
    std::cin >> h;
    aint.update(Time[i], Time[i], h);
  }

  int q;
  std::cin >> q;

  while (q--) {
    int type;
    std::cin >> type;
    if (type == 1) {
      int u, d, h;
      std::cin >> u >> d >> h;
      std::vector<std::pair<int, int>> ancestors;
      int v = u;
      for (int i = 0; i <= d && v != 0; i++) {
        ancestors.push_back({v, d - i});
        v = parent[v];
      }
      std::reverse(ancestors.begin(), ancestors.end());
      int maxDepth = -1;
      for (const auto &[v, depth] : ancestors) {
        /// i + depth > maxDepth => i > maxDepth - depth
        /// i + d - depth <= d <=> i <= depth
        for (int i = std::max(0, maxDepth - depth + 1); i <= depth; i++) {
          aint.update(lt[v][i], rt[v][i], h);
          maxDepth = i + depth;
        }
      }
    } else {
      int u;
      std::cin >> u;
      std::cout << aint.query(Time[u]) << '\n';
    }
  }

  return 0;
}
// pls mergi

Compilation message

sprinkler.cpp:7:2: warning: #warning That's not AS, that's my AS [-Wcpp]
    7 | #warning That's not AS, that's my AS
      |  ^~~~~~~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9052 KB Output is correct
2 Correct 6 ms 9052 KB Output is correct
3 Correct 10 ms 9052 KB Output is correct
4 Correct 6 ms 9596 KB Output is correct
5 Correct 5 ms 9440 KB Output is correct
6 Correct 5 ms 9308 KB Output is correct
7 Correct 4 ms 9308 KB Output is correct
8 Correct 3 ms 9304 KB Output is correct
9 Correct 2 ms 9052 KB Output is correct
10 Correct 2 ms 9052 KB Output is correct
11 Correct 4 ms 9048 KB Output is correct
12 Correct 3 ms 9172 KB Output is correct
13 Correct 2 ms 9052 KB Output is correct
14 Correct 2 ms 9208 KB Output is correct
15 Correct 3 ms 9052 KB Output is correct
16 Correct 3 ms 9304 KB Output is correct
17 Correct 2 ms 9052 KB Output is correct
18 Correct 2 ms 9052 KB Output is correct
19 Correct 2 ms 9048 KB Output is correct
20 Correct 2 ms 9052 KB Output is correct
21 Correct 3 ms 9052 KB Output is correct
22 Correct 2 ms 9048 KB Output is correct
23 Correct 2 ms 9052 KB Output is correct
24 Correct 2 ms 9052 KB Output is correct
25 Correct 3 ms 9052 KB Output is correct
26 Correct 2 ms 9052 KB Output is correct
27 Correct 3 ms 9052 KB Output is correct
28 Correct 2 ms 9304 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 9052 KB Output is correct
2 Correct 458 ms 94924 KB Output is correct
3 Correct 706 ms 93392 KB Output is correct
4 Correct 594 ms 104036 KB Output is correct
5 Correct 514 ms 94196 KB Output is correct
6 Correct 592 ms 94412 KB Output is correct
7 Correct 509 ms 94804 KB Output is correct
8 Correct 422 ms 96136 KB Output is correct
9 Correct 497 ms 109848 KB Output is correct
10 Correct 811 ms 107620 KB Output is correct
11 Correct 417 ms 95112 KB Output is correct
12 Correct 690 ms 93600 KB Output is correct
13 Correct 678 ms 94984 KB Output is correct
14 Correct 731 ms 94320 KB Output is correct
15 Correct 730 ms 94316 KB Output is correct
16 Correct 653 ms 94216 KB Output is correct
17 Correct 684 ms 94844 KB Output is correct
18 Correct 3 ms 9052 KB Output is correct
19 Correct 2 ms 9048 KB Output is correct
20 Correct 2 ms 9052 KB Output is correct
21 Correct 2 ms 9052 KB Output is correct
22 Correct 2 ms 9052 KB Output is correct

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 9052 KB Output is correct
2 Correct 458 ms 94924 KB Output is correct
3 Correct 706 ms 93392 KB Output is correct
4 Correct 594 ms 104036 KB Output is correct
5 Correct 514 ms 94196 KB Output is correct
6 Correct 592 ms 94412 KB Output is correct
7 Correct 509 ms 94804 KB Output is correct
8 Correct 422 ms 96136 KB Output is correct
9 Correct 497 ms 109848 KB Output is correct
10 Correct 811 ms 107620 KB Output is correct
11 Correct 417 ms 95112 KB Output is correct
12 Correct 690 ms 93600 KB Output is correct
13 Correct 678 ms 94984 KB Output is correct
14 Correct 731 ms 94320 KB Output is correct
15 Correct 730 ms 94316 KB Output is correct
16 Correct 653 ms 94216 KB Output is correct
17 Correct 684 ms 94844 KB Output is correct
18 Correct 3 ms 9052 KB Output is correct
19 Correct 2 ms 9048 KB Output is correct
20 Correct 2 ms 9052 KB Output is correct
21 Correct 2 ms 9052 KB Output is correct
22 Correct 2 ms 9052 KB Output is correct
23 Correct 3 ms 9052 KB Output is correct
24 Correct 434 ms 98856 KB Output is correct
25 Correct 838 ms 99428 KB Output is correct
26 Correct 655 ms 113324 KB Output is correct
27 Correct 576 ms 98920 KB Output is correct
28 Correct 607 ms 99136 KB Output is correct
29 Correct 613 ms 99012 KB Output is correct
30 Correct 564 ms 100760 KB Output is correct
31 Correct 496 ms 109232 KB Output is correct
32 Correct 977 ms 113036 KB Output is correct
33 Correct 439 ms 98900 KB Output is correct
34 Correct 930 ms 99368 KB Output is correct
35 Correct 2 ms 9304 KB Output is correct
36 Correct 2 ms 9052 KB Output is correct
37 Correct 2 ms 9048 KB Output is correct
38 Correct 3 ms 9052 KB Output is correct
39 Correct 2 ms 9052 KB Output is correct
40 Correct 2 ms 9052 KB Output is correct
41 Correct 2 ms 9052 KB Output is correct
42 Correct 2 ms 9048 KB Output is correct
43 Correct 2 ms 9048 KB Output is correct
44 Correct 3 ms 9052 KB Output is correct
45 Correct 2 ms 9052 KB Output is correct
46 Correct 2 ms 9052 KB Output is correct
47 Correct 2 ms 9052 KB Output is correct
48 Correct 2 ms 9052 KB Output is correct
49 Correct 2 ms 9172 KB Output is correct

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 9052 KB Output is correct
2 Correct 1290 ms 110500 KB Output is correct
3 Execution timed out 4027 ms 105584 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 9048 KB Output is correct
2 Correct 1250 ms 108416 KB Output is correct
3 Execution timed out 4027 ms 102264 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9052 KB Output is correct
2 Correct 6 ms 9052 KB Output is correct
3 Correct 10 ms 9052 KB Output is correct
4 Correct 6 ms 9596 KB Output is correct
5 Correct 5 ms 9440 KB Output is correct
6 Correct 5 ms 9308 KB Output is correct
7 Correct 4 ms 9308 KB Output is correct
8 Correct 3 ms 9304 KB Output is correct
9 Correct 2 ms 9052 KB Output is correct
10 Correct 2 ms 9052 KB Output is correct
11 Correct 4 ms 9048 KB Output is correct
12 Correct 3 ms 9172 KB Output is correct
13 Correct 2 ms 9052 KB Output is correct
14 Correct 2 ms 9208 KB Output is correct
15 Correct 3 ms 9052 KB Output is correct
16 Correct 3 ms 9304 KB Output is correct
17 Correct 2 ms 9052 KB Output is correct
18 Correct 2 ms 9052 KB Output is correct
19 Correct 2 ms 9048 KB Output is correct
20 Correct 2 ms 9052 KB Output is correct
21 Correct 3 ms 9052 KB Output is correct
22 Correct 2 ms 9048 KB Output is correct
23 Correct 2 ms 9052 KB Output is correct
24 Correct 2 ms 9052 KB Output is correct
25 Correct 3 ms 9052 KB Output is correct
26 Correct 2 ms 9052 KB Output is correct
27 Correct 3 ms 9052 KB Output is correct
28 Correct 2 ms 9304 KB Output is correct
29 Correct 2 ms 9052 KB Output is correct
30 Correct 458 ms 94924 KB Output is correct
31 Correct 706 ms 93392 KB Output is correct
32 Correct 594 ms 104036 KB Output is correct
33 Correct 514 ms 94196 KB Output is correct
34 Correct 592 ms 94412 KB Output is correct
35 Correct 509 ms 94804 KB Output is correct
36 Correct 422 ms 96136 KB Output is correct
37 Correct 497 ms 109848 KB Output is correct
38 Correct 811 ms 107620 KB Output is correct
39 Correct 417 ms 95112 KB Output is correct
40 Correct 690 ms 93600 KB Output is correct
41 Correct 678 ms 94984 KB Output is correct
42 Correct 731 ms 94320 KB Output is correct
43 Correct 730 ms 94316 KB Output is correct
44 Correct 653 ms 94216 KB Output is correct
45 Correct 684 ms 94844 KB Output is correct
46 Correct 3 ms 9052 KB Output is correct
47 Correct 2 ms 9048 KB Output is correct
48 Correct 2 ms 9052 KB Output is correct
49 Correct 2 ms 9052 KB Output is correct
50 Correct 2 ms 9052 KB Output is correct
51 Correct 3 ms 9052 KB Output is correct
52 Correct 434 ms 98856 KB Output is correct
53 Correct 838 ms 99428 KB Output is correct
54 Correct 655 ms 113324 KB Output is correct
55 Correct 576 ms 98920 KB Output is correct
56 Correct 607 ms 99136 KB Output is correct
57 Correct 613 ms 99012 KB Output is correct
58 Correct 564 ms 100760 KB Output is correct
59 Correct 496 ms 109232 KB Output is correct
60 Correct 977 ms 113036 KB Output is correct
61 Correct 439 ms 98900 KB Output is correct
62 Correct 930 ms 99368 KB Output is correct
63 Correct 2 ms 9304 KB Output is correct
64 Correct 2 ms 9052 KB Output is correct
65 Correct 2 ms 9048 KB Output is correct
66 Correct 3 ms 9052 KB Output is correct
67 Correct 2 ms 9052 KB Output is correct
68 Correct 2 ms 9052 KB Output is correct
69 Correct 2 ms 9052 KB Output is correct
70 Correct 2 ms 9048 KB Output is correct
71 Correct 2 ms 9048 KB Output is correct
72 Correct 3 ms 9052 KB Output is correct
73 Correct 2 ms 9052 KB Output is correct
74 Correct 2 ms 9052 KB Output is correct
75 Correct 2 ms 9052 KB Output is correct
76 Correct 2 ms 9052 KB Output is correct
77 Correct 2 ms 9172 KB Output is correct
78 Correct 2 ms 9052 KB Output is correct
79 Correct 1290 ms 110500 KB Output is correct
80 Execution timed out 4027 ms 105584 KB Time limit exceeded
81 Halted 0 ms 0 KB -