oj.uz

Submission #944028

# Submission time Handle Problem Language Result Execution time Memory
944028 2024-03-12T07:14:17 Z vjudge1 Dynamic Diameter (CEOI19_diameter) C++17
49 / 100
 5000 ms 22220 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) x.begin(), x.end()
#define size(x) (int)x.size()

template<class S, class T>
bool chmin(S &a, const T &b) {
  return a > b ? (a = b) == b : false;
}
template<class S, class T>
bool chmax(S &a, const T &b) {
  return a < b ? (a = b) == b : false;
}

signed main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int n, q, w;
  cin >> n >> q >> w;
  int a[n], b[n], c[n];
  vector<pair<int, int>> g[n + 1];
  for (int i = 1; i < n; ++i) {
    cin >> a[i] >> b[i] >> c[i];
    g[a[i]].push_back({b[i], i});
    g[b[i]].push_back({a[i], i});
  }
  if (n <= 5000 && q <= 5000) {
    vector<vector<int>> dp(n + 1, vector<int> (3, 0));
    function<void(int, int)> dfs = [&](int v, int p) {
      dp[v][0] = dp[v][1] = dp[v][2] = 0;
      int max1 = 0, max2 = 0;
      for (auto [to, idx] : g[v]) {
        int cost = c[idx];
        if (to != p) {
          dfs(to, v);
          chmax(dp[v][0], dp[to][0]);
          chmax(dp[v][0], dp[to][1] + cost);
          chmax(dp[v][0], dp[to][2]);
          chmax(dp[v][1], dp[to][1] + cost);
          if (max1 < dp[to][1] + cost) {
            chmax(max2, max1);
            max1 = dp[to][1] + cost;
          } else chmax(max2, dp[to][1] + cost);
        }
      }
      dp[v][2] = max1 + max2;
    };
    int last = 0;
    while (q--) {
      int d, e; cin >> d >> e;
      d = (d + last) % (n - 1);
      e = (e + last) % w;
      d++;
      c[d] = e;
      dfs(1, -1);
      last = max({dp[1][0], dp[1][1], dp[1][2]});
      cout << last << '\n';
    }
  } else if (size(g[1]) == n - 1) {
    multiset<int> st;
    for (int i = 1; i < n; ++i) {
      st.insert(c[i]);
    }
    int last = 0;
    while (q--) {
      int d, e; cin >> d >> e;
      d = (d + last) % (n - 1);
      e = (e + last) % w;
      d++;
      st.erase(st.find(c[d]));
      st.insert(e);
      c[d] = e;
      if (size(st) == 1) {
        last = *st.rbegin();
      } else {
        int v = *st.rbegin();
        st.erase(--st.end());
        last = v + *st.rbegin();
        st.insert(v);
      }
      cout << last << '\n';
    }
  } else {
    vector<int> parent(n + 1, -1);
    function<void(int, int)> count_parents = [&](int v, int p) {
      parent[v] = p;
      for (auto [to, idx] : g[v]) {
        if (to != p) {
          count_parents(to, v);
        }
      }
    };
    count_parents(1, -1);
    vector<vector<int>> dp(n + 1, vector<int> (3, 0));
    function<void(int, int)> count_dp = [&](int v, int p) {
      dp[v][0] = dp[v][1] = dp[v][2] = 0;
      int max1 = 0, max2 = 0;
      for (auto [to, idx] : g[v]) {
        int cost = c[idx];
        if (to != p) {
          count_dp(to, v);
          chmax(dp[v][0], dp[to][0]);
          chmax(dp[v][0], dp[to][1] + cost);
          chmax(dp[v][0], dp[to][2]);
          chmax(dp[v][1], dp[to][1] + cost);
          if (max1 < dp[to][1] + cost) {
            chmax(max2, max1);
            max1 = dp[to][1] + cost;
          } else chmax(max2, dp[to][1] + cost);
        }
      }
      dp[v][2] = max1 + max2;
    };
    count_dp(1, -1);
    function<void(int)> upd = [&](int v) {
      if (v == -1) return;
      dp[v][0] = dp[v][1] = dp[v][2] = 0;
      int max1 = 0, max2 = 0;
      for (auto [to, idx] : g[v]) {
        int cost = c[idx];
        if (to != parent[v]) {
          chmax(dp[v][0], dp[to][0]);
          chmax(dp[v][0], dp[to][1] + cost);
          chmax(dp[v][0], dp[to][2]);
          chmax(dp[v][1], dp[to][1] + cost);
          if (max1 < dp[to][1] + cost) {
            chmax(max2, max1);
            max1 = dp[to][1] + cost;
          } else chmax(max2, dp[to][1] + cost);
        }
      }
      dp[v][2] = max1 + max2;
      upd(parent[v]);
    };
    int last = 0;
    while (q--) {
      int d, e; cin >> d >> e;
      d = (d + last) % (n - 1);
      e = (e + last) % w;
      d++;
      c[d] = e;
      if (parent[a[d]] == b[d]) upd(b[d]);
      else upd(a[d]);
      last = max({dp[1][0], dp[1][1], dp[1][2]});
      cout << last << '\n';
    }
  }
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 74 ms 620 KB Output is correct
20 Correct 83 ms 600 KB Output is correct
21 Correct 86 ms 604 KB Output is correct
22 Correct 98 ms 604 KB Output is correct
23 Correct 905 ms 1476 KB Output is correct
24 Correct 958 ms 1116 KB Output is correct
25 Correct 909 ms 1332 KB Output is correct
26 Correct 963 ms 2132 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 6 ms 348 KB Output is correct
5 Correct 30 ms 656 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 12 ms 348 KB Output is correct
10 Correct 7 ms 604 KB Output is correct
11 Correct 34 ms 940 KB Output is correct
12 Correct 2 ms 1116 KB Output is correct
13 Correct 2 ms 1116 KB Output is correct
14 Correct 3 ms 1116 KB Output is correct
15 Correct 10 ms 1116 KB Output is correct
16 Correct 42 ms 1480 KB Output is correct
17 Correct 54 ms 14524 KB Output is correct
18 Correct 43 ms 14404 KB Output is correct
19 Correct 47 ms 14412 KB Output is correct
20 Correct 56 ms 14528 KB Output is correct
21 Correct 117 ms 15092 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 616 KB Output is correct
2 Correct 4 ms 604 KB Output is correct
3 Correct 17 ms 1092 KB Output is correct
4 Correct 33 ms 1876 KB Output is correct
5 Correct 5 ms 2140 KB Output is correct
6 Correct 7 ms 2396 KB Output is correct
7 Correct 22 ms 3020 KB Output is correct
8 Correct 44 ms 3412 KB Output is correct
9 Correct 18 ms 9308 KB Output is correct
10 Correct 22 ms 9508 KB Output is correct
11 Correct 50 ms 10024 KB Output is correct
12 Correct 63 ms 10392 KB Output is correct
13 Correct 35 ms 17804 KB Output is correct
14 Correct 40 ms 17748 KB Output is correct
15 Correct 60 ms 18260 KB Output is correct
16 Correct 96 ms 19072 KB Output is correct
17 Correct 131 ms 18980 KB Output is correct

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 3275 ms 18108 KB Output is correct
2 Correct 3197 ms 22220 KB Output is correct
3 Correct 3364 ms 22060 KB Output is correct
4 Correct 4713 ms 22216 KB Output is correct
5 Execution timed out 5027 ms 20164 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 74 ms 620 KB Output is correct
20 Correct 83 ms 600 KB Output is correct
21 Correct 86 ms 604 KB Output is correct
22 Correct 98 ms 604 KB Output is correct
23 Correct 905 ms 1476 KB Output is correct
24 Correct 958 ms 1116 KB Output is correct
25 Correct 909 ms 1332 KB Output is correct
26 Correct 963 ms 2132 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 6 ms 348 KB Output is correct
31 Correct 30 ms 656 KB Output is correct
32 Correct 0 ms 604 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 2 ms 344 KB Output is correct
35 Correct 12 ms 348 KB Output is correct
36 Correct 7 ms 604 KB Output is correct
37 Correct 34 ms 940 KB Output is correct
38 Correct 2 ms 1116 KB Output is correct
39 Correct 2 ms 1116 KB Output is correct
40 Correct 3 ms 1116 KB Output is correct
41 Correct 10 ms 1116 KB Output is correct
42 Correct 42 ms 1480 KB Output is correct
43 Correct 54 ms 14524 KB Output is correct
44 Correct 43 ms 14404 KB Output is correct
45 Correct 47 ms 14412 KB Output is correct
46 Correct 56 ms 14528 KB Output is correct
47 Correct 117 ms 15092 KB Output is correct
48 Correct 13 ms 616 KB Output is correct
49 Correct 4 ms 604 KB Output is correct
50 Correct 17 ms 1092 KB Output is correct
51 Correct 33 ms 1876 KB Output is correct
52 Correct 5 ms 2140 KB Output is correct
53 Correct 7 ms 2396 KB Output is correct
54 Correct 22 ms 3020 KB Output is correct
55 Correct 44 ms 3412 KB Output is correct
56 Correct 18 ms 9308 KB Output is correct
57 Correct 22 ms 9508 KB Output is correct
58 Correct 50 ms 10024 KB Output is correct
59 Correct 63 ms 10392 KB Output is correct
60 Correct 35 ms 17804 KB Output is correct
61 Correct 40 ms 17748 KB Output is correct
62 Correct 60 ms 18260 KB Output is correct
63 Correct 96 ms 19072 KB Output is correct
64 Correct 131 ms 18980 KB Output is correct
65 Correct 3275 ms 18108 KB Output is correct
66 Correct 3197 ms 22220 KB Output is correct
67 Correct 3364 ms 22060 KB Output is correct
68 Correct 4713 ms 22216 KB Output is correct
69 Execution timed out 5027 ms 20164 KB Time limit exceeded
70 Halted 0 ms 0 KB -