oj.uz

Submission #964074

# Submission time Handle Problem Language Result Execution time Memory
964074 2024-04-16T09:33:12 Z LucaLucaM Sprinkler (JOI22_sprinkler) C++17
41 / 100
 4000 ms 107388 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;
    }
    if (r - l <= 15) {
      bruteUpdate(l, r, v);
    } else {
      upd(1, 1, n, l, r, v);
    }
  }
  int query(int p) {
    return (ll) bruteQuery(p) * qry(1, 1, n, p) % L;
  }
};

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);
  std::cout.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(n);

  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;
}

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

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9056 KB Output is correct
2 Correct 2 ms 9052 KB Output is correct
3 Correct 2 ms 9052 KB Output is correct
4 Correct 4 ms 9308 KB Output is correct
5 Correct 4 ms 9308 KB Output is correct
6 Correct 5 ms 9308 KB Output is correct
7 Correct 4 ms 9424 KB Output is correct
8 Correct 4 ms 9308 KB Output is correct
9 Correct 3 ms 9052 KB Output is correct
10 Correct 3 ms 9176 KB Output is correct
11 Correct 3 ms 9052 KB Output is correct
12 Correct 2 ms 9052 KB Output is correct
13 Correct 2 ms 9052 KB Output is correct
14 Correct 2 ms 9052 KB Output is correct
15 Correct 2 ms 9048 KB Output is correct
16 Correct 2 ms 9052 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 9052 KB Output is correct
20 Correct 2 ms 9056 KB Output is correct
21 Correct 2 ms 9056 KB Output is correct
22 Correct 3 ms 9052 KB Output is correct
23 Correct 2 ms 9308 KB Output is correct
24 Correct 3 ms 9172 KB Output is correct
25 Correct 2 ms 9052 KB Output is correct
26 Correct 2 ms 9148 KB Output is correct
27 Correct 2 ms 9052 KB Output is correct
28 Correct 2 ms 9060 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9056 KB Output is correct
2 Correct 401 ms 85748 KB Output is correct
3 Correct 407 ms 82576 KB Output is correct
4 Correct 464 ms 94032 KB Output is correct
5 Correct 373 ms 84160 KB Output is correct
6 Correct 377 ms 84132 KB Output is correct
7 Correct 378 ms 84548 KB Output is correct
8 Correct 360 ms 90504 KB Output is correct
9 Correct 394 ms 105104 KB Output is correct
10 Correct 459 ms 102776 KB Output is correct
11 Correct 347 ms 90212 KB Output is correct
12 Correct 425 ms 88772 KB Output is correct
13 Correct 551 ms 89836 KB Output is correct
14 Correct 523 ms 89712 KB Output is correct
15 Correct 462 ms 89508 KB Output is correct
16 Correct 461 ms 89676 KB Output is correct
17 Correct 481 ms 90112 KB Output is correct
18 Correct 2 ms 9172 KB Output is correct
19 Correct 3 ms 9052 KB Output is correct
20 Correct 2 ms 9052 KB Output is correct
21 Correct 3 ms 9176 KB Output is correct
22 Correct 2 ms 9052 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9056 KB Output is correct
2 Correct 401 ms 85748 KB Output is correct
3 Correct 407 ms 82576 KB Output is correct
4 Correct 464 ms 94032 KB Output is correct
5 Correct 373 ms 84160 KB Output is correct
6 Correct 377 ms 84132 KB Output is correct
7 Correct 378 ms 84548 KB Output is correct
8 Correct 360 ms 90504 KB Output is correct
9 Correct 394 ms 105104 KB Output is correct
10 Correct 459 ms 102776 KB Output is correct
11 Correct 347 ms 90212 KB Output is correct
12 Correct 425 ms 88772 KB Output is correct
13 Correct 551 ms 89836 KB Output is correct
14 Correct 523 ms 89712 KB Output is correct
15 Correct 462 ms 89508 KB Output is correct
16 Correct 461 ms 89676 KB Output is correct
17 Correct 481 ms 90112 KB Output is correct
18 Correct 2 ms 9172 KB Output is correct
19 Correct 3 ms 9052 KB Output is correct
20 Correct 2 ms 9052 KB Output is correct
21 Correct 3 ms 9176 KB Output is correct
22 Correct 2 ms 9052 KB Output is correct
23 Correct 2 ms 9052 KB Output is correct
24 Correct 343 ms 89940 KB Output is correct
25 Correct 490 ms 88680 KB Output is correct
26 Correct 498 ms 98316 KB Output is correct
27 Correct 387 ms 84060 KB Output is correct
28 Correct 384 ms 84196 KB Output is correct
29 Correct 434 ms 84220 KB Output is correct
30 Correct 420 ms 84908 KB Output is correct
31 Correct 385 ms 96084 KB Output is correct
32 Correct 579 ms 96236 KB Output is correct
33 Correct 332 ms 85584 KB Output is correct
34 Correct 510 ms 82488 KB Output is correct
35 Correct 2 ms 9052 KB Output is correct
36 Correct 3 ms 9052 KB Output is correct
37 Correct 2 ms 9052 KB Output is correct
38 Correct 2 ms 9048 KB Output is correct
39 Correct 3 ms 9180 KB Output is correct
40 Correct 2 ms 9052 KB Output is correct
41 Correct 2 ms 9136 KB Output is correct
42 Correct 2 ms 9052 KB Output is correct
43 Correct 2 ms 9048 KB Output is correct
44 Correct 2 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 9052 KB Output is correct

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9052 KB Output is correct
2 Correct 579 ms 97880 KB Output is correct
3 Correct 1529 ms 93576 KB Output is correct
4 Correct 777 ms 94492 KB Output is correct
5 Correct 1196 ms 82576 KB Output is correct
6 Correct 2164 ms 82820 KB Output is correct
7 Correct 1471 ms 83240 KB Output is correct
8 Correct 396 ms 83392 KB Output is correct
9 Correct 589 ms 93468 KB Output is correct
10 Correct 1667 ms 96052 KB Output is correct
11 Correct 875 ms 82728 KB Output is correct
12 Correct 3910 ms 82500 KB Output is correct
13 Execution timed out 4022 ms 83104 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 9048 KB Output is correct
2 Correct 642 ms 95540 KB Output is correct
3 Correct 1714 ms 90264 KB Output is correct
4 Correct 844 ms 93012 KB Output is correct
5 Correct 1342 ms 84204 KB Output is correct
6 Correct 2320 ms 92816 KB Output is correct
7 Correct 1868 ms 92776 KB Output is correct
8 Correct 432 ms 93140 KB Output is correct
9 Correct 604 ms 107388 KB Output is correct
10 Correct 1849 ms 106164 KB Output is correct
11 Correct 973 ms 93480 KB Output is correct
12 Execution timed out 4054 ms 91744 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9056 KB Output is correct
2 Correct 2 ms 9052 KB Output is correct
3 Correct 2 ms 9052 KB Output is correct
4 Correct 4 ms 9308 KB Output is correct
5 Correct 4 ms 9308 KB Output is correct
6 Correct 5 ms 9308 KB Output is correct
7 Correct 4 ms 9424 KB Output is correct
8 Correct 4 ms 9308 KB Output is correct
9 Correct 3 ms 9052 KB Output is correct
10 Correct 3 ms 9176 KB Output is correct
11 Correct 3 ms 9052 KB Output is correct
12 Correct 2 ms 9052 KB Output is correct
13 Correct 2 ms 9052 KB Output is correct
14 Correct 2 ms 9052 KB Output is correct
15 Correct 2 ms 9048 KB Output is correct
16 Correct 2 ms 9052 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 9052 KB Output is correct
20 Correct 2 ms 9056 KB Output is correct
21 Correct 2 ms 9056 KB Output is correct
22 Correct 3 ms 9052 KB Output is correct
23 Correct 2 ms 9308 KB Output is correct
24 Correct 3 ms 9172 KB Output is correct
25 Correct 2 ms 9052 KB Output is correct
26 Correct 2 ms 9148 KB Output is correct
27 Correct 2 ms 9052 KB Output is correct
28 Correct 2 ms 9060 KB Output is correct
29 Correct 2 ms 9056 KB Output is correct
30 Correct 401 ms 85748 KB Output is correct
31 Correct 407 ms 82576 KB Output is correct
32 Correct 464 ms 94032 KB Output is correct
33 Correct 373 ms 84160 KB Output is correct
34 Correct 377 ms 84132 KB Output is correct
35 Correct 378 ms 84548 KB Output is correct
36 Correct 360 ms 90504 KB Output is correct
37 Correct 394 ms 105104 KB Output is correct
38 Correct 459 ms 102776 KB Output is correct
39 Correct 347 ms 90212 KB Output is correct
40 Correct 425 ms 88772 KB Output is correct
41 Correct 551 ms 89836 KB Output is correct
42 Correct 523 ms 89712 KB Output is correct
43 Correct 462 ms 89508 KB Output is correct
44 Correct 461 ms 89676 KB Output is correct
45 Correct 481 ms 90112 KB Output is correct
46 Correct 2 ms 9172 KB Output is correct
47 Correct 3 ms 9052 KB Output is correct
48 Correct 2 ms 9052 KB Output is correct
49 Correct 3 ms 9176 KB Output is correct
50 Correct 2 ms 9052 KB Output is correct
51 Correct 2 ms 9052 KB Output is correct
52 Correct 343 ms 89940 KB Output is correct
53 Correct 490 ms 88680 KB Output is correct
54 Correct 498 ms 98316 KB Output is correct
55 Correct 387 ms 84060 KB Output is correct
56 Correct 384 ms 84196 KB Output is correct
57 Correct 434 ms 84220 KB Output is correct
58 Correct 420 ms 84908 KB Output is correct
59 Correct 385 ms 96084 KB Output is correct
60 Correct 579 ms 96236 KB Output is correct
61 Correct 332 ms 85584 KB Output is correct
62 Correct 510 ms 82488 KB Output is correct
63 Correct 2 ms 9052 KB Output is correct
64 Correct 3 ms 9052 KB Output is correct
65 Correct 2 ms 9052 KB Output is correct
66 Correct 2 ms 9048 KB Output is correct
67 Correct 3 ms 9180 KB Output is correct
68 Correct 2 ms 9052 KB Output is correct
69 Correct 2 ms 9136 KB Output is correct
70 Correct 2 ms 9052 KB Output is correct
71 Correct 2 ms 9048 KB Output is correct
72 Correct 2 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 9052 KB Output is correct
78 Correct 2 ms 9052 KB Output is correct
79 Correct 579 ms 97880 KB Output is correct
80 Correct 1529 ms 93576 KB Output is correct
81 Correct 777 ms 94492 KB Output is correct
82 Correct 1196 ms 82576 KB Output is correct
83 Correct 2164 ms 82820 KB Output is correct
84 Correct 1471 ms 83240 KB Output is correct
85 Correct 396 ms 83392 KB Output is correct
86 Correct 589 ms 93468 KB Output is correct
87 Correct 1667 ms 96052 KB Output is correct
88 Correct 875 ms 82728 KB Output is correct
89 Correct 3910 ms 82500 KB Output is correct
90 Execution timed out 4022 ms 83104 KB Time limit exceeded
91 Halted 0 ms 0 KB -