oj.uz

Submission #976291

# Submission time Handle Problem Language Result Execution time Memory
976291 2024-05-06T11:47:41 Z mannshah1211 Two Currencies (JOI23_currencies) C++17
100 / 100
 1067 ms 157360 KB 
/**
 *  author: hashman
 *  created:
**/

#include <bits/stdc++.h>

using namespace std;

string to_string(string s) {
  return '"' + s + '"';
}

string to_string(const char* s) {
  return to_string((string) s);
}

string to_string(bool b) {
  return (b ? "true" : "false");
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}

void debug_out() {
  cerr << endl;
}

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}

#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)

using Int = long long;

#define int Int

struct node {
  node *l, *r;
  int len;
  Int sum;
  
  node(int y, Int x) : l(nullptr), r(nullptr), len(y), sum(x) {}
  
  node(node *ll, node *rr) : l(ll), r(rr), len(0), sum(Int(0)) {
    if (ll) {
      len += ll->len;
      sum += ll->sum;
    }
    if (rr) {
      len += rr->len;
      sum += rr->sum;
    }
  }
  
  node(node *copy) : l(copy->l), r(copy->r), sum(copy->sum) {}
};

int32_t main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m, q;
  cin >> n >> m >> q;
  vector<vector<int>> g(n);
  vector<pair<int, int>> ed(n - 1);
  for (int i = 0; i < n - 1; i++) {
    int a, b;
    cin >> a >> b;
    --a; --b;
    g[a].push_back(b);
    g[b].push_back(a);
    ed[i] = make_pair(a, b);
  }
  vector<int> d(n);
  vector<vector<int>> up(n, vector<int>(18));
  auto dfs = [&](auto&& self, int v, int pr) -> void {
    up[v][0] = pr;
    for (int u : g[v]) {
      if (u != pr) {
        d[u] = d[v] + 1;
        self(self, u, v);
      }
    }
  };
  dfs(dfs, 0, -1);
  for (int j = 1; j < 18; j++) {
    for (int i = 0; i < n; i++) {
      up[i][j] = (up[i][j - 1] == -1 ? -1 : up[up[i][j - 1]][j - 1]);
    }
  }
  auto kth = [&](int v, int k) {
    for (int b = 17; b >= 0; b--) {
      if (k & (1 << b)) {
        v = up[v][b];
        if (v == -1) {
          return v;
        }
      }
    }
    return v;
  };
  auto lca = [&](int u, int v) {
    if (d[u] < d[v]) {
      swap(u, v);
    }
    u = kth(u, d[u] - d[v]);
    for (int b = 17; b >= 0; b--) {
      if (up[u][b] != up[v][b] && up[u][b] != -1 && up[v][b] != -1) {
        u = up[u][b];
        v = up[v][b];
      }
    }
    return (u == v) ? v : up[v][0];
  };
  vector<vector<int>> at(n);
  vector<int> cp(m);
  vector<int> till(n);
  for (int i = 0; i < m; i++) {
    int p, c;
    cin >> p >> c;
    --p;
    if (d[ed[p].first] > d[ed[p].second]) {
      swap(ed[p].first, ed[p].second);
    }
    at[ed[p].second].push_back(c);
    cp[i] = c;
  }
  sort(cp.begin(), cp.end());
  map<int, int> compress, inv;
  int cnt = 0;
  for (int i = 0; i < m; i++) {
    compress[cp[i]] = -1;
  }
  for (int i = 0; i < m; i++) {
    if (compress[cp[i]] == -1) {
      compress[cp[i]] = cnt++;
      inv[compress[cp[i]]] = cp[i];
    }
  }
  vector<node*> roots(max(n, m));
  auto build = [&](auto&& self, int l, int r) {
    if (r - l == 1) {
      return new node(0, Int(0));
    }
    int m = (l + r) / 2;
    return new node(self(self, l, m), self(self, m, r));
  };
  auto modify = [&](auto&& self, node *nd, int orig, int i, int l, int r) {
    if (r - l == 1) {
      return new node(nd->len + 1, nd->sum + orig);
    }
    int m = (l + r) / 2;
    if (i < m) {
      return new node(self(self, nd->l, orig, i, l, m), nd->r);
    } else {
      return new node(nd->l, self(self, nd->r, orig, i, m, r));
    }
  };
  auto apply = [&](auto&& self, int v, int pr) -> void {
    if (pr != -1) {
      roots[v] = roots[pr];
      for (int change : at[v]) {
        roots[v] = modify(modify, roots[v], change, compress[change], 0, max(n, m));
      }
    }
    for (int u : g[v]) {
      if (u != pr) {
        till[u] = till[v] + (int) at[u].size();
        self(self, u, v);
      }
    }
  };
  roots[0] = build(build, 0, max(n, m));
  apply(apply, 0, -1);
  auto find = [&](auto&& self, node *a, node *b, node *c, Int k, int l, int r) {
    if (r - l == 1) {
      if (inv[l] == 0) {
        return Int(0);
      }
      return min(a->len + b->len - (2 * c->len), k / inv[l]);
    }
    int m = (l + r) / 2;
    Int lft = (a->l->sum) + (b->l->sum) - (2 * (c->l->sum));
    if (lft >= k) {
      return self(self, a->l, b->l, c->l, k, l, m);
    } else {
      return a->l->len + b->l->len - (2 * (c->l->len)) + self(self, a->r, b->r, c->r, k - lft, m, r);
    }
  };
  auto num = [&](int u, int v) {
    return till[u] + till[v] - (2 * till[lca(u, v)]);
  };
  for (int i = 0; i < q; i++) {
    int s, t, x;
    cin >> s >> t >> x;
    --s; --t;
    Int y;
    cin >> y;
    int anc = lca(s, t), res = find(find, roots[s], roots[t], roots[anc], y, 0, max(n, m));
    if (num(s, t) - res > x) {
      cout << -1 << '\n';
    } else {
      cout << x + res - num(s, t) << '\n';
    }
  }
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 4 ms 2396 KB Output is correct
6 Correct 5 ms 2396 KB Output is correct
7 Correct 4 ms 1884 KB Output is correct
8 Correct 5 ms 2652 KB Output is correct
9 Correct 5 ms 2652 KB Output is correct
10 Correct 5 ms 2648 KB Output is correct
11 Correct 5 ms 2652 KB Output is correct
12 Correct 8 ms 2988 KB Output is correct
13 Correct 6 ms 2908 KB Output is correct
14 Correct 7 ms 2908 KB Output is correct
15 Correct 6 ms 2652 KB Output is correct
16 Correct 6 ms 2772 KB Output is correct
17 Correct 6 ms 2652 KB Output is correct
18 Correct 6 ms 2652 KB Output is correct
19 Correct 5 ms 2776 KB Output is correct
20 Correct 5 ms 2652 KB Output is correct
21 Correct 5 ms 2648 KB Output is correct
22 Correct 5 ms 2648 KB Output is correct
23 Correct 7 ms 2652 KB Output is correct
24 Correct 5 ms 2652 KB Output is correct
25 Correct 5 ms 2660 KB Output is correct
26 Correct 5 ms 2652 KB Output is correct
27 Correct 6 ms 2648 KB Output is correct
28 Correct 5 ms 2652 KB Output is correct
29 Correct 5 ms 2736 KB Output is correct
30 Correct 4 ms 2396 KB Output is correct
31 Correct 5 ms 2396 KB Output is correct
32 Correct 4 ms 2264 KB Output is correct
33 Correct 6 ms 2908 KB Output is correct
34 Correct 6 ms 2908 KB Output is correct
35 Correct 6 ms 2908 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 4 ms 2140 KB Output is correct
3 Correct 4 ms 2140 KB Output is correct
4 Correct 4 ms 2140 KB Output is correct
5 Correct 306 ms 114516 KB Output is correct
6 Correct 254 ms 96608 KB Output is correct
7 Correct 248 ms 87736 KB Output is correct
8 Correct 220 ms 86784 KB Output is correct
9 Correct 239 ms 91444 KB Output is correct
10 Correct 365 ms 123068 KB Output is correct
11 Correct 354 ms 123516 KB Output is correct
12 Correct 348 ms 123012 KB Output is correct
13 Correct 367 ms 123152 KB Output is correct
14 Correct 367 ms 123096 KB Output is correct
15 Correct 476 ms 137296 KB Output is correct
16 Correct 499 ms 137960 KB Output is correct
17 Correct 485 ms 136360 KB Output is correct
18 Correct 406 ms 123096 KB Output is correct
19 Correct 405 ms 122956 KB Output is correct
20 Correct 405 ms 123208 KB Output is correct
21 Correct 304 ms 123296 KB Output is correct
22 Correct 330 ms 123712 KB Output is correct
23 Correct 302 ms 123288 KB Output is correct
24 Correct 305 ms 123400 KB Output is correct
25 Correct 302 ms 122816 KB Output is correct
26 Correct 292 ms 123340 KB Output is correct
27 Correct 285 ms 122824 KB Output is correct
28 Correct 228 ms 123172 KB Output is correct
29 Correct 210 ms 122960 KB Output is correct
30 Correct 232 ms 123216 KB Output is correct
31 Correct 244 ms 123216 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 6 ms 2908 KB Output is correct
3 Correct 6 ms 2904 KB Output is correct
4 Correct 6 ms 2908 KB Output is correct
5 Correct 541 ms 117108 KB Output is correct
6 Correct 479 ms 102144 KB Output is correct
7 Correct 633 ms 125040 KB Output is correct
8 Correct 830 ms 154404 KB Output is correct
9 Correct 834 ms 154192 KB Output is correct
10 Correct 921 ms 154152 KB Output is correct
11 Correct 681 ms 153700 KB Output is correct
12 Correct 710 ms 153716 KB Output is correct
13 Correct 714 ms 153876 KB Output is correct
14 Correct 571 ms 154232 KB Output is correct
15 Correct 519 ms 154276 KB Output is correct
16 Correct 520 ms 154192 KB Output is correct
17 Correct 534 ms 154208 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 4 ms 2396 KB Output is correct
6 Correct 5 ms 2396 KB Output is correct
7 Correct 4 ms 1884 KB Output is correct
8 Correct 5 ms 2652 KB Output is correct
9 Correct 5 ms 2652 KB Output is correct
10 Correct 5 ms 2648 KB Output is correct
11 Correct 5 ms 2652 KB Output is correct
12 Correct 8 ms 2988 KB Output is correct
13 Correct 6 ms 2908 KB Output is correct
14 Correct 7 ms 2908 KB Output is correct
15 Correct 6 ms 2652 KB Output is correct
16 Correct 6 ms 2772 KB Output is correct
17 Correct 6 ms 2652 KB Output is correct
18 Correct 6 ms 2652 KB Output is correct
19 Correct 5 ms 2776 KB Output is correct
20 Correct 5 ms 2652 KB Output is correct
21 Correct 5 ms 2648 KB Output is correct
22 Correct 5 ms 2648 KB Output is correct
23 Correct 7 ms 2652 KB Output is correct
24 Correct 5 ms 2652 KB Output is correct
25 Correct 5 ms 2660 KB Output is correct
26 Correct 5 ms 2652 KB Output is correct
27 Correct 6 ms 2648 KB Output is correct
28 Correct 5 ms 2652 KB Output is correct
29 Correct 5 ms 2736 KB Output is correct
30 Correct 4 ms 2396 KB Output is correct
31 Correct 5 ms 2396 KB Output is correct
32 Correct 4 ms 2264 KB Output is correct
33 Correct 6 ms 2908 KB Output is correct
34 Correct 6 ms 2908 KB Output is correct
35 Correct 6 ms 2908 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 4 ms 2140 KB Output is correct
38 Correct 4 ms 2140 KB Output is correct
39 Correct 4 ms 2140 KB Output is correct
40 Correct 306 ms 114516 KB Output is correct
41 Correct 254 ms 96608 KB Output is correct
42 Correct 248 ms 87736 KB Output is correct
43 Correct 220 ms 86784 KB Output is correct
44 Correct 239 ms 91444 KB Output is correct
45 Correct 365 ms 123068 KB Output is correct
46 Correct 354 ms 123516 KB Output is correct
47 Correct 348 ms 123012 KB Output is correct
48 Correct 367 ms 123152 KB Output is correct
49 Correct 367 ms 123096 KB Output is correct
50 Correct 476 ms 137296 KB Output is correct
51 Correct 499 ms 137960 KB Output is correct
52 Correct 485 ms 136360 KB Output is correct
53 Correct 406 ms 123096 KB Output is correct
54 Correct 405 ms 122956 KB Output is correct
55 Correct 405 ms 123208 KB Output is correct
56 Correct 304 ms 123296 KB Output is correct
57 Correct 330 ms 123712 KB Output is correct
58 Correct 302 ms 123288 KB Output is correct
59 Correct 305 ms 123400 KB Output is correct
60 Correct 302 ms 122816 KB Output is correct
61 Correct 292 ms 123340 KB Output is correct
62 Correct 285 ms 122824 KB Output is correct
63 Correct 228 ms 123172 KB Output is correct
64 Correct 210 ms 122960 KB Output is correct
65 Correct 232 ms 123216 KB Output is correct
66 Correct 244 ms 123216 KB Output is correct
67 Correct 1 ms 344 KB Output is correct
68 Correct 6 ms 2908 KB Output is correct
69 Correct 6 ms 2904 KB Output is correct
70 Correct 6 ms 2908 KB Output is correct
71 Correct 541 ms 117108 KB Output is correct
72 Correct 479 ms 102144 KB Output is correct
73 Correct 633 ms 125040 KB Output is correct
74 Correct 830 ms 154404 KB Output is correct
75 Correct 834 ms 154192 KB Output is correct
76 Correct 921 ms 154152 KB Output is correct
77 Correct 681 ms 153700 KB Output is correct
78 Correct 710 ms 153716 KB Output is correct
79 Correct 714 ms 153876 KB Output is correct
80 Correct 571 ms 154232 KB Output is correct
81 Correct 519 ms 154276 KB Output is correct
82 Correct 520 ms 154192 KB Output is correct
83 Correct 534 ms 154208 KB Output is correct
84 Correct 457 ms 130336 KB Output is correct
85 Correct 397 ms 111480 KB Output is correct
86 Correct 323 ms 81452 KB Output is correct
87 Correct 599 ms 143956 KB Output is correct
88 Correct 592 ms 143952 KB Output is correct
89 Correct 584 ms 143952 KB Output is correct
90 Correct 639 ms 144220 KB Output is correct
91 Correct 656 ms 144248 KB Output is correct
92 Correct 1067 ms 153904 KB Output is correct
93 Correct 1034 ms 157360 KB Output is correct
94 Correct 815 ms 144284 KB Output is correct
95 Correct 823 ms 144296 KB Output is correct
96 Correct 791 ms 144260 KB Output is correct
97 Correct 822 ms 144256 KB Output is correct
98 Correct 516 ms 143668 KB Output is correct
99 Correct 519 ms 143560 KB Output is correct
100 Correct 517 ms 143720 KB Output is correct
101 Correct 548 ms 143812 KB Output is correct
102 Correct 611 ms 143812 KB Output is correct
103 Correct 612 ms 143892 KB Output is correct
104 Correct 565 ms 143812 KB Output is correct
105 Correct 402 ms 143960 KB Output is correct
106 Correct 389 ms 144208 KB Output is correct
107 Correct 436 ms 143956 KB Output is correct
108 Correct 431 ms 143976 KB Output is correct