oj.uz

Submission #855774

# Submission time Handle Problem Language Result Execution time Memory
855774 2023-10-01T18:53:50 Z tvladm2009 Two Currencies (JOI23_currencies) C++17
10 / 100
 5000 ms 770312 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
const int N = 100000 + 7;
const int K = 20;
const int B = 317;
int n;
int m;
int q;
vector<int> g[N];
pair<int, int> edges[N];
int dep[N];
int par[N];
int l[N];
int r[N];
int tab[K][N];
int tt = 0;
pair<int, int> updates[N];
ll sumToRoot[B][N];
ll prefSum[B][N];
int countToRoot[B][N];
int prefCount[B][N];

int get_bucket(int x) {
  return (x - 1) / B + 1;
}

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

  void init(int nn) {
    n = nn;
    tree.resize(4 * n + 1);
    lazy.resize(4 * n + 1);
    for (int i = 1; i <= 4 * n; i++) {
      tree[i] = 0;
      lazy[i] = 0;
    }
  }

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

  void applyRange(int v, int tl, int tr, int x, int y, ll val) {
    push(v, tl, tr);
    if (x <= tl && tr <= y) {
      lazy[v] += val;
      push(v, tl, tr);
      return;
    }
    int tm = (tl + tr) / 2;
    if (x <= tm) {
      applyRange(2 * v, tl, tm, x, min(tm, y), val);
    }
    if (tm + 1 <= y) {
      applyRange(2 * v + 1, tm + 1, tr, max(x, tm + 1), y, val);
    }
    push(2 * v, tl, tm);
    push(2 * v + 1, tm + 1, tr);
    tree[v] = tree[2 * v] + tree[2 * v + 1];
  }

  ll force(int v, int tl, int tr, int x, int y) {
    push(v, tl, tr);
    if (x <= tl && tr <= y) {
      return tree[v];
    }
    int tm = (tl + tr) / 2;
    if (x <= tm && y <= tm) {
      return force(2 * v, tl, tm, x, y);
    } else if (tm + 1 <= x && tm + 1 <= y) {
      return force(2 * v + 1, tm + 1, tr, x, y);
    } else {
      return force(2 * v, tl, tm, x, tm) + force(2 * v + 1, tm + 1, tr, tm + 1, tr);
    }
  }
};

void build(int a, int p = 0) {
  l[a] = ++tt;
  tab[0][a] = p;
  for (int k = 1; k < K; k++) {
    tab[k][a] = tab[k - 1][tab[k - 1][a]];
  }
  for (auto &b : g[a]) {
    if (b != p) {
      par[b] = a;
      dep[b] = dep[a] + 1;
      build(b, a);
    }
  }
  r[a] = tt;
}

int lca(int x, int y) {
  if (dep[x] < dep[y]) {
    swap(x, y);
  }
  for (int k = K - 1; k >= 0; k--) {
    if (dep[x] - (1 << k) >= dep[y]) {
      x = tab[k][x];
    }
  }
  if (x == y) {
    return x;
  }
  for (int k = K - 1; k >= 0; k--) {
    if (tab[k][x] != tab[k][y]) {
      x = tab[k][x];
      y = tab[k][y];
    }
  }
  return tab[0][x];
}

bool is_ancestor(int x, int y) { /// x ancestor of y
  return l[x] <= l[y] && r[y] <= r[x];
}

ll getToRoot(int when, int node) { /// suma de la x la root la momentu when
  if (node == 0) {
    return 0;
  }
  int bucket = get_bucket(when) - 1;
  ll sol = prefSum[bucket][node];
  for (int i = B * bucket + 1; i <= when; i++) {
    ll val = updates[i].first;
    int x = updates[i].second;
    if (is_ancestor(x, node)) {
      sol += val;
    }
  }
  return sol;
}

ll get_sum(int when, int x, int y) {
  int z = lca(x, y);
  return getToRoot(when, x) + getToRoot(when, y) - 2 * getToRoot(when, z);
}

ll getToRoot2(int when, int node) {
  if (node == 0) {
    return 0;
  }
  int bucket = get_bucket(when) - 1;
  ll sol = prefCount[bucket][node];
  for (int i = B * bucket + 1; i <= when; i++) {
    int x = updates[i].second;
    if (is_ancestor(x, node)) {
      sol++;
    }
  }
  return sol;
}

ll get_count(int when, int x, int y) {
  int z = lca(x, y);
  return getToRoot2(when, x) + getToRoot2(when, y) - 2 * getToRoot2(when, z);
}

int main() {
  ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

/// freopen("input.txt", "r", stdin);

  cin >> n >> m >> q;
  for (int i = 1; i < n; i++) {
    int x, y;
    cin >> x >> y;
    g[x].push_back(y);
    g[y].push_back(x);
    edges[i] = {x, y};
  }
  build(1);
  for (int i = 1; i <= m; i++) {
    ll road, val;
    cin >> road >> val;
    int x = edges[road].first;
    int y = edges[road].second;
    if (dep[x] < dep[y]) {
      swap(x, y);
    }
    updates[i] = {val, x};
  }
  sort(updates + 1, updates + m + 1);


  { /// for sum
    for (int bucket = 1; bucket <= get_bucket(m); bucket++) {
      segtree tree;
      tree.init(n);
      for (int i = (bucket - 1) * B + 1; i <= bucket * B; i++) {
        ll val = updates[i].first;
        int x = updates[i].second;
        if (x != 0) {
          tree.applyRange(1, 1, n, l[x], r[x], val);
        }
      }
      for (int i = 1; i <= n; i++) {
        sumToRoot[bucket][i] = tree.force(1, 1, n, l[i], l[i]);
      }
    }
    for (int i = 1; i <= n; i++) {
      for (int bucket = 1; bucket <= get_bucket(m); bucket++) {
        prefSum[bucket][i] = prefSum[bucket - 1][i] + sumToRoot[bucket][i];
      }
    }
  }
  { /// for cnt
    for (int bucket = 1; bucket <= get_bucket(m); bucket++) {
      segtree tree;
      tree.init(n);
      for (int i = (bucket - 1) * B + 1; i <= bucket * B; i++) {
        int x = updates[i].second;
        if (x != 0) {
          tree.applyRange(1, 1, n, l[x], r[x], 1);
        }
      }
      for (int i = 1; i <= n; i++) {
        countToRoot[bucket][i] = tree.force(1, 1, n, l[i], l[i]);
      }
    }
    for (int i = 1; i <= n; i++) {
      for (int bucket = 1; bucket <= get_bucket(m); bucket++) {
        prefCount[bucket][i] = prefCount[bucket - 1][i] + countToRoot[bucket][i];
      }
    }
  }

  while (q--) {
    ll s, t, x, y;
    cin >> s >> t >> x >> y;
    int low = 1, high = m, sol = 0;
    while (low <= high) {
      int mid = (low + high) / 2;
      if (get_sum(mid, s, t) <= y) {
        sol = mid;
        low = mid + 1;
      } else {
        high = mid - 1;
      }
    }
    int z = lca(s, t);
    int payed = get_count(sol, s, t);
    int total = get_count(m, s, t);
    int keep = x - (total - payed);
    if (keep < 0) {
      keep = -1;
    }
    cout << keep << "\n";
  }
  return 0;
}

Compilation message

currencies.cpp: In function 'int main()':
currencies.cpp:253:9: warning: unused variable 'z' [-Wunused-variable]
  253 |     int z = lca(s, t);
      |         ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 21592 KB Output is correct
2 Correct 4 ms 21368 KB Output is correct
3 Correct 3 ms 21364 KB Output is correct
4 Correct 3 ms 21340 KB Output is correct
5 Correct 27 ms 34024 KB Output is correct
6 Correct 37 ms 33880 KB Output is correct
7 Correct 27 ms 27740 KB Output is correct
8 Correct 36 ms 33884 KB Output is correct
9 Correct 34 ms 34056 KB Output is correct
10 Correct 36 ms 33884 KB Output is correct
11 Correct 37 ms 33884 KB Output is correct
12 Correct 36 ms 33884 KB Output is correct
13 Correct 36 ms 34172 KB Output is correct
14 Correct 38 ms 34140 KB Output is correct
15 Correct 40 ms 34108 KB Output is correct
16 Correct 41 ms 33880 KB Output is correct
17 Correct 40 ms 33880 KB Output is correct
18 Correct 39 ms 34092 KB Output is correct
19 Correct 32 ms 33880 KB Output is correct
20 Correct 34 ms 34136 KB Output is correct
21 Correct 31 ms 33884 KB Output is correct
22 Correct 32 ms 34064 KB Output is correct
23 Correct 29 ms 34064 KB Output is correct
24 Correct 32 ms 34060 KB Output is correct
25 Correct 33 ms 33884 KB Output is correct
26 Correct 32 ms 33880 KB Output is correct
27 Correct 22 ms 33880 KB Output is correct
28 Correct 24 ms 33880 KB Output is correct
29 Correct 20 ms 34052 KB Output is correct
30 Correct 35 ms 33884 KB Output is correct
31 Correct 35 ms 33880 KB Output is correct
32 Correct 31 ms 33880 KB Output is correct
33 Correct 33 ms 34140 KB Output is correct
34 Correct 35 ms 34188 KB Output is correct
35 Correct 33 ms 34180 KB Output is correct

Subtask #2
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 21336 KB Output is correct
2 Correct 35 ms 34056 KB Output is correct
3 Correct 33 ms 33884 KB Output is correct
4 Correct 31 ms 33884 KB Output is correct
5 Execution timed out 5034 ms 531940 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 21340 KB Output is correct
2 Correct 34 ms 34192 KB Output is correct
3 Correct 34 ms 34140 KB Output is correct
4 Correct 33 ms 34140 KB Output is correct
5 Correct 4846 ms 516976 KB Output is correct
6 Correct 3977 ms 417936 KB Output is correct
7 Correct 4673 ms 666872 KB Output is correct
8 Execution timed out 5035 ms 770312 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 21592 KB Output is correct
2 Correct 4 ms 21368 KB Output is correct
3 Correct 3 ms 21364 KB Output is correct
4 Correct 3 ms 21340 KB Output is correct
5 Correct 27 ms 34024 KB Output is correct
6 Correct 37 ms 33880 KB Output is correct
7 Correct 27 ms 27740 KB Output is correct
8 Correct 36 ms 33884 KB Output is correct
9 Correct 34 ms 34056 KB Output is correct
10 Correct 36 ms 33884 KB Output is correct
11 Correct 37 ms 33884 KB Output is correct
12 Correct 36 ms 33884 KB Output is correct
13 Correct 36 ms 34172 KB Output is correct
14 Correct 38 ms 34140 KB Output is correct
15 Correct 40 ms 34108 KB Output is correct
16 Correct 41 ms 33880 KB Output is correct
17 Correct 40 ms 33880 KB Output is correct
18 Correct 39 ms 34092 KB Output is correct
19 Correct 32 ms 33880 KB Output is correct
20 Correct 34 ms 34136 KB Output is correct
21 Correct 31 ms 33884 KB Output is correct
22 Correct 32 ms 34064 KB Output is correct
23 Correct 29 ms 34064 KB Output is correct
24 Correct 32 ms 34060 KB Output is correct
25 Correct 33 ms 33884 KB Output is correct
26 Correct 32 ms 33880 KB Output is correct
27 Correct 22 ms 33880 KB Output is correct
28 Correct 24 ms 33880 KB Output is correct
29 Correct 20 ms 34052 KB Output is correct
30 Correct 35 ms 33884 KB Output is correct
31 Correct 35 ms 33880 KB Output is correct
32 Correct 31 ms 33880 KB Output is correct
33 Correct 33 ms 34140 KB Output is correct
34 Correct 35 ms 34188 KB Output is correct
35 Correct 33 ms 34180 KB Output is correct
36 Correct 3 ms 21336 KB Output is correct
37 Correct 35 ms 34056 KB Output is correct
38 Correct 33 ms 33884 KB Output is correct
39 Correct 31 ms 33884 KB Output is correct
40 Execution timed out 5034 ms 531940 KB Time limit exceeded
41 Halted 0 ms 0 KB -