oj.uz

Submission #531155

# Submission time Handle Problem Language Result Execution time Memory
531155 2022-02-27T21:30:13 Z Alex_tz307 Dynamic Diameter (CEOI19_diameter) C++17
49 / 100
 5000 ms 367980 KB 
#include <bits/stdc++.h>

using namespace std;

const int kN = 1e5;
multiset<int64_t> diameters;

void maxSelf(int64_t &x, int64_t y) {
  if (x < y) {
    x = y;
  }
}

struct Centroid {
  int n, root, timer;
  vector<int> nodes, tin, tout, child;
  vector<tuple<int, int, int64_t>> edges;
  vector<vector<int>> g;
  vector<int64_t> wt, dp, maxDist, dpLin;
  multiset<int64_t> paths;

  struct ST {
    int n;
    vector<int64_t> t, lazy, dp;

    void init(int N, const vector<int64_t> &aux) {
      n = N;
      int dim = 1;
      while (dim < n) {
        dim *= 2;
      }
      dim *= 2;
      t.resize(dim);
      lazy.resize(dim);
      dp = aux;
    }

    void build(int x, int lx, int rx) {
      if (lx == rx) {
        t[x] = dp[lx];
        return;
      }
      int mid = (lx + rx) / 2;
      build(x * 2, lx, mid);
      build(x * 2 + 1, mid + 1, rx);
      t[x] = max(t[x * 2], t[x * 2 + 1]);
    }

    void updateNode(int x, int64_t v) {
      t[x] += v;
      lazy[x] += v;
    }

    void push(int x) {
      if (lazy[x] == 0) {
        return;
      }
      for (int i = 0; i < 2; ++i) {
        updateNode(x * 2 + i, lazy[x]);
      }
      lazy[x] = 0;
    }

    void update(int x, int lx, int rx, int st, int dr, int64_t v) {
      if (st <= lx && rx <= dr) {
        updateNode(x, v);
        return;
      }
      push(x);
      int mid = (lx + rx) / 2;
      if (st <= mid) {
        update(x * 2, lx, mid, st, dr, v);
      }
      if (mid < dr) {
        update(x * 2 + 1, mid + 1, rx, st, dr, v);
      }
      t[x] = max(t[x * 2], t[x * 2 + 1]);
    }

    void update(int st, int dr, int64_t v) {
      update(1, 1, n, st, dr, v);
    }

    int64_t query(int x, int lx, int rx, int st, int dr) {
      if (st <= lx && rx <= dr) {
        return t[x];
      }
      push(x);
      int mid = (lx + rx) / 2;
      int64_t ans = 0;
      if (st <= mid) {
        maxSelf(ans, query(x * 2, lx, mid, st, dr));
      }
      if (mid < dr) {
        maxSelf(ans, query(x * 2 + 1, mid + 1, rx, st, dr));
      }
      return ans;
    }

    int64_t query(int st, int dr) {
      return query(1, 1, n, st, dr);
    }
  } t;

  void setRoot(int v) {
    root = v;
  }

  void addNode(int v) {
    nodes.emplace_back(v);
  }

  void addEdge(int u, int v, int64_t w) {
    edges.emplace_back(u, v, w);
  }

  int getIndex(int v) {
    return distance(nodes.begin(), upper_bound(nodes.begin(), nodes.end(), v));
  }

  void dfs(int u, int par) {
    tin[u] = ++timer;
    maxDist[u] = dp[u];
    for (int v : g[u]) {
      if (v != par) {
        if (par == 0) {
          child[v] = v;
        } else {
          child[v] = child[u];
        }
        dp[v] = dp[u] + wt[v];
        dfs(v, u);
        maxSelf(maxDist[u], maxDist[v]);
      }
    }
    tout[u] = timer;
  }

  int64_t getDiameter() {
    auto it = paths.end();
    --it;
    int64_t len = *it;
    if ((int)paths.size() >= 2) {
      --it;
      len += *it;
    }
    return len;
  }

  void addDiameter() {
    diameters.emplace(getDiameter());
  }

  void removeDiameter() {
    diameters.erase(diameters.find(getDiameter()));
  }

  void build() {
    sort(nodes.begin(), nodes.end());
    root = getIndex(root);
    n = nodes.size();
    g.resize(n + 1);
    wt.resize(n + 1);
    for (auto it : edges) {
      int u, v;
      int64_t w;
      tie(u, v, w) = it;
      u = getIndex(u);
      v = getIndex(v);
      g[u].emplace_back(v);
      wt[v] = w;
    }
    edges.clear();
    timer = 0;
    tin.resize(n + 1);
    tout.resize(n + 1);
    dp.resize(n + 1);
    maxDist.resize(n + 1);
    child.resize(n + 1);
    dfs(root, 0);
    dpLin.resize(n + 1);
    for (int v = 1; v <= n; ++v) {
      dpLin[tin[v]] = dp[v];
    }
    t.init(n, dpLin);
    t.build(1, 1, n);
    for (int v : g[root]) {
      paths.emplace(maxDist[v]);
    }
    dp.clear();
    dpLin.clear();
    maxDist.clear();
    addDiameter();
  }

  void updateEdge(int v, int64_t w) {
    removeDiameter();
    v = getIndex(v);
    int son = child[v];
    paths.erase(paths.find(t.query(tin[son], tout[son])));
    t.update(tin[v], tout[v], w - wt[v]);
    wt[v] = w;
    paths.emplace(t.query(tin[son], tout[son]));
    addDiameter();
  }
} C[1 + kN];

int sz[1 + kN];
vector<pair<int, int64_t>> g[1 + kN];
pair<int, int> edges[1 + kN];
bitset<1 + kN> vis;
map<pair<int, int>, vector<int>> centroids;

void findSize(int u, int par) {
  sz[u] = 1;
  for (auto it : g[u]) {
    int v = it.first;
    if (!vis[v] && v != par) {
      findSize(v, u);
      sz[u] += sz[v];
    }
  }
}

int findCentroid(int u, int par, int n) {
  for (auto it : g[u]) {
    int v = it.first;
    if (!vis[v] && v != par && sz[v] > n / 2) {
      return findCentroid(v, u, n);
    }
  }
  return u;
}

void dfs(int u, int par, int centroid) {
  if (par) {
    centroids[{par, u}].emplace_back(centroid);
  }
  C[centroid].addNode(u);
  for (auto it : g[u]) {
    int v;
    int64_t w;
    tie(v, w) = it;
    if (!vis[v] && v != par) {
      C[centroid].addEdge(u, v, w);
      dfs(v, u, centroid);
    }
  }
}

void build(int u) {
  findSize(u, 0);
  if (sz[u] == 1) {
    return;
  }
  int c = findCentroid(u, 0, sz[u]);
  vis[c] = true;
  C[c].setRoot(c);
  dfs(c, 0, c);
  C[c].build();
  for (auto it : g[c]) {
    int v = it.first;
    if (!vis[v]) {
      build(v);
    }
  }
}

void testCase() {
  int n, q;
  int64_t W;
  cin >> n >> q >> W;
  for (int i = 1; i < n; ++i) {
    int u, v;
    int64_t w;
    cin >> u >> v >> w;
    g[u].emplace_back(v, w);
    g[v].emplace_back(u, w);
    edges[i] = {u, v};
  }
  build(1);
  int64_t last = 0;
  for (int i = 1; i <= q; ++i) {
    int d;
    int64_t w;
    cin >> d >> w;
    d = (last + d) % (n - 1);
    w = (last + w) % W;
    d += 1;
    int u, v;
    tie(u, v) = edges[d];
    for (int c : centroids[{u, v}]) {
      C[c].updateEdge(v, w);
    }
    for (int c : centroids[{v, u}]) {
      C[c].updateEdge(u, w);
    }
    last = *diameters.rbegin();
    cout << last << '\n';
  }
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int tests = 1;
  for (int tc = 0; tc < tests; ++tc) {
    testCase();
  }
  return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 40204 KB Output is correct
2 Correct 21 ms 40240 KB Output is correct
3 Correct 18 ms 40140 KB Output is correct
4 Correct 21 ms 40148 KB Output is correct
5 Correct 28 ms 40260 KB Output is correct
6 Correct 18 ms 40224 KB Output is correct
7 Correct 20 ms 40232 KB Output is correct
8 Correct 21 ms 40168 KB Output is correct
9 Correct 20 ms 40288 KB Output is correct
10 Correct 19 ms 40260 KB Output is correct
11 Correct 32 ms 40180 KB Output is correct
12 Correct 25 ms 40232 KB Output is correct
13 Correct 24 ms 40332 KB Output is correct
14 Correct 20 ms 40268 KB Output is correct
15 Correct 19 ms 40244 KB Output is correct
16 Correct 32 ms 40260 KB Output is correct
17 Correct 18 ms 40320 KB Output is correct
18 Correct 20 ms 40388 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 40204 KB Output is correct
2 Correct 21 ms 40240 KB Output is correct
3 Correct 18 ms 40140 KB Output is correct
4 Correct 21 ms 40148 KB Output is correct
5 Correct 28 ms 40260 KB Output is correct
6 Correct 18 ms 40224 KB Output is correct
7 Correct 20 ms 40232 KB Output is correct
8 Correct 21 ms 40168 KB Output is correct
9 Correct 20 ms 40288 KB Output is correct
10 Correct 19 ms 40260 KB Output is correct
11 Correct 32 ms 40180 KB Output is correct
12 Correct 25 ms 40232 KB Output is correct
13 Correct 24 ms 40332 KB Output is correct
14 Correct 20 ms 40268 KB Output is correct
15 Correct 19 ms 40244 KB Output is correct
16 Correct 32 ms 40260 KB Output is correct
17 Correct 18 ms 40320 KB Output is correct
18 Correct 20 ms 40388 KB Output is correct
19 Correct 39 ms 41556 KB Output is correct
20 Correct 55 ms 41668 KB Output is correct
21 Correct 54 ms 41768 KB Output is correct
22 Correct 52 ms 42188 KB Output is correct
23 Correct 68 ms 47348 KB Output is correct
24 Correct 115 ms 49360 KB Output is correct
25 Correct 106 ms 50596 KB Output is correct
26 Correct 112 ms 53148 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 40140 KB Output is correct
2 Correct 19 ms 40244 KB Output is correct
3 Correct 20 ms 40260 KB Output is correct
4 Correct 31 ms 40380 KB Output is correct
5 Correct 89 ms 41388 KB Output is correct
6 Correct 19 ms 40156 KB Output is correct
7 Correct 32 ms 40412 KB Output is correct
8 Correct 23 ms 40432 KB Output is correct
9 Correct 31 ms 40404 KB Output is correct
10 Correct 43 ms 40632 KB Output is correct
11 Correct 115 ms 41780 KB Output is correct
12 Correct 23 ms 42060 KB Output is correct
13 Correct 23 ms 42060 KB Output is correct
14 Correct 31 ms 42176 KB Output is correct
15 Correct 55 ms 42728 KB Output is correct
16 Correct 168 ms 43892 KB Output is correct
17 Correct 127 ms 76708 KB Output is correct
18 Correct 163 ms 76748 KB Output is correct
19 Correct 142 ms 76920 KB Output is correct
20 Correct 195 ms 77652 KB Output is correct
21 Correct 551 ms 82272 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 41744 KB Output is correct
2 Correct 54 ms 41868 KB Output is correct
3 Correct 198 ms 42404 KB Output is correct
4 Correct 341 ms 43192 KB Output is correct
5 Correct 82 ms 60356 KB Output is correct
6 Correct 145 ms 60688 KB Output is correct
7 Correct 380 ms 61716 KB Output is correct
8 Correct 723 ms 62540 KB Output is correct
9 Correct 435 ms 158060 KB Output is correct
10 Correct 474 ms 158436 KB Output is correct
11 Correct 910 ms 159696 KB Output is correct
12 Correct 1449 ms 161156 KB Output is correct
13 Correct 828 ms 289960 KB Output is correct
14 Correct 948 ms 290428 KB Output is correct
15 Correct 1432 ms 291948 KB Output is correct
16 Correct 2172 ms 293528 KB Output is correct
17 Correct 3850 ms 294696 KB Output is correct

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 3658 ms 255588 KB Output is correct
2 Correct 3691 ms 262188 KB Output is correct
3 Correct 3544 ms 258748 KB Output is correct
4 Correct 3700 ms 261016 KB Output is correct
5 Correct 3524 ms 247056 KB Output is correct
6 Correct 2947 ms 173524 KB Output is correct
7 Correct 4550 ms 318240 KB Output is correct
8 Correct 4568 ms 318052 KB Output is correct
9 Correct 4521 ms 317972 KB Output is correct
10 Correct 4468 ms 316292 KB Output is correct
11 Correct 4305 ms 298652 KB Output is correct
12 Correct 3640 ms 205740 KB Output is correct
13 Correct 4892 ms 364040 KB Output is correct
14 Correct 4907 ms 367864 KB Output is correct
15 Correct 4834 ms 367824 KB Output is correct
16 Correct 4934 ms 365932 KB Output is correct
17 Correct 4652 ms 343944 KB Output is correct
18 Correct 3622 ms 228316 KB Output is correct
19 Correct 4822 ms 367980 KB Output is correct
20 Correct 4944 ms 367980 KB Output is correct
21 Execution timed out 5004 ms 367900 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 40204 KB Output is correct
2 Correct 21 ms 40240 KB Output is correct
3 Correct 18 ms 40140 KB Output is correct
4 Correct 21 ms 40148 KB Output is correct
5 Correct 28 ms 40260 KB Output is correct
6 Correct 18 ms 40224 KB Output is correct
7 Correct 20 ms 40232 KB Output is correct
8 Correct 21 ms 40168 KB Output is correct
9 Correct 20 ms 40288 KB Output is correct
10 Correct 19 ms 40260 KB Output is correct
11 Correct 32 ms 40180 KB Output is correct
12 Correct 25 ms 40232 KB Output is correct
13 Correct 24 ms 40332 KB Output is correct
14 Correct 20 ms 40268 KB Output is correct
15 Correct 19 ms 40244 KB Output is correct
16 Correct 32 ms 40260 KB Output is correct
17 Correct 18 ms 40320 KB Output is correct
18 Correct 20 ms 40388 KB Output is correct
19 Correct 39 ms 41556 KB Output is correct
20 Correct 55 ms 41668 KB Output is correct
21 Correct 54 ms 41768 KB Output is correct
22 Correct 52 ms 42188 KB Output is correct
23 Correct 68 ms 47348 KB Output is correct
24 Correct 115 ms 49360 KB Output is correct
25 Correct 106 ms 50596 KB Output is correct
26 Correct 112 ms 53148 KB Output is correct
27 Correct 25 ms 40140 KB Output is correct
28 Correct 19 ms 40244 KB Output is correct
29 Correct 20 ms 40260 KB Output is correct
30 Correct 31 ms 40380 KB Output is correct
31 Correct 89 ms 41388 KB Output is correct
32 Correct 19 ms 40156 KB Output is correct
33 Correct 32 ms 40412 KB Output is correct
34 Correct 23 ms 40432 KB Output is correct
35 Correct 31 ms 40404 KB Output is correct
36 Correct 43 ms 40632 KB Output is correct
37 Correct 115 ms 41780 KB Output is correct
38 Correct 23 ms 42060 KB Output is correct
39 Correct 23 ms 42060 KB Output is correct
40 Correct 31 ms 42176 KB Output is correct
41 Correct 55 ms 42728 KB Output is correct
42 Correct 168 ms 43892 KB Output is correct
43 Correct 127 ms 76708 KB Output is correct
44 Correct 163 ms 76748 KB Output is correct
45 Correct 142 ms 76920 KB Output is correct
46 Correct 195 ms 77652 KB Output is correct
47 Correct 551 ms 82272 KB Output is correct
48 Correct 37 ms 41744 KB Output is correct
49 Correct 54 ms 41868 KB Output is correct
50 Correct 198 ms 42404 KB Output is correct
51 Correct 341 ms 43192 KB Output is correct
52 Correct 82 ms 60356 KB Output is correct
53 Correct 145 ms 60688 KB Output is correct
54 Correct 380 ms 61716 KB Output is correct
55 Correct 723 ms 62540 KB Output is correct
56 Correct 435 ms 158060 KB Output is correct
57 Correct 474 ms 158436 KB Output is correct
58 Correct 910 ms 159696 KB Output is correct
59 Correct 1449 ms 161156 KB Output is correct
60 Correct 828 ms 289960 KB Output is correct
61 Correct 948 ms 290428 KB Output is correct
62 Correct 1432 ms 291948 KB Output is correct
63 Correct 2172 ms 293528 KB Output is correct
64 Correct 3850 ms 294696 KB Output is correct
65 Correct 3658 ms 255588 KB Output is correct
66 Correct 3691 ms 262188 KB Output is correct
67 Correct 3544 ms 258748 KB Output is correct
68 Correct 3700 ms 261016 KB Output is correct
69 Correct 3524 ms 247056 KB Output is correct
70 Correct 2947 ms 173524 KB Output is correct
71 Correct 4550 ms 318240 KB Output is correct
72 Correct 4568 ms 318052 KB Output is correct
73 Correct 4521 ms 317972 KB Output is correct
74 Correct 4468 ms 316292 KB Output is correct
75 Correct 4305 ms 298652 KB Output is correct
76 Correct 3640 ms 205740 KB Output is correct
77 Correct 4892 ms 364040 KB Output is correct
78 Correct 4907 ms 367864 KB Output is correct
79 Correct 4834 ms 367824 KB Output is correct
80 Correct 4934 ms 365932 KB Output is correct
81 Correct 4652 ms 343944 KB Output is correct
82 Correct 3622 ms 228316 KB Output is correct
83 Correct 4822 ms 367980 KB Output is correct
84 Correct 4944 ms 367980 KB Output is correct
85 Execution timed out 5004 ms 367900 KB Time limit exceeded
86 Halted 0 ms 0 KB -