oj.uz

Submission #689342

# Submission time Handle Problem Language Result Execution time Memory
689342 2023-01-28T09:24:14 Z 600Mihnea Dynamic Diameter (CEOI19_diameter) C++17
49 / 100
 5000 ms 177628 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 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(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]) + 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(2 * v, tl, tm, l, r), getmax(2 * v + 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 5 ms 10700 KB Output is correct
2 Correct 5 ms 10636 KB Output is correct
3 Correct 6 ms 10500 KB Output is correct
4 Correct 6 ms 10580 KB Output is correct
5 Correct 7 ms 10504 KB Output is correct
6 Correct 5 ms 10500 KB Output is correct
7 Correct 5 ms 10628 KB Output is correct
8 Correct 5 ms 10708 KB Output is correct
9 Correct 5 ms 10708 KB Output is correct
10 Correct 5 ms 10708 KB Output is correct
11 Correct 5 ms 10708 KB Output is correct
12 Correct 5 ms 10836 KB Output is correct
13 Correct 6 ms 10792 KB Output is correct
14 Correct 6 ms 10752 KB Output is correct
15 Correct 7 ms 10760 KB Output is correct
16 Correct 6 ms 10760 KB Output is correct
17 Correct 6 ms 10708 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 5 ms 10700 KB Output is correct
2 Correct 5 ms 10636 KB Output is correct
3 Correct 6 ms 10500 KB Output is correct
4 Correct 6 ms 10580 KB Output is correct
5 Correct 7 ms 10504 KB Output is correct
6 Correct 5 ms 10500 KB Output is correct
7 Correct 5 ms 10628 KB Output is correct
8 Correct 5 ms 10708 KB Output is correct
9 Correct 5 ms 10708 KB Output is correct
10 Correct 5 ms 10708 KB Output is correct
11 Correct 5 ms 10708 KB Output is correct
12 Correct 5 ms 10836 KB Output is correct
13 Correct 6 ms 10792 KB Output is correct
14 Correct 6 ms 10752 KB Output is correct
15 Correct 7 ms 10760 KB Output is correct
16 Correct 6 ms 10760 KB Output is correct
17 Correct 6 ms 10708 KB Output is correct
18 Correct 7 ms 10708 KB Output is correct
19 Correct 31 ms 12316 KB Output is correct
20 Correct 33 ms 12344 KB Output is correct
21 Correct 38 ms 12388 KB Output is correct
22 Correct 47 ms 12404 KB Output is correct
23 Correct 79 ms 18900 KB Output is correct
24 Correct 96 ms 19084 KB Output is correct
25 Correct 105 ms 19200 KB Output is correct
26 Correct 117 ms 19560 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 6 ms 10500 KB Output is correct
3 Correct 7 ms 10580 KB Output is correct
4 Correct 17 ms 10828 KB Output is correct
5 Correct 67 ms 11248 KB Output is correct
6 Correct 5 ms 10452 KB Output is correct
7 Correct 5 ms 11220 KB Output is correct
8 Correct 6 ms 11220 KB Output is correct
9 Correct 7 ms 11336 KB Output is correct
10 Correct 23 ms 11540 KB Output is correct
11 Correct 90 ms 12020 KB Output is correct
12 Correct 13 ms 18164 KB Output is correct
13 Correct 13 ms 18328 KB Output is correct
14 Correct 21 ms 18212 KB Output is correct
15 Correct 42 ms 18432 KB Output is correct
16 Correct 128 ms 18700 KB Output is correct
17 Correct 226 ms 157236 KB Output is correct
18 Correct 219 ms 157244 KB Output is correct
19 Correct 211 ms 157240 KB Output is correct
20 Correct 245 ms 157184 KB Output is correct
21 Correct 495 ms 157364 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 12244 KB Output is correct
2 Correct 47 ms 12416 KB Output is correct
3 Correct 201 ms 12784 KB Output is correct
4 Correct 404 ms 13028 KB Output is correct
5 Correct 107 ms 27164 KB Output is correct
6 Correct 176 ms 27324 KB Output is correct
7 Correct 478 ms 27480 KB Output is correct
8 Correct 858 ms 27948 KB Output is correct
9 Correct 661 ms 93544 KB Output is correct
10 Correct 832 ms 93564 KB Output is correct
11 Correct 1249 ms 93844 KB Output is correct
12 Correct 1874 ms 94000 KB Output is correct
13 Correct 1522 ms 176992 KB Output is correct
14 Correct 1637 ms 177180 KB Output is correct
15 Correct 2303 ms 177348 KB Output is correct
16 Correct 2953 ms 177612 KB Output is correct
17 Correct 4773 ms 177628 KB Output is correct

Subtask #5
0 / 24.0

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

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 10700 KB Output is correct
2 Correct 5 ms 10636 KB Output is correct
3 Correct 6 ms 10500 KB Output is correct
4 Correct 6 ms 10580 KB Output is correct
5 Correct 7 ms 10504 KB Output is correct
6 Correct 5 ms 10500 KB Output is correct
7 Correct 5 ms 10628 KB Output is correct
8 Correct 5 ms 10708 KB Output is correct
9 Correct 5 ms 10708 KB Output is correct
10 Correct 5 ms 10708 KB Output is correct
11 Correct 5 ms 10708 KB Output is correct
12 Correct 5 ms 10836 KB Output is correct
13 Correct 6 ms 10792 KB Output is correct
14 Correct 6 ms 10752 KB Output is correct
15 Correct 7 ms 10760 KB Output is correct
16 Correct 6 ms 10760 KB Output is correct
17 Correct 6 ms 10708 KB Output is correct
18 Correct 7 ms 10708 KB Output is correct
19 Correct 31 ms 12316 KB Output is correct
20 Correct 33 ms 12344 KB Output is correct
21 Correct 38 ms 12388 KB Output is correct
22 Correct 47 ms 12404 KB Output is correct
23 Correct 79 ms 18900 KB Output is correct
24 Correct 96 ms 19084 KB Output is correct
25 Correct 105 ms 19200 KB Output is correct
26 Correct 117 ms 19560 KB Output is correct
27 Correct 5 ms 10580 KB Output is correct
28 Correct 6 ms 10500 KB Output is correct
29 Correct 7 ms 10580 KB Output is correct
30 Correct 17 ms 10828 KB Output is correct
31 Correct 67 ms 11248 KB Output is correct
32 Correct 5 ms 10452 KB Output is correct
33 Correct 5 ms 11220 KB Output is correct
34 Correct 6 ms 11220 KB Output is correct
35 Correct 7 ms 11336 KB Output is correct
36 Correct 23 ms 11540 KB Output is correct
37 Correct 90 ms 12020 KB Output is correct
38 Correct 13 ms 18164 KB Output is correct
39 Correct 13 ms 18328 KB Output is correct
40 Correct 21 ms 18212 KB Output is correct
41 Correct 42 ms 18432 KB Output is correct
42 Correct 128 ms 18700 KB Output is correct
43 Correct 226 ms 157236 KB Output is correct
44 Correct 219 ms 157244 KB Output is correct
45 Correct 211 ms 157240 KB Output is correct
46 Correct 245 ms 157184 KB Output is correct
47 Correct 495 ms 157364 KB Output is correct
48 Correct 15 ms 12244 KB Output is correct
49 Correct 47 ms 12416 KB Output is correct
50 Correct 201 ms 12784 KB Output is correct
51 Correct 404 ms 13028 KB Output is correct
52 Correct 107 ms 27164 KB Output is correct
53 Correct 176 ms 27324 KB Output is correct
54 Correct 478 ms 27480 KB Output is correct
55 Correct 858 ms 27948 KB Output is correct
56 Correct 661 ms 93544 KB Output is correct
57 Correct 832 ms 93564 KB Output is correct
58 Correct 1249 ms 93844 KB Output is correct
59 Correct 1874 ms 94000 KB Output is correct
60 Correct 1522 ms 176992 KB Output is correct
61 Correct 1637 ms 177180 KB Output is correct
62 Correct 2303 ms 177348 KB Output is correct
63 Correct 2953 ms 177612 KB Output is correct
64 Correct 4773 ms 177628 KB Output is correct
65 Execution timed out 5037 ms 139316 KB Time limit exceeded
66 Halted 0 ms 0 KB -