oj.uz

Submission #945417

# Submission time Handle Problem Language Result Execution time Memory
945417 2024-03-13T18:46:07 Z dorjderem Dynamic Diameter (CEOI19_diameter) C++17
24 / 100
 5000 ms 16332 KB 
#include <algorithm>
#include <iostream>
#include <unordered_map>
#include <vector>

using namespace std;

#define endl "\n"
#define ll long long

const int MOD = 1e9 + 7;
const int mx = 1e5 + 10;
unordered_map<ll, ll> cost[mx];
vector<ll> tree[mx];
ll ans = 0;

ll dfs(ll node, vector<bool> &vis) {
  vis[node] = 1;
  ll one = -1, second = -1;
  for (ll nex : tree[node]) {
    if (vis[nex] == 0) {
      ll val = cost[node][nex] + dfs(nex, vis);
      if (val >= one) {
        second = one;
        one = val;
      } else if (val > second) {
        second = val;
      }
    }
  }
  if (one == -1 && second == -1) {
    return 0;
  } else if (second == -1) {
    ans = max(ans, one);
  } else {
    ans = max(ans, one + second);
  }
  return one;
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ll n, q, w;
  cin >> n >> q >> w;
  vector<pair<ll, ll>> arr(n);
  for (int i = 0; i < n - 1; i++) {
    int a, b, c;
    cin >> a >> b >> c;
    tree[a].push_back(b);
    tree[b].push_back(a);
    cost[a][b] = c;
    cost[b][a] = c;
    arr[i] = {a, b};
  }

  ll last = 0;
  while (q--) {
    ll d, e;
    cin >> d >> e;
    d = (d + last) % (n - 1);
    e = (e + last) % w;
    pair<ll, ll> c = arr[d];
    cost[c.first][c.second] = e;
    cost[c.second][c.first] = e;
    // dp method
    // build up from root nodes of tree
    vector<bool> vis(n + 1, 0);
    ans = 0;
    dfs(1, vis);
    last = ans;
    cout << ans << endl;
  }

  return 0;
}

// what if its star?
// does it make any difference?

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8284 KB Output is correct
2 Correct 2 ms 8284 KB Output is correct
3 Correct 3 ms 8072 KB Output is correct
4 Correct 3 ms 8040 KB Output is correct
5 Correct 3 ms 8044 KB Output is correct
6 Correct 3 ms 8284 KB Output is correct
7 Correct 3 ms 8284 KB Output is correct
8 Correct 2 ms 8284 KB Output is correct
9 Correct 2 ms 8088 KB Output is correct
10 Correct 3 ms 8284 KB Output is correct
11 Correct 2 ms 8284 KB Output is correct
12 Correct 2 ms 8284 KB Output is correct
13 Correct 3 ms 8120 KB Output is correct
14 Correct 2 ms 8284 KB Output is correct
15 Correct 3 ms 8284 KB Output is correct
16 Correct 3 ms 8284 KB Output is correct
17 Correct 3 ms 8284 KB Output is correct
18 Correct 3 ms 8280 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8284 KB Output is correct
2 Correct 2 ms 8284 KB Output is correct
3 Correct 3 ms 8072 KB Output is correct
4 Correct 3 ms 8040 KB Output is correct
5 Correct 3 ms 8044 KB Output is correct
6 Correct 3 ms 8284 KB Output is correct
7 Correct 3 ms 8284 KB Output is correct
8 Correct 2 ms 8284 KB Output is correct
9 Correct 2 ms 8088 KB Output is correct
10 Correct 3 ms 8284 KB Output is correct
11 Correct 2 ms 8284 KB Output is correct
12 Correct 2 ms 8284 KB Output is correct
13 Correct 3 ms 8120 KB Output is correct
14 Correct 2 ms 8284 KB Output is correct
15 Correct 3 ms 8284 KB Output is correct
16 Correct 3 ms 8284 KB Output is correct
17 Correct 3 ms 8284 KB Output is correct
18 Correct 3 ms 8280 KB Output is correct
19 Correct 76 ms 8540 KB Output is correct
20 Correct 78 ms 8564 KB Output is correct
21 Correct 80 ms 8800 KB Output is correct
22 Correct 100 ms 8604 KB Output is correct
23 Correct 924 ms 9780 KB Output is correct
24 Correct 916 ms 9524 KB Output is correct
25 Correct 1000 ms 9600 KB Output is correct
26 Correct 862 ms 10076 KB Output is correct

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8284 KB Output is correct
2 Correct 3 ms 8284 KB Output is correct
3 Correct 4 ms 8300 KB Output is correct
4 Correct 11 ms 8432 KB Output is correct
5 Correct 45 ms 9308 KB Output is correct
6 Correct 4 ms 8284 KB Output is correct
7 Correct 4 ms 8284 KB Output is correct
8 Correct 3 ms 8284 KB Output is correct
9 Correct 13 ms 8280 KB Output is correct
10 Correct 107 ms 8532 KB Output is correct
11 Correct 519 ms 9552 KB Output is correct
12 Correct 5 ms 9308 KB Output is correct
13 Correct 15 ms 9532 KB Output is correct
14 Correct 121 ms 9528 KB Output is correct
15 Correct 1123 ms 9864 KB Output is correct
16 Execution timed out 5013 ms 10884 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 8540 KB Output is correct
2 Correct 161 ms 8796 KB Output is correct
3 Correct 642 ms 9044 KB Output is correct
4 Correct 1327 ms 9884 KB Output is correct
5 Correct 167 ms 10548 KB Output is correct
6 Correct 1627 ms 11092 KB Output is correct
7 Execution timed out 5038 ms 11540 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5031 ms 16332 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8284 KB Output is correct
2 Correct 2 ms 8284 KB Output is correct
3 Correct 3 ms 8072 KB Output is correct
4 Correct 3 ms 8040 KB Output is correct
5 Correct 3 ms 8044 KB Output is correct
6 Correct 3 ms 8284 KB Output is correct
7 Correct 3 ms 8284 KB Output is correct
8 Correct 2 ms 8284 KB Output is correct
9 Correct 2 ms 8088 KB Output is correct
10 Correct 3 ms 8284 KB Output is correct
11 Correct 2 ms 8284 KB Output is correct
12 Correct 2 ms 8284 KB Output is correct
13 Correct 3 ms 8120 KB Output is correct
14 Correct 2 ms 8284 KB Output is correct
15 Correct 3 ms 8284 KB Output is correct
16 Correct 3 ms 8284 KB Output is correct
17 Correct 3 ms 8284 KB Output is correct
18 Correct 3 ms 8280 KB Output is correct
19 Correct 76 ms 8540 KB Output is correct
20 Correct 78 ms 8564 KB Output is correct
21 Correct 80 ms 8800 KB Output is correct
22 Correct 100 ms 8604 KB Output is correct
23 Correct 924 ms 9780 KB Output is correct
24 Correct 916 ms 9524 KB Output is correct
25 Correct 1000 ms 9600 KB Output is correct
26 Correct 862 ms 10076 KB Output is correct
27 Correct 2 ms 8284 KB Output is correct
28 Correct 3 ms 8284 KB Output is correct
29 Correct 4 ms 8300 KB Output is correct
30 Correct 11 ms 8432 KB Output is correct
31 Correct 45 ms 9308 KB Output is correct
32 Correct 4 ms 8284 KB Output is correct
33 Correct 4 ms 8284 KB Output is correct
34 Correct 3 ms 8284 KB Output is correct
35 Correct 13 ms 8280 KB Output is correct
36 Correct 107 ms 8532 KB Output is correct
37 Correct 519 ms 9552 KB Output is correct
38 Correct 5 ms 9308 KB Output is correct
39 Correct 15 ms 9532 KB Output is correct
40 Correct 121 ms 9528 KB Output is correct
41 Correct 1123 ms 9864 KB Output is correct
42 Execution timed out 5013 ms 10884 KB Time limit exceeded
43 Halted 0 ms 0 KB -