oj.uz

Submission #777625

# Submission time Handle Problem Language Result Execution time Memory
777625 2023-07-09T11:31:32 Z tch1cherin Two Currencies (JOI23_currencies) C++17
100 / 100
 570 ms 42136 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 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 6 ms 852 KB Output is correct
6 Correct 5 ms 980 KB Output is correct
7 Correct 5 ms 724 KB Output is correct
8 Correct 7 ms 980 KB Output is correct
9 Correct 6 ms 980 KB Output is correct
10 Correct 6 ms 980 KB Output is correct
11 Correct 6 ms 980 KB Output is correct
12 Correct 6 ms 980 KB Output is correct
13 Correct 5 ms 1108 KB Output is correct
14 Correct 5 ms 1108 KB Output is correct
15 Correct 6 ms 980 KB Output is correct
16 Correct 6 ms 980 KB Output is correct
17 Correct 6 ms 980 KB Output is correct
18 Correct 7 ms 980 KB Output is correct
19 Correct 6 ms 996 KB Output is correct
20 Correct 5 ms 980 KB Output is correct
21 Correct 5 ms 1008 KB Output is correct
22 Correct 6 ms 980 KB Output is correct
23 Correct 5 ms 980 KB Output is correct
24 Correct 5 ms 980 KB Output is correct
25 Correct 5 ms 980 KB Output is correct
26 Correct 5 ms 980 KB Output is correct
27 Correct 4 ms 980 KB Output is correct
28 Correct 5 ms 980 KB Output is correct
29 Correct 4 ms 980 KB Output is correct
30 Correct 6 ms 980 KB Output is correct
31 Correct 6 ms 1004 KB Output is correct
32 Correct 6 ms 980 KB Output is correct
33 Correct 5 ms 1068 KB Output is correct
34 Correct 5 ms 1156 KB Output is correct
35 Correct 5 ms 1108 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 6 ms 980 KB Output is correct
3 Correct 6 ms 980 KB Output is correct
4 Correct 6 ms 980 KB Output is correct
5 Correct 357 ms 31880 KB Output is correct
6 Correct 428 ms 24712 KB Output is correct
7 Correct 387 ms 28884 KB Output is correct
8 Correct 304 ms 27844 KB Output is correct
9 Correct 319 ms 27820 KB Output is correct
10 Correct 529 ms 33720 KB Output is correct
11 Correct 491 ms 33724 KB Output is correct
12 Correct 469 ms 33592 KB Output is correct
13 Correct 538 ms 33496 KB Output is correct
14 Correct 482 ms 33724 KB Output is correct
15 Correct 529 ms 40540 KB Output is correct
16 Correct 447 ms 41208 KB Output is correct
17 Correct 501 ms 40260 KB Output is correct
18 Correct 514 ms 33468 KB Output is correct
19 Correct 545 ms 33204 KB Output is correct
20 Correct 556 ms 33316 KB Output is correct
21 Correct 497 ms 34076 KB Output is correct
22 Correct 525 ms 34068 KB Output is correct
23 Correct 495 ms 34036 KB Output is correct
24 Correct 533 ms 34004 KB Output is correct
25 Correct 428 ms 33584 KB Output is correct
26 Correct 422 ms 33660 KB Output is correct
27 Correct 406 ms 33772 KB Output is correct
28 Correct 365 ms 33920 KB Output is correct
29 Correct 342 ms 34564 KB Output is correct
30 Correct 374 ms 33800 KB Output is correct
31 Correct 406 ms 35468 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 5 ms 1108 KB Output is correct
3 Correct 5 ms 1108 KB Output is correct
4 Correct 5 ms 1108 KB Output is correct
5 Correct 301 ms 37580 KB Output is correct
6 Correct 267 ms 36440 KB Output is correct
7 Correct 363 ms 25216 KB Output is correct
8 Correct 428 ms 41328 KB Output is correct
9 Correct 432 ms 41404 KB Output is correct
10 Correct 437 ms 41788 KB Output is correct
11 Correct 380 ms 41372 KB Output is correct
12 Correct 384 ms 41788 KB Output is correct
13 Correct 399 ms 41284 KB Output is correct
14 Correct 295 ms 41372 KB Output is correct
15 Correct 284 ms 41204 KB Output is correct
16 Correct 365 ms 40928 KB Output is correct
17 Correct 305 ms 42136 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 6 ms 852 KB Output is correct
6 Correct 5 ms 980 KB Output is correct
7 Correct 5 ms 724 KB Output is correct
8 Correct 7 ms 980 KB Output is correct
9 Correct 6 ms 980 KB Output is correct
10 Correct 6 ms 980 KB Output is correct
11 Correct 6 ms 980 KB Output is correct
12 Correct 6 ms 980 KB Output is correct
13 Correct 5 ms 1108 KB Output is correct
14 Correct 5 ms 1108 KB Output is correct
15 Correct 6 ms 980 KB Output is correct
16 Correct 6 ms 980 KB Output is correct
17 Correct 6 ms 980 KB Output is correct
18 Correct 7 ms 980 KB Output is correct
19 Correct 6 ms 996 KB Output is correct
20 Correct 5 ms 980 KB Output is correct
21 Correct 5 ms 1008 KB Output is correct
22 Correct 6 ms 980 KB Output is correct
23 Correct 5 ms 980 KB Output is correct
24 Correct 5 ms 980 KB Output is correct
25 Correct 5 ms 980 KB Output is correct
26 Correct 5 ms 980 KB Output is correct
27 Correct 4 ms 980 KB Output is correct
28 Correct 5 ms 980 KB Output is correct
29 Correct 4 ms 980 KB Output is correct
30 Correct 6 ms 980 KB Output is correct
31 Correct 6 ms 1004 KB Output is correct
32 Correct 6 ms 980 KB Output is correct
33 Correct 5 ms 1068 KB Output is correct
34 Correct 5 ms 1156 KB Output is correct
35 Correct 5 ms 1108 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 6 ms 980 KB Output is correct
38 Correct 6 ms 980 KB Output is correct
39 Correct 6 ms 980 KB Output is correct
40 Correct 357 ms 31880 KB Output is correct
41 Correct 428 ms 24712 KB Output is correct
42 Correct 387 ms 28884 KB Output is correct
43 Correct 304 ms 27844 KB Output is correct
44 Correct 319 ms 27820 KB Output is correct
45 Correct 529 ms 33720 KB Output is correct
46 Correct 491 ms 33724 KB Output is correct
47 Correct 469 ms 33592 KB Output is correct
48 Correct 538 ms 33496 KB Output is correct
49 Correct 482 ms 33724 KB Output is correct
50 Correct 529 ms 40540 KB Output is correct
51 Correct 447 ms 41208 KB Output is correct
52 Correct 501 ms 40260 KB Output is correct
53 Correct 514 ms 33468 KB Output is correct
54 Correct 545 ms 33204 KB Output is correct
55 Correct 556 ms 33316 KB Output is correct
56 Correct 497 ms 34076 KB Output is correct
57 Correct 525 ms 34068 KB Output is correct
58 Correct 495 ms 34036 KB Output is correct
59 Correct 533 ms 34004 KB Output is correct
60 Correct 428 ms 33584 KB Output is correct
61 Correct 422 ms 33660 KB Output is correct
62 Correct 406 ms 33772 KB Output is correct
63 Correct 365 ms 33920 KB Output is correct
64 Correct 342 ms 34564 KB Output is correct
65 Correct 374 ms 33800 KB Output is correct
66 Correct 406 ms 35468 KB Output is correct
67 Correct 1 ms 212 KB Output is correct
68 Correct 5 ms 1108 KB Output is correct
69 Correct 5 ms 1108 KB Output is correct
70 Correct 5 ms 1108 KB Output is correct
71 Correct 301 ms 37580 KB Output is correct
72 Correct 267 ms 36440 KB Output is correct
73 Correct 363 ms 25216 KB Output is correct
74 Correct 428 ms 41328 KB Output is correct
75 Correct 432 ms 41404 KB Output is correct
76 Correct 437 ms 41788 KB Output is correct
77 Correct 380 ms 41372 KB Output is correct
78 Correct 384 ms 41788 KB Output is correct
79 Correct 399 ms 41284 KB Output is correct
80 Correct 295 ms 41372 KB Output is correct
81 Correct 284 ms 41204 KB Output is correct
82 Correct 365 ms 40928 KB Output is correct
83 Correct 305 ms 42136 KB Output is correct
84 Correct 388 ms 26840 KB Output is correct
85 Correct 357 ms 19716 KB Output is correct
86 Correct 315 ms 19988 KB Output is correct
87 Correct 491 ms 33640 KB Output is correct
88 Correct 491 ms 33716 KB Output is correct
89 Correct 450 ms 33764 KB Output is correct
90 Correct 496 ms 33712 KB Output is correct
91 Correct 491 ms 33584 KB Output is correct
92 Correct 468 ms 38248 KB Output is correct
93 Correct 449 ms 39876 KB Output is correct
94 Correct 570 ms 33100 KB Output is correct
95 Correct 487 ms 33208 KB Output is correct
96 Correct 504 ms 33172 KB Output is correct
97 Correct 484 ms 33072 KB Output is correct
98 Correct 499 ms 34044 KB Output is correct
99 Correct 511 ms 34536 KB Output is correct
100 Correct 461 ms 34116 KB Output is correct
101 Correct 471 ms 34404 KB Output is correct
102 Correct 428 ms 33664 KB Output is correct
103 Correct 463 ms 33768 KB Output is correct
104 Correct 431 ms 33596 KB Output is correct
105 Correct 414 ms 34548 KB Output is correct
106 Correct 410 ms 33636 KB Output is correct
107 Correct 416 ms 33668 KB Output is correct
108 Correct 384 ms 34728 KB Output is correct