oj.uz

Submission #689345

# Submission time Handle Problem Language Result Execution time Memory
689345 2023-01-28T09:31:43 Z 600Mihnea Dynamic Diameter (CEOI19_diameter) C++17
49 / 100
 5000 ms 115380 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(2 * (n + 7), 0);
    lazy.resize(2 * (n + 7), 0);
  }

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

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

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

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 10580 KB Output is correct
2 Correct 7 ms 10592 KB Output is correct
3 Correct 6 ms 10496 KB Output is correct
4 Correct 7 ms 10580 KB Output is correct
5 Correct 8 ms 10500 KB Output is correct
6 Correct 7 ms 10580 KB Output is correct
7 Correct 6 ms 10632 KB Output is correct
8 Correct 6 ms 10624 KB Output is correct
9 Correct 5 ms 10580 KB Output is correct
10 Correct 6 ms 10600 KB Output is correct
11 Correct 6 ms 10664 KB Output is correct
12 Correct 6 ms 10580 KB Output is correct
13 Correct 5 ms 10708 KB Output is correct
14 Correct 6 ms 10632 KB Output is correct
15 Correct 6 ms 10708 KB Output is correct
16 Correct 6 ms 10708 KB Output is correct
17 Correct 6 ms 10656 KB Output is correct
18 Correct 7 ms 10708 KB Output is correct
19 Correct 33 ms 11696 KB Output is correct
20 Correct 33 ms 11728 KB Output is correct
21 Correct 43 ms 11732 KB Output is correct
22 Correct 47 ms 11780 KB Output is correct
23 Correct 77 ms 15632 KB Output is correct
24 Correct 96 ms 15744 KB Output is correct
25 Correct 108 ms 15928 KB Output is correct
26 Correct 133 ms 16340 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 10532 KB Output is correct
2 Correct 6 ms 10504 KB Output is correct
3 Correct 9 ms 10588 KB Output is correct
4 Correct 19 ms 10708 KB Output is correct
5 Correct 69 ms 11404 KB Output is correct
6 Correct 7 ms 10500 KB Output is correct
7 Correct 7 ms 10964 KB Output is correct
8 Correct 7 ms 10888 KB Output is correct
9 Correct 8 ms 11020 KB Output is correct
10 Correct 24 ms 11220 KB Output is correct
11 Correct 106 ms 11968 KB Output is correct
12 Correct 12 ms 14988 KB Output is correct
13 Correct 13 ms 14932 KB Output is correct
14 Correct 16 ms 15032 KB Output is correct
15 Correct 46 ms 15108 KB Output is correct
16 Correct 135 ms 15716 KB Output is correct
17 Correct 190 ms 94832 KB Output is correct
18 Correct 189 ms 94796 KB Output is correct
19 Correct 203 ms 94740 KB Output is correct
20 Correct 269 ms 94828 KB Output is correct
21 Correct 493 ms 94708 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 11604 KB Output is correct
2 Correct 52 ms 11780 KB Output is correct
3 Correct 232 ms 12336 KB Output is correct
4 Correct 422 ms 12580 KB Output is correct
5 Correct 107 ms 20880 KB Output is correct
6 Correct 168 ms 21048 KB Output is correct
7 Correct 463 ms 21716 KB Output is correct
8 Correct 870 ms 21892 KB Output is correct
9 Correct 687 ms 62540 KB Output is correct
10 Correct 811 ms 62584 KB Output is correct
11 Correct 1247 ms 62680 KB Output is correct
12 Correct 1922 ms 62976 KB Output is correct
13 Correct 1800 ms 114528 KB Output is correct
14 Correct 1668 ms 114568 KB Output is correct
15 Correct 2148 ms 114908 KB Output is correct
16 Correct 2830 ms 115380 KB Output is correct
17 Correct 4724 ms 115308 KB Output is correct

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5056 ms 77124 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 10580 KB Output is correct
2 Correct 7 ms 10592 KB Output is correct
3 Correct 6 ms 10496 KB Output is correct
4 Correct 7 ms 10580 KB Output is correct
5 Correct 8 ms 10500 KB Output is correct
6 Correct 7 ms 10580 KB Output is correct
7 Correct 6 ms 10632 KB Output is correct
8 Correct 6 ms 10624 KB Output is correct
9 Correct 5 ms 10580 KB Output is correct
10 Correct 6 ms 10600 KB Output is correct
11 Correct 6 ms 10664 KB Output is correct
12 Correct 6 ms 10580 KB Output is correct
13 Correct 5 ms 10708 KB Output is correct
14 Correct 6 ms 10632 KB Output is correct
15 Correct 6 ms 10708 KB Output is correct
16 Correct 6 ms 10708 KB Output is correct
17 Correct 6 ms 10656 KB Output is correct
18 Correct 7 ms 10708 KB Output is correct
19 Correct 33 ms 11696 KB Output is correct
20 Correct 33 ms 11728 KB Output is correct
21 Correct 43 ms 11732 KB Output is correct
22 Correct 47 ms 11780 KB Output is correct
23 Correct 77 ms 15632 KB Output is correct
24 Correct 96 ms 15744 KB Output is correct
25 Correct 108 ms 15928 KB Output is correct
26 Correct 133 ms 16340 KB Output is correct
27 Correct 7 ms 10532 KB Output is correct
28 Correct 6 ms 10504 KB Output is correct
29 Correct 9 ms 10588 KB Output is correct
30 Correct 19 ms 10708 KB Output is correct
31 Correct 69 ms 11404 KB Output is correct
32 Correct 7 ms 10500 KB Output is correct
33 Correct 7 ms 10964 KB Output is correct
34 Correct 7 ms 10888 KB Output is correct
35 Correct 8 ms 11020 KB Output is correct
36 Correct 24 ms 11220 KB Output is correct
37 Correct 106 ms 11968 KB Output is correct
38 Correct 12 ms 14988 KB Output is correct
39 Correct 13 ms 14932 KB Output is correct
40 Correct 16 ms 15032 KB Output is correct
41 Correct 46 ms 15108 KB Output is correct
42 Correct 135 ms 15716 KB Output is correct
43 Correct 190 ms 94832 KB Output is correct
44 Correct 189 ms 94796 KB Output is correct
45 Correct 203 ms 94740 KB Output is correct
46 Correct 269 ms 94828 KB Output is correct
47 Correct 493 ms 94708 KB Output is correct
48 Correct 15 ms 11604 KB Output is correct
49 Correct 52 ms 11780 KB Output is correct
50 Correct 232 ms 12336 KB Output is correct
51 Correct 422 ms 12580 KB Output is correct
52 Correct 107 ms 20880 KB Output is correct
53 Correct 168 ms 21048 KB Output is correct
54 Correct 463 ms 21716 KB Output is correct
55 Correct 870 ms 21892 KB Output is correct
56 Correct 687 ms 62540 KB Output is correct
57 Correct 811 ms 62584 KB Output is correct
58 Correct 1247 ms 62680 KB Output is correct
59 Correct 1922 ms 62976 KB Output is correct
60 Correct 1800 ms 114528 KB Output is correct
61 Correct 1668 ms 114568 KB Output is correct
62 Correct 2148 ms 114908 KB Output is correct
63 Correct 2830 ms 115380 KB Output is correct
64 Correct 4724 ms 115308 KB Output is correct
65 Execution timed out 5056 ms 77124 KB Time limit exceeded
66 Halted 0 ms 0 KB -