oj.uz

Submission #689341

# Submission time Handle Problem Language Result Execution time Memory
689341 2023-01-28T09:18:49 Z 600Mihnea Dynamic Diameter (CEOI19_diameter) C++17
31 / 100
 5000 ms 180252 KB 
bool home = 0;
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
const ll INF = (ll)1e18 + 7;


struct SegmentTree {
  vector<ll> tree;
  vector<ll> lazy;
  int n;

  void init(int nn) {
    n = nn;
    tree.resize(4 * (n + 7), 0);
    lazy.resize(4 * (n + 7), 0);
  }

  void push(int v, int tl, int tr) {
    if (lazy[v]) {
      tree[v] += lazy[v];
      if (tl < tr) {
        lazy[2 * v] += lazy[v];
        lazy[2 * v + 1] += lazy[v];
      }
      lazy[v] = 0;
    }
  }

  void add(int v, int tl, int tr, int l, int r, ll x) {
    push(v, tl, tr);
    if (tr < l || r < tl) {
      return;
    }
    if (l <= tl && tr <= r) {
      lazy[v] += x;
      push(v, tl, tr);
      return;
    }
    int tm = (tl + tr) / 2;
    add(2 * v, tl, tm, l, r, x);
    add(2 * v + 1, tm + 1, tr, l, r, x);
    tree[v] = max(tree[2 * v], tree[2 * v + 1]);
  }

  ll getmax(int v, int tl, int tr, int l, int r) {
    push(v, tl, tr);
    if (tr < l || r < tl) {
      return -INF;
    }
    if (l <= tl && tr <= r) {
      return tree[v];
    }
    int tm = (tl + tr) / 2;
    return max(getmax(2 * v, tl, tm, l, r), getmax(2 * v + 1, tm + 1, tr, l, r));
  }

  void add(int l, int r, ll x) {
    add(1, 1, n, l, r, x);
  }

  ll getmax(int l, int r) {
    return getmax(1, 1, n, l, r);;
  }
};

const int N = (int)1e5 + 7;
const int K = 20;
int n;
int q;
ll w;
int sum_edge[N];
ll val_edge[N];
vector<int> gindex[N];
SegmentTree trees[K];
bool blocked[N];
int sub[N];
int total_under;

void build_sub(int a, int p = -1) {
  sub[a] = 1;
  for (auto& I : gindex[a]) {
    int b = sum_edge[I] - a;
    if (b == p || blocked[b]) {
      continue;
    }
    build_sub(b, a);
    sub[a] += sub[b];
  }
}

int fcen(int a, int p = -1) {
  int mx = total_under - sub[a];
  for (auto& I : gindex[a]) {
    int b = sum_edge[I] - a;
    if (b == p || blocked[b]) {
      continue;
    }
    mx = max(mx, sub[b]);
  }
  if (mx <= total_under / 2) {
    return a;
  }
  for (auto& I : gindex[a]) {
    int b = sum_edge[I] - a;
    if (b == p || blocked[b]) {
      continue;
    }
    if (mx == sub[b]) {
      return fcen(b, a);
    }
  }
}

int low[K][N];
int high[K][N];
int ord[K][N];
int where[K][N];
int vrt[K][N];
int top[K];

vector<ll> all;
vector<int> where2;
vector<pair<int, int>> seg;
vector<multiset<ll>> s;
int kek = -1;
int kek2 = -1;

multiset<int> tog;

void prep(int a, int p, int level) {
  sub[a] = 1;
  ord[level][++top[level]] = a;
  low[level][a] = top[level];
  for (auto& I : gindex[a]) {
    int b = sum_edge[I] - a;
    if (b == p || blocked[b]) {
      continue;
    }
    where[level][I] = kek;
    vrt[level][I] = b;
    prep(b, a, level);
    sub[a] += sub[b];
  }
  high[level][a] = top[level];
}

void add(int i, ll delta) {
  for (int level = 0; level < K; level++) {
    if (level != 0) {
      ///continue; /// delete this line urgently !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
    }
    if (where[level][i] == -1) {
      continue;
    }
    int b = vrt[level][i];
    int l = low[level][b], r = high[level][b];

    {
      ll cur = 0;
      if ((int)s[where2[where[level][i]]].size() == 0) {}
      else
        if ((int)s[where2[where[level][i]]].size() == 1) {
          cur = *s[where2[where[level][i]]].begin();
        }
        else {
          auto it = s[where2[where[level][i]]].end();
          it--;
          cur += *it;
          it--;
          cur += *it;
        }
      if (tog.count(cur)) {
        tog.erase(tog.find(cur));
      }
    }
    s[where2[where[level][i]]].erase(s[where2[where[level][i]]].find(trees[level].getmax(seg[where[level][i]].first, seg[where[level][i]].second)));
    trees[level].add(l, r, delta);
    all[where[level][i]] = trees[level].getmax(seg[where[level][i]].first, seg[where[level][i]].second);
    s[where2[where[level][i]]].insert(trees[level].getmax(seg[where[level][i]].first, seg[where[level][i]].second));

    {
      ll cur = 0;
      if ((int)s[where2[where[level][i]]].size() == 0) {}
      else
        if ((int)s[where2[where[level][i]]].size() == 1) {
          cur = *s[where2[where[level][i]]].begin();
        }
        else {
          auto it = s[where2[where[level][i]]].end();
          it--;
          cur += *it;
          it--;
          cur += *it;
        }
      tog.insert(cur);
    }

  }
}

void build_centroid(int a, int level) {
  assert(level < 20);
  build_sub(a);
  total_under = sub[a];
  a = fcen(a);
  blocked[a] = 1;

  kek2++;
  s.push_back({});

  for (auto& I : gindex[a]) {
    int b = sum_edge[I] - a;
    if (blocked[b]) {
      continue;
    }

    kek++;
    all.push_back(0);
    vrt[level][I] = b;
    where[level][I] = kek;
    prep(b, a, level);
    seg.push_back({ low[level][b], high[level][b] });
    where2.push_back(kek2);
    s.back().insert(0);
  }

  for (auto& I : gindex[a]) {
    int b = sum_edge[I] - a;
    if (blocked[b]) {
      continue;
    }
    build_centroid(b, level + 1);
  }
}

ll get_diam() {
  ll sol = 0;
  for (auto& s2 : s) {
    auto it = s2.end();
    ll cur = 0;
    it--;
    cur += *it;
    it--;
    cur += *it;
    sol = max(sol, cur);
  }
  return sol;
}

int xx[N], yy[N];

int main() {
  if (home == 0) {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  }
  else {
    freopen("input.txt", "r", stdin);
  }
  cin >> n >> q >> w;
  for (int i = 0; i < K; i++) {
    for (int j = 0; j < N; j++) {
      where[i][j] = -1;
    }
    trees[i].init(n);
  }
  for (int i = 1; i < n; i++) {
    int a, b, c;
    cin >> a >> b >> c;
    xx[i] = a;
    yy[i] = b;
    sum_edge[i] = a + b;
    gindex[a].push_back(i);
    gindex[b].push_back(i);
    val_edge[i] = c;
  }
  build_centroid(1, 0);
  for (int i = 1; i < n; i++) {
    add(i, val_edge[i]);
  }
  ll last = 0;
  for (int iq = 1; iq <= q; iq++) {
    int d, e;
    cin >> d >> e;
    d = (d + last) % (n - 1) + 1;
    e = (e + last) % w;
    add(d, -val_edge[d] + e);
    val_edge[d] = e;
    if (tog.empty()) {
      last = 0;
    }
    else {
      auto it = tog.end();
      it--;
      last = *it;
    }

    cout << last << "\n";

  }
  return 0;
}

Compilation message

diameter.cpp: In function 'int fcen(int, int)':
diameter.cpp:115:1: warning: control reaches end of non-void function [-Wreturn-type]
  115 | }
      | ^
diameter.cpp: In function 'int main()':
diameter.cpp:260:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  260 |     freopen("input.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 10500 KB Output is correct
2 Correct 5 ms 10580 KB Output is correct
3 Correct 5 ms 10580 KB Output is correct
4 Correct 5 ms 10580 KB Output is correct
5 Correct 7 ms 10496 KB Output is correct
6 Correct 6 ms 10556 KB Output is correct
7 Correct 6 ms 10580 KB Output is correct
8 Correct 6 ms 10708 KB Output is correct
9 Correct 6 ms 10632 KB Output is correct
10 Correct 6 ms 10720 KB Output is correct
11 Correct 6 ms 10708 KB Output is correct
12 Correct 6 ms 10624 KB Output is correct
13 Correct 6 ms 10756 KB Output is correct
14 Correct 5 ms 10708 KB Output is correct
15 Correct 6 ms 10708 KB Output is correct
16 Correct 6 ms 10708 KB Output is correct
17 Correct 5 ms 10708 KB Output is correct
18 Correct 6 ms 10708 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 10500 KB Output is correct
2 Correct 5 ms 10580 KB Output is correct
3 Correct 5 ms 10580 KB Output is correct
4 Correct 5 ms 10580 KB Output is correct
5 Correct 7 ms 10496 KB Output is correct
6 Correct 6 ms 10556 KB Output is correct
7 Correct 6 ms 10580 KB Output is correct
8 Correct 6 ms 10708 KB Output is correct
9 Correct 6 ms 10632 KB Output is correct
10 Correct 6 ms 10720 KB Output is correct
11 Correct 6 ms 10708 KB Output is correct
12 Correct 6 ms 10624 KB Output is correct
13 Correct 6 ms 10756 KB Output is correct
14 Correct 5 ms 10708 KB Output is correct
15 Correct 6 ms 10708 KB Output is correct
16 Correct 6 ms 10708 KB Output is correct
17 Correct 5 ms 10708 KB Output is correct
18 Correct 6 ms 10708 KB Output is correct
19 Correct 35 ms 12336 KB Output is correct
20 Correct 38 ms 12348 KB Output is correct
21 Correct 43 ms 12376 KB Output is correct
22 Correct 56 ms 12420 KB Output is correct
23 Correct 83 ms 18880 KB Output is correct
24 Correct 113 ms 19080 KB Output is correct
25 Correct 129 ms 19180 KB Output is correct
26 Correct 134 ms 19636 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 10580 KB Output is correct
2 Correct 7 ms 10580 KB Output is correct
3 Correct 6 ms 10580 KB Output is correct
4 Correct 18 ms 10788 KB Output is correct
5 Correct 78 ms 11644 KB Output is correct
6 Correct 5 ms 10520 KB Output is correct
7 Correct 7 ms 11272 KB Output is correct
8 Correct 6 ms 11220 KB Output is correct
9 Correct 8 ms 11348 KB Output is correct
10 Correct 27 ms 11572 KB Output is correct
11 Correct 99 ms 12608 KB Output is correct
12 Correct 14 ms 18172 KB Output is correct
13 Correct 17 ms 18200 KB Output is correct
14 Correct 16 ms 18200 KB Output is correct
15 Correct 39 ms 18456 KB Output is correct
16 Correct 135 ms 19512 KB Output is correct
17 Correct 234 ms 158120 KB Output is correct
18 Correct 227 ms 158212 KB Output is correct
19 Correct 239 ms 158132 KB Output is correct
20 Correct 264 ms 158312 KB Output is correct
21 Correct 549 ms 158428 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 12296 KB Output is correct
2 Correct 55 ms 12492 KB Output is correct
3 Correct 245 ms 13032 KB Output is correct
4 Correct 456 ms 13660 KB Output is correct
5 Correct 131 ms 27168 KB Output is correct
6 Correct 196 ms 27284 KB Output is correct
7 Correct 532 ms 27848 KB Output is correct
8 Correct 979 ms 28720 KB Output is correct
9 Correct 811 ms 93984 KB Output is correct
10 Correct 919 ms 94088 KB Output is correct
11 Correct 1457 ms 94832 KB Output is correct
12 Correct 2218 ms 95632 KB Output is correct
13 Correct 1769 ms 178604 KB Output is correct
14 Correct 1928 ms 178864 KB Output is correct
15 Correct 2617 ms 179384 KB Output is correct
16 Correct 3580 ms 180252 KB Output is correct
17 Execution timed out 5035 ms 180156 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

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

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 10500 KB Output is correct
2 Correct 5 ms 10580 KB Output is correct
3 Correct 5 ms 10580 KB Output is correct
4 Correct 5 ms 10580 KB Output is correct
5 Correct 7 ms 10496 KB Output is correct
6 Correct 6 ms 10556 KB Output is correct
7 Correct 6 ms 10580 KB Output is correct
8 Correct 6 ms 10708 KB Output is correct
9 Correct 6 ms 10632 KB Output is correct
10 Correct 6 ms 10720 KB Output is correct
11 Correct 6 ms 10708 KB Output is correct
12 Correct 6 ms 10624 KB Output is correct
13 Correct 6 ms 10756 KB Output is correct
14 Correct 5 ms 10708 KB Output is correct
15 Correct 6 ms 10708 KB Output is correct
16 Correct 6 ms 10708 KB Output is correct
17 Correct 5 ms 10708 KB Output is correct
18 Correct 6 ms 10708 KB Output is correct
19 Correct 35 ms 12336 KB Output is correct
20 Correct 38 ms 12348 KB Output is correct
21 Correct 43 ms 12376 KB Output is correct
22 Correct 56 ms 12420 KB Output is correct
23 Correct 83 ms 18880 KB Output is correct
24 Correct 113 ms 19080 KB Output is correct
25 Correct 129 ms 19180 KB Output is correct
26 Correct 134 ms 19636 KB Output is correct
27 Correct 5 ms 10580 KB Output is correct
28 Correct 7 ms 10580 KB Output is correct
29 Correct 6 ms 10580 KB Output is correct
30 Correct 18 ms 10788 KB Output is correct
31 Correct 78 ms 11644 KB Output is correct
32 Correct 5 ms 10520 KB Output is correct
33 Correct 7 ms 11272 KB Output is correct
34 Correct 6 ms 11220 KB Output is correct
35 Correct 8 ms 11348 KB Output is correct
36 Correct 27 ms 11572 KB Output is correct
37 Correct 99 ms 12608 KB Output is correct
38 Correct 14 ms 18172 KB Output is correct
39 Correct 17 ms 18200 KB Output is correct
40 Correct 16 ms 18200 KB Output is correct
41 Correct 39 ms 18456 KB Output is correct
42 Correct 135 ms 19512 KB Output is correct
43 Correct 234 ms 158120 KB Output is correct
44 Correct 227 ms 158212 KB Output is correct
45 Correct 239 ms 158132 KB Output is correct
46 Correct 264 ms 158312 KB Output is correct
47 Correct 549 ms 158428 KB Output is correct
48 Correct 16 ms 12296 KB Output is correct
49 Correct 55 ms 12492 KB Output is correct
50 Correct 245 ms 13032 KB Output is correct
51 Correct 456 ms 13660 KB Output is correct
52 Correct 131 ms 27168 KB Output is correct
53 Correct 196 ms 27284 KB Output is correct
54 Correct 532 ms 27848 KB Output is correct
55 Correct 979 ms 28720 KB Output is correct
56 Correct 811 ms 93984 KB Output is correct
57 Correct 919 ms 94088 KB Output is correct
58 Correct 1457 ms 94832 KB Output is correct
59 Correct 2218 ms 95632 KB Output is correct
60 Correct 1769 ms 178604 KB Output is correct
61 Correct 1928 ms 178864 KB Output is correct
62 Correct 2617 ms 179384 KB Output is correct
63 Correct 3580 ms 180252 KB Output is correct
64 Execution timed out 5035 ms 180156 KB Time limit exceeded
65 Halted 0 ms 0 KB -