oj.uz

Submission #777624

# Submission time Handle Problem Language Result Execution time Memory
777624 2023-07-09T11:29:52 Z tch1cherin Two Currencies (JOI23_currencies) C++17
100 / 100
 674 ms 47804 KB 
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt,fma")
#include <bits/stdc++.h>
using namespace std;

const int L = 18;

struct RMQ {
  vector<int> val;
  array<vector<int>, L> dp;

  int min(int i, int j) {
    return val[i] < val[j] ? i : j;
  }

  RMQ(vector<int> a) : val(a) {
    for (int i = 0; i < L; i++) {
      dp[i].resize(a.size());
    }
    iota(dp[0].begin(), dp[0].end(), 0);
    for (int i = 0; i < L - 1; i++) {
      for (int j = 0; j + (2 << i) <= (int)a.size(); j++) {
        dp[i + 1][j] = min(dp[i][j], dp[i][j + (1 << i)]);
      }
    }
  }

  int query(int l, int r) {
    int t = __lg(r - l);
    return min(dp[t][l], dp[t][r - (1 << t)]); 
  }
};

struct RUPQ {
  int size;
  vector<int64_t> fenw;

  RUPQ(int n) : size(n), fenw(n + 1) {}

  void add(int l, int r, int v) {
    auto Add = [&](int i, int x) {
      for (i++; i <= size; i += i & -i) {
        fenw[i] += x; 
      }
    };
    Add(l, v);
    Add(r, -v);
  }

  int64_t get(int i) {
    int64_t ans = 0;
    for (i++; i > 0; i -= i & -i) {
      ans += fenw[i];
    }
    return ans;
  }
};

struct query {
  int i, S, T, X;
  long long Y;
};

struct checkpoint {
  int P, C;

  bool operator<(const checkpoint& other) const {
    return C < other.C;
  }
};

int main() {
  // cin.tie(nullptr)->sync_with_stdio(false);
  int n, m, q;
  cin >> n >> m >> q;
  vector<vector<pair<int, int>>> g(n);
  for (int i = 0; i < n - 1; i++) {
    int x, y;
    cin >> x >> y;
    x--, y--;
    g[x].push_back({y, i});
    g[y].push_back({x, i});
  }
  vector<int> tin(n), tout(n), depth(n), edge(n - 1), val(2 * n), tour(2 * n), first(n);
  int timer = 0, pos = 0;
  auto DFS = [&](auto&& self, int u, int p) -> void {
    tin[u] = timer++;
    val[pos] = depth[u];
    first[u] = pos;
    tour[pos++] = u;
    for (auto [v, i] : g[u]) {
      if (v != p) {
        edge[i] = v;
        depth[v] = depth[u] + 1;
        self(self, v, u);
        val[pos] = depth[u];
        tour[pos++] = u;  
      }
    }
    tout[u] = timer;
  };
  DFS(DFS, 0, -1);
  RMQ rmq(val);
  auto LCA = [&](int u, int v) {
    if (first[u] > first[v]) {
      swap(u, v);
    }
    int p = rmq.query(first[u], first[v] + 1);
    return tour[p]; 
  }; 
  vector<checkpoint> points(m);
  for (auto &[P, C] : points) {
    cin >> P >> C;
    P--;
    P = edge[P];
  }
  vector<query> Queries(q);
  vector<int> ans(q);
  for (auto &[i, S, T, X, Y] : Queries) {
    cin >> S >> T >> X >> Y;
    S--, T--;
  }
  for (int i = 0; i < q; i++) {
    Queries[i].i = i;
  }
  sort(points.begin(), points.end());
  RUPQ in(n), out(n);
  for (auto [P, C] : points) {
    out.add(tin[P], tout[P], +1);
  }
  auto Solve = [&](auto&& self, int l, int r, vector<query>& queries) -> void {
    if (r - l == 1) {
      for (auto [i, S, T, X, Y] : queries) {
        ans[i] = X - (out.get(tin[S]) + out.get(tin[T]) - 2 * out.get(tin[LCA(S, T)]));
      }
    } else {
      int mid = (l + r) / 2;
      for (int i = l; i < mid; i++) {
        in.add(tin[points[i].P], tout[points[i].P], points[i].C);
        out.add(tin[points[i].P], tout[points[i].P], -1);
      }
      vector<query> lqueries, rqueries;
      for (auto [i, S, T, X, Y] : queries) {
        auto value = in.get(tin[S]) + in.get(tin[T]) - 2 * in.get(tin[LCA(S, T)]);
        if (value > Y) {
          lqueries.push_back({i, S, T, X, Y});
        } else {
          rqueries.push_back({i, S, T, X, Y});
        }
      }
      vector<query>().swap(queries);
      self(self, mid, r, rqueries);
      vector<query>().swap(rqueries);
      for (int i = l; i < mid; i++) {
        in.add(tin[points[i].P], tout[points[i].P], -points[i].C);
        out.add(tin[points[i].P], tout[points[i].P], +1);
      }
      self(self, l, mid, lqueries);
      vector<query>().swap(lqueries);
    }
  };
  Solve(Solve, 0, m + 1, Queries);
  for (int i = 0; i < q; i++) {
    cout << max(-1, ans[i]) << "\n";
  }
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 7 ms 948 KB Output is correct
6 Correct 7 ms 980 KB Output is correct
7 Correct 6 ms 852 KB Output is correct
8 Correct 8 ms 980 KB Output is correct
9 Correct 8 ms 1056 KB Output is correct
10 Correct 8 ms 980 KB Output is correct
11 Correct 11 ms 980 KB Output is correct
12 Correct 10 ms 1012 KB Output is correct
13 Correct 8 ms 1236 KB Output is correct
14 Correct 8 ms 1108 KB Output is correct
15 Correct 8 ms 1108 KB Output is correct
16 Correct 8 ms 980 KB Output is correct
17 Correct 8 ms 1080 KB Output is correct
18 Correct 8 ms 1108 KB Output is correct
19 Correct 7 ms 980 KB Output is correct
20 Correct 7 ms 1076 KB Output is correct
21 Correct 7 ms 1084 KB Output is correct
22 Correct 8 ms 980 KB Output is correct
23 Correct 8 ms 1080 KB Output is correct
24 Correct 7 ms 948 KB Output is correct
25 Correct 9 ms 1004 KB Output is correct
26 Correct 7 ms 1072 KB Output is correct
27 Correct 7 ms 1108 KB Output is correct
28 Correct 7 ms 980 KB Output is correct
29 Correct 8 ms 1224 KB Output is correct
30 Correct 8 ms 980 KB Output is correct
31 Correct 8 ms 980 KB Output is correct
32 Correct 8 ms 980 KB Output is correct
33 Correct 7 ms 1216 KB Output is correct
34 Correct 7 ms 1236 KB Output is correct
35 Correct 7 ms 1108 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 8 ms 992 KB Output is correct
3 Correct 8 ms 980 KB Output is correct
4 Correct 8 ms 1084 KB Output is correct
5 Correct 460 ms 36320 KB Output is correct
6 Correct 521 ms 29576 KB Output is correct
7 Correct 491 ms 33544 KB Output is correct
8 Correct 396 ms 31816 KB Output is correct
9 Correct 406 ms 31708 KB Output is correct
10 Correct 625 ms 38844 KB Output is correct
11 Correct 595 ms 38844 KB Output is correct
12 Correct 615 ms 38812 KB Output is correct
13 Correct 671 ms 38716 KB Output is correct
14 Correct 615 ms 38916 KB Output is correct
15 Correct 635 ms 46292 KB Output is correct
16 Correct 576 ms 46908 KB Output is correct
17 Correct 607 ms 45884 KB Output is correct
18 Correct 674 ms 38960 KB Output is correct
19 Correct 649 ms 38652 KB Output is correct
20 Correct 605 ms 38764 KB Output is correct
21 Correct 611 ms 38688 KB Output is correct
22 Correct 591 ms 38760 KB Output is correct
23 Correct 564 ms 38744 KB Output is correct
24 Correct 574 ms 38812 KB Output is correct
25 Correct 567 ms 38980 KB Output is correct
26 Correct 541 ms 39016 KB Output is correct
27 Correct 533 ms 39236 KB Output is correct
28 Correct 456 ms 38968 KB Output is correct
29 Correct 454 ms 39612 KB Output is correct
30 Correct 486 ms 39016 KB Output is correct
31 Correct 479 ms 40772 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 9 ms 1124 KB Output is correct
3 Correct 8 ms 1232 KB Output is correct
4 Correct 7 ms 1108 KB Output is correct
5 Correct 368 ms 41740 KB Output is correct
6 Correct 349 ms 40584 KB Output is correct
7 Correct 452 ms 30196 KB Output is correct
8 Correct 540 ms 47084 KB Output is correct
9 Correct 593 ms 47112 KB Output is correct
10 Correct 554 ms 47500 KB Output is correct
11 Correct 510 ms 47036 KB Output is correct
12 Correct 544 ms 47552 KB Output is correct
13 Correct 522 ms 47216 KB Output is correct
14 Correct 412 ms 47048 KB Output is correct
15 Correct 435 ms 46828 KB Output is correct
16 Correct 449 ms 46616 KB Output is correct
17 Correct 439 ms 47804 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 7 ms 948 KB Output is correct
6 Correct 7 ms 980 KB Output is correct
7 Correct 6 ms 852 KB Output is correct
8 Correct 8 ms 980 KB Output is correct
9 Correct 8 ms 1056 KB Output is correct
10 Correct 8 ms 980 KB Output is correct
11 Correct 11 ms 980 KB Output is correct
12 Correct 10 ms 1012 KB Output is correct
13 Correct 8 ms 1236 KB Output is correct
14 Correct 8 ms 1108 KB Output is correct
15 Correct 8 ms 1108 KB Output is correct
16 Correct 8 ms 980 KB Output is correct
17 Correct 8 ms 1080 KB Output is correct
18 Correct 8 ms 1108 KB Output is correct
19 Correct 7 ms 980 KB Output is correct
20 Correct 7 ms 1076 KB Output is correct
21 Correct 7 ms 1084 KB Output is correct
22 Correct 8 ms 980 KB Output is correct
23 Correct 8 ms 1080 KB Output is correct
24 Correct 7 ms 948 KB Output is correct
25 Correct 9 ms 1004 KB Output is correct
26 Correct 7 ms 1072 KB Output is correct
27 Correct 7 ms 1108 KB Output is correct
28 Correct 7 ms 980 KB Output is correct
29 Correct 8 ms 1224 KB Output is correct
30 Correct 8 ms 980 KB Output is correct
31 Correct 8 ms 980 KB Output is correct
32 Correct 8 ms 980 KB Output is correct
33 Correct 7 ms 1216 KB Output is correct
34 Correct 7 ms 1236 KB Output is correct
35 Correct 7 ms 1108 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 8 ms 992 KB Output is correct
38 Correct 8 ms 980 KB Output is correct
39 Correct 8 ms 1084 KB Output is correct
40 Correct 460 ms 36320 KB Output is correct
41 Correct 521 ms 29576 KB Output is correct
42 Correct 491 ms 33544 KB Output is correct
43 Correct 396 ms 31816 KB Output is correct
44 Correct 406 ms 31708 KB Output is correct
45 Correct 625 ms 38844 KB Output is correct
46 Correct 595 ms 38844 KB Output is correct
47 Correct 615 ms 38812 KB Output is correct
48 Correct 671 ms 38716 KB Output is correct
49 Correct 615 ms 38916 KB Output is correct
50 Correct 635 ms 46292 KB Output is correct
51 Correct 576 ms 46908 KB Output is correct
52 Correct 607 ms 45884 KB Output is correct
53 Correct 674 ms 38960 KB Output is correct
54 Correct 649 ms 38652 KB Output is correct
55 Correct 605 ms 38764 KB Output is correct
56 Correct 611 ms 38688 KB Output is correct
57 Correct 591 ms 38760 KB Output is correct
58 Correct 564 ms 38744 KB Output is correct
59 Correct 574 ms 38812 KB Output is correct
60 Correct 567 ms 38980 KB Output is correct
61 Correct 541 ms 39016 KB Output is correct
62 Correct 533 ms 39236 KB Output is correct
63 Correct 456 ms 38968 KB Output is correct
64 Correct 454 ms 39612 KB Output is correct
65 Correct 486 ms 39016 KB Output is correct
66 Correct 479 ms 40772 KB Output is correct
67 Correct 1 ms 212 KB Output is correct
68 Correct 9 ms 1124 KB Output is correct
69 Correct 8 ms 1232 KB Output is correct
70 Correct 7 ms 1108 KB Output is correct
71 Correct 368 ms 41740 KB Output is correct
72 Correct 349 ms 40584 KB Output is correct
73 Correct 452 ms 30196 KB Output is correct
74 Correct 540 ms 47084 KB Output is correct
75 Correct 593 ms 47112 KB Output is correct
76 Correct 554 ms 47500 KB Output is correct
77 Correct 510 ms 47036 KB Output is correct
78 Correct 544 ms 47552 KB Output is correct
79 Correct 522 ms 47216 KB Output is correct
80 Correct 412 ms 47048 KB Output is correct
81 Correct 435 ms 46828 KB Output is correct
82 Correct 449 ms 46616 KB Output is correct
83 Correct 439 ms 47804 KB Output is correct
84 Correct 480 ms 31084 KB Output is correct
85 Correct 446 ms 23868 KB Output is correct
86 Correct 385 ms 23980 KB Output is correct
87 Correct 599 ms 38716 KB Output is correct
88 Correct 594 ms 38884 KB Output is correct
89 Correct 629 ms 38888 KB Output is correct
90 Correct 600 ms 38716 KB Output is correct
91 Correct 669 ms 38732 KB Output is correct
92 Correct 570 ms 43964 KB Output is correct
93 Correct 567 ms 45600 KB Output is correct
94 Correct 625 ms 38688 KB Output is correct
95 Correct 612 ms 38716 KB Output is correct
96 Correct 617 ms 38568 KB Output is correct
97 Correct 606 ms 38520 KB Output is correct
98 Correct 582 ms 38856 KB Output is correct
99 Correct 598 ms 39104 KB Output is correct
100 Correct 585 ms 38724 KB Output is correct
101 Correct 598 ms 39212 KB Output is correct
102 Correct 557 ms 39104 KB Output is correct
103 Correct 549 ms 39100 KB Output is correct
104 Correct 597 ms 38972 KB Output is correct
105 Correct 490 ms 39756 KB Output is correct
106 Correct 457 ms 38716 KB Output is correct
107 Correct 470 ms 38836 KB Output is correct
108 Correct 469 ms 39612 KB Output is correct