oj.uz

답안 #944005

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
944005 2024-03-12T06:30:29 Z vjudge1 Dynamic Diameter (CEOI19_diameter) C++17
31 / 100
 1039 ms 11512 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];
  for (int i = 1; i < n; ++i) {
    cin >> a[i] >> b[i] >> c[i];
  }
  if (n <= 5000 && q <= 5000) {
    vector<pair<int, int>> g[n + 1];
    vector<vector<int>> dp(n + 1, vector<int> (3, 0));
    for (int i = 1; i < n; ++i) {
      g[a[i]].push_back({b[i], i});
      g[b[i]].push_back({a[i], i});
    }
    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 {
    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';
    }
  }
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 352 KB Output is correct
3 Correct 0 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 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 352 KB Output is correct
3 Correct 0 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 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 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 664 KB Output is correct
20 Correct 81 ms 904 KB Output is correct
21 Correct 84 ms 604 KB Output is correct
22 Correct 96 ms 1000 KB Output is correct
23 Correct 888 ms 1332 KB Output is correct
24 Correct 960 ms 1376 KB Output is correct
25 Correct 988 ms 1460 KB Output is correct
26 Correct 1039 ms 2052 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 472 KB Output is correct
4 Correct 8 ms 604 KB Output is correct
5 Correct 33 ms 1352 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 2 ms 536 KB Output is correct
9 Correct 12 ms 552 KB Output is correct
10 Correct 8 ms 616 KB Output is correct
11 Correct 37 ms 1680 KB Output is correct
12 Correct 2 ms 868 KB Output is correct
13 Correct 2 ms 728 KB Output is correct
14 Correct 3 ms 872 KB Output is correct
15 Correct 13 ms 1112 KB Output is correct
16 Correct 53 ms 2280 KB Output is correct
17 Correct 40 ms 8128 KB Output is correct
18 Correct 37 ms 8176 KB Output is correct
19 Correct 39 ms 8116 KB Output is correct
20 Correct 67 ms 8604 KB Output is correct
21 Correct 134 ms 9256 KB Output is correct

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 632 KB Output is correct
2 Incorrect 5 ms 604 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 126 ms 11512 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 352 KB Output is correct
3 Correct 0 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 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 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 664 KB Output is correct
20 Correct 81 ms 904 KB Output is correct
21 Correct 84 ms 604 KB Output is correct
22 Correct 96 ms 1000 KB Output is correct
23 Correct 888 ms 1332 KB Output is correct
24 Correct 960 ms 1376 KB Output is correct
25 Correct 988 ms 1460 KB Output is correct
26 Correct 1039 ms 2052 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 472 KB Output is correct
30 Correct 8 ms 604 KB Output is correct
31 Correct 33 ms 1352 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 460 KB Output is correct
34 Correct 2 ms 536 KB Output is correct
35 Correct 12 ms 552 KB Output is correct
36 Correct 8 ms 616 KB Output is correct
37 Correct 37 ms 1680 KB Output is correct
38 Correct 2 ms 868 KB Output is correct
39 Correct 2 ms 728 KB Output is correct
40 Correct 3 ms 872 KB Output is correct
41 Correct 13 ms 1112 KB Output is correct
42 Correct 53 ms 2280 KB Output is correct
43 Correct 40 ms 8128 KB Output is correct
44 Correct 37 ms 8176 KB Output is correct
45 Correct 39 ms 8116 KB Output is correct
46 Correct 67 ms 8604 KB Output is correct
47 Correct 134 ms 9256 KB Output is correct
48 Correct 15 ms 632 KB Output is correct
49 Incorrect 5 ms 604 KB Output isn't correct
50 Halted 0 ms 0 KB -