oj.uz

Submission #729015

# Submission time Handle Problem Language Result Execution time Memory
729015 2023-04-23T11:52:46 Z MilosMilutinovic Two Currencies (JOI23_currencies) C++14
100 / 100
 4624 ms 93864 KB 
/**
 *    author:  wxhtzdy
 *    created: 19.03.2023 07:01:27
**/
#include <bits/stdc++.h>

using namespace std;

const int N = 100010;
const int L = 18;
const int M = N * 32;
const int inf = (int) 1e9 + 1;

int rt[N], cs[N], tsz, ls[M], rs[M], cnt[M];
long long sum[M];
vector<int> g[N];
int pr[N][L];
int x[N], y[N], dep[N];

void Modify(int& v, int p, int l, int r, int x, int d) {
  v = ++tsz;
  ls[v] = ls[p];
  rs[v] = rs[p];
  cnt[v] = cnt[p] + d;
  sum[v] = sum[p] + x * d;
  if (l == r) {
    return;
  }
  int mid = l + r >> 1;
  if (x <= mid) {
    Modify(ls[v], ls[p], l, mid, x, d);
  } else {
    Modify(rs[v], rs[p], mid + 1, r, x, d);
  }
}

int GetCnt(int v, int l, int r, int ql, int qr) {
  if (!v || l > r || ql > qr || l > qr || r < ql) {
    return 0;
  }
  if (ql <= l && r <= qr) {
    return cnt[v];
  }
  int mid = l + r >> 1;
  return GetCnt(ls[v], l, mid, ql, qr) + GetCnt(rs[v], mid + 1, r, ql, qr);
}

long long GetSum(int v, int l, int r, int ql, int qr) {
  if (!v || l > r || ql > qr || l > qr || r < ql) {
    return 0LL;
  }
  if (ql <= l && r <= qr) {
    return sum[v];
  }
  int mid = l + r >> 1;
  return GetSum(ls[v], l, mid, ql, qr) + GetSum(rs[v], mid + 1, r, ql, qr);
}

int FindFirst(int v0, int v1, int v2, int l, int r, int x) {
  if (l == r) {
    return l;
  }
  int mid = l + r >> 1;
  int L = cnt[ls[v0]] + cnt[ls[v1]] - 2 * cnt[ls[v2]];
  if (L >= x) {
    return FindFirst(ls[v0], ls[v1], ls[v2], l, mid, x);
  } else {
    return FindFirst(rs[v0], rs[v1], rs[v2], mid + 1, r, x - L);
  }
}

void Go(int v, int pv) {
  for (int u : g[v]) {
    if (u == pv) {
      continue;
    }
    dep[u] = dep[v] + 1;
    Go(u, v);
  }
}

vector<int> qs[N];

void Dfs(int v, int pv) {
  pr[v][0] = pv;
  for (int j = 1; j < L; j++) {
    pr[v][j] = pr[pr[v][j - 1]][j - 1];  
  }
  for (int c : qs[v]) {
    Modify(rt[v], rt[v], 1, inf, c, +1);
    cs[v] += 1;  
  }
  for (int u : g[v]) {
    if (u == pv) {
      continue;
    }
    rt[u] = rt[v];
    cs[u] = cs[v];
    Dfs(u, v);
  }
}

int LCA(int x, int y) {
  if (dep[x] > dep[y]) {
    swap(x, y);
  }
  for (int j = L - 1; j >= 0; j--) {
    if (dep[pr[y][j]] >= dep[x]) {
      y = pr[y][j];
    }
  }
  for (int j = L - 1; j >= 0; j--) {
    if (pr[x][j] != pr[y][j]) {
      x = pr[x][j];
      y = pr[y][j];
    }
  }
  return (x == y ? x : pr[x][0]);
}
  
long long  Get(int s, int t, int w, int f) {
  int p = FindFirst(rt[s], rt[t], rt[w], 1, inf, f);
  int cc = GetCnt(rt[s], 1, inf, 1, p - 1) + GetCnt(rt[t], 1, inf, 1, p - 1)
         - 2 * GetCnt(rt[w], 1, inf, 1, p - 1);
  long long res = GetSum(rt[s], 1, inf, 1, p - 1) + GetSum(rt[t], 1, inf, 1, p - 1)
                - 2 * GetSum(rt[w], 1, inf, 1, p - 1);
  res += p * 1LL * (f - cc);
  return res;      
}
      

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);  
  int n, m, q;
  cin >> n >> m >> q;
  for (int i = 1; i < n; i++) {
    cin >> x[i] >> y[i];
    --x[i]; --y[i];
    g[x[i]].push_back(y[i]);
    g[y[i]].push_back(x[i]);
  }
  Go(0, 0);
  for (int i = 1; i < n; i++) {
    if (dep[x[i]] > dep[y[i]]) {
      swap(x[i], y[i]);
    }
  }
  for (int i = 0; i < m; i++) {
    int p, c;
    cin >> p >> c;
    qs[y[p]].push_back(c);
  }
  Dfs(0, 0);
  while (q--) {
    int s, t, a;
    long long b;
    cin >> s >> t >> a >> b;
    --s; --t;
    int w = LCA(s, t);
    int f = cs[s] + cs[t] - 2 * cs[w];
    int low = 0, high = a, ans = -1;
    while (low <= high) {
      int mid = low + high >> 1;
      if (Get(s, t, w, max(0, f - (a - mid))) <= b) {
        ans = mid;
        low = mid + 1;  
      } else {
        high = mid - 1;
      }
    }  
    cout << ans << '\n';
  }                                        
  return 0;
}

Compilation message

currencies.cpp: In function 'void Modify(int&, int, int, int, int, int)':
currencies.cpp:29:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   29 |   int mid = l + r >> 1;
      |             ~~^~~
currencies.cpp: In function 'int GetCnt(int, int, int, int, int)':
currencies.cpp:44:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   44 |   int mid = l + r >> 1;
      |             ~~^~~
currencies.cpp: In function 'long long int GetSum(int, int, int, int, int)':
currencies.cpp:55:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   55 |   int mid = l + r >> 1;
      |             ~~^~~
currencies.cpp: In function 'int FindFirst(int, int, int, int, int, int)':
currencies.cpp:63:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   63 |   int mid = l + r >> 1;
      |             ~~^~~
currencies.cpp: In function 'int main()':
currencies.cpp:164:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  164 |       int mid = low + high >> 1;
      |                 ~~~~^~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5076 KB Output is correct
2 Correct 3 ms 5076 KB Output is correct
3 Correct 3 ms 5076 KB Output is correct
4 Correct 3 ms 5076 KB Output is correct
5 Correct 11 ms 6508 KB Output is correct
6 Correct 15 ms 6548 KB Output is correct
7 Correct 14 ms 6128 KB Output is correct
8 Correct 13 ms 6656 KB Output is correct
9 Correct 13 ms 6612 KB Output is correct
10 Correct 14 ms 6644 KB Output is correct
11 Correct 13 ms 6612 KB Output is correct
12 Correct 17 ms 6636 KB Output is correct
13 Correct 29 ms 6792 KB Output is correct
14 Correct 31 ms 6744 KB Output is correct
15 Correct 26 ms 6672 KB Output is correct
16 Correct 25 ms 6708 KB Output is correct
17 Correct 24 ms 6612 KB Output is correct
18 Correct 29 ms 6700 KB Output is correct
19 Correct 9 ms 6632 KB Output is correct
20 Correct 9 ms 6636 KB Output is correct
21 Correct 9 ms 6628 KB Output is correct
22 Correct 10 ms 6572 KB Output is correct
23 Correct 19 ms 6652 KB Output is correct
24 Correct 18 ms 6656 KB Output is correct
25 Correct 18 ms 6652 KB Output is correct
26 Correct 12 ms 6604 KB Output is correct
27 Correct 10 ms 6600 KB Output is correct
28 Correct 10 ms 6640 KB Output is correct
29 Correct 8 ms 6640 KB Output is correct
30 Correct 12 ms 6636 KB Output is correct
31 Correct 12 ms 6652 KB Output is correct
32 Correct 11 ms 6612 KB Output is correct
33 Correct 30 ms 6740 KB Output is correct
34 Correct 29 ms 6744 KB Output is correct
35 Correct 28 ms 6816 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5076 KB Output is correct
2 Correct 12 ms 6644 KB Output is correct
3 Correct 13 ms 6612 KB Output is correct
4 Correct 11 ms 6512 KB Output is correct
5 Correct 536 ms 78304 KB Output is correct
6 Correct 728 ms 70036 KB Output is correct
7 Correct 656 ms 61452 KB Output is correct
8 Correct 502 ms 59420 KB Output is correct
9 Correct 527 ms 62416 KB Output is correct
10 Correct 671 ms 85264 KB Output is correct
11 Correct 663 ms 85492 KB Output is correct
12 Correct 658 ms 85488 KB Output is correct
13 Correct 612 ms 85272 KB Output is correct
14 Correct 661 ms 85364 KB Output is correct
15 Correct 1671 ms 93248 KB Output is correct
16 Correct 1614 ms 91868 KB Output is correct
17 Correct 1510 ms 92952 KB Output is correct
18 Correct 1171 ms 85924 KB Output is correct
19 Correct 1172 ms 85884 KB Output is correct
20 Correct 1201 ms 85820 KB Output is correct
21 Correct 392 ms 84980 KB Output is correct
22 Correct 367 ms 85080 KB Output is correct
23 Correct 321 ms 85156 KB Output is correct
24 Correct 315 ms 85060 KB Output is correct
25 Correct 1080 ms 85300 KB Output is correct
26 Correct 1111 ms 85324 KB Output is correct
27 Correct 1059 ms 83260 KB Output is correct
28 Correct 593 ms 85088 KB Output is correct
29 Correct 468 ms 85220 KB Output is correct
30 Correct 622 ms 85424 KB Output is correct
31 Correct 579 ms 85428 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5076 KB Output is correct
2 Correct 30 ms 6880 KB Output is correct
3 Correct 31 ms 6740 KB Output is correct
4 Correct 30 ms 6764 KB Output is correct
5 Correct 2471 ms 69508 KB Output is correct
6 Correct 2441 ms 60580 KB Output is correct
7 Correct 3711 ms 78836 KB Output is correct
8 Correct 4331 ms 93712 KB Output is correct
9 Correct 4624 ms 93724 KB Output is correct
10 Correct 4285 ms 93632 KB Output is correct
11 Correct 3856 ms 93332 KB Output is correct
12 Correct 3921 ms 93420 KB Output is correct
13 Correct 3911 ms 93552 KB Output is correct
14 Correct 2693 ms 93644 KB Output is correct
15 Correct 2596 ms 93744 KB Output is correct
16 Correct 3271 ms 93864 KB Output is correct
17 Correct 3016 ms 93748 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5076 KB Output is correct
2 Correct 3 ms 5076 KB Output is correct
3 Correct 3 ms 5076 KB Output is correct
4 Correct 3 ms 5076 KB Output is correct
5 Correct 11 ms 6508 KB Output is correct
6 Correct 15 ms 6548 KB Output is correct
7 Correct 14 ms 6128 KB Output is correct
8 Correct 13 ms 6656 KB Output is correct
9 Correct 13 ms 6612 KB Output is correct
10 Correct 14 ms 6644 KB Output is correct
11 Correct 13 ms 6612 KB Output is correct
12 Correct 17 ms 6636 KB Output is correct
13 Correct 29 ms 6792 KB Output is correct
14 Correct 31 ms 6744 KB Output is correct
15 Correct 26 ms 6672 KB Output is correct
16 Correct 25 ms 6708 KB Output is correct
17 Correct 24 ms 6612 KB Output is correct
18 Correct 29 ms 6700 KB Output is correct
19 Correct 9 ms 6632 KB Output is correct
20 Correct 9 ms 6636 KB Output is correct
21 Correct 9 ms 6628 KB Output is correct
22 Correct 10 ms 6572 KB Output is correct
23 Correct 19 ms 6652 KB Output is correct
24 Correct 18 ms 6656 KB Output is correct
25 Correct 18 ms 6652 KB Output is correct
26 Correct 12 ms 6604 KB Output is correct
27 Correct 10 ms 6600 KB Output is correct
28 Correct 10 ms 6640 KB Output is correct
29 Correct 8 ms 6640 KB Output is correct
30 Correct 12 ms 6636 KB Output is correct
31 Correct 12 ms 6652 KB Output is correct
32 Correct 11 ms 6612 KB Output is correct
33 Correct 30 ms 6740 KB Output is correct
34 Correct 29 ms 6744 KB Output is correct
35 Correct 28 ms 6816 KB Output is correct
36 Correct 3 ms 5076 KB Output is correct
37 Correct 12 ms 6644 KB Output is correct
38 Correct 13 ms 6612 KB Output is correct
39 Correct 11 ms 6512 KB Output is correct
40 Correct 536 ms 78304 KB Output is correct
41 Correct 728 ms 70036 KB Output is correct
42 Correct 656 ms 61452 KB Output is correct
43 Correct 502 ms 59420 KB Output is correct
44 Correct 527 ms 62416 KB Output is correct
45 Correct 671 ms 85264 KB Output is correct
46 Correct 663 ms 85492 KB Output is correct
47 Correct 658 ms 85488 KB Output is correct
48 Correct 612 ms 85272 KB Output is correct
49 Correct 661 ms 85364 KB Output is correct
50 Correct 1671 ms 93248 KB Output is correct
51 Correct 1614 ms 91868 KB Output is correct
52 Correct 1510 ms 92952 KB Output is correct
53 Correct 1171 ms 85924 KB Output is correct
54 Correct 1172 ms 85884 KB Output is correct
55 Correct 1201 ms 85820 KB Output is correct
56 Correct 392 ms 84980 KB Output is correct
57 Correct 367 ms 85080 KB Output is correct
58 Correct 321 ms 85156 KB Output is correct
59 Correct 315 ms 85060 KB Output is correct
60 Correct 1080 ms 85300 KB Output is correct
61 Correct 1111 ms 85324 KB Output is correct
62 Correct 1059 ms 83260 KB Output is correct
63 Correct 593 ms 85088 KB Output is correct
64 Correct 468 ms 85220 KB Output is correct
65 Correct 622 ms 85424 KB Output is correct
66 Correct 579 ms 85428 KB Output is correct
67 Correct 2 ms 5076 KB Output is correct
68 Correct 30 ms 6880 KB Output is correct
69 Correct 31 ms 6740 KB Output is correct
70 Correct 30 ms 6764 KB Output is correct
71 Correct 2471 ms 69508 KB Output is correct
72 Correct 2441 ms 60580 KB Output is correct
73 Correct 3711 ms 78836 KB Output is correct
74 Correct 4331 ms 93712 KB Output is correct
75 Correct 4624 ms 93724 KB Output is correct
76 Correct 4285 ms 93632 KB Output is correct
77 Correct 3856 ms 93332 KB Output is correct
78 Correct 3921 ms 93420 KB Output is correct
79 Correct 3911 ms 93552 KB Output is correct
80 Correct 2693 ms 93644 KB Output is correct
81 Correct 2596 ms 93744 KB Output is correct
82 Correct 3271 ms 93864 KB Output is correct
83 Correct 3016 ms 93748 KB Output is correct
84 Correct 658 ms 77996 KB Output is correct
85 Correct 804 ms 68744 KB Output is correct
86 Correct 697 ms 52172 KB Output is correct
87 Correct 803 ms 85076 KB Output is correct
88 Correct 813 ms 84560 KB Output is correct
89 Correct 866 ms 85252 KB Output is correct
90 Correct 785 ms 85280 KB Output is correct
91 Correct 795 ms 85192 KB Output is correct
92 Correct 4156 ms 90864 KB Output is correct
93 Correct 4317 ms 92512 KB Output is correct
94 Correct 2077 ms 85964 KB Output is correct
95 Correct 2185 ms 85672 KB Output is correct
96 Correct 2206 ms 85596 KB Output is correct
97 Correct 2238 ms 85732 KB Output is correct
98 Correct 381 ms 84972 KB Output is correct
99 Correct 410 ms 84804 KB Output is correct
100 Correct 423 ms 84792 KB Output is correct
101 Correct 423 ms 84936 KB Output is correct
102 Correct 1945 ms 85176 KB Output is correct
103 Correct 1980 ms 84996 KB Output is correct
104 Correct 1962 ms 85008 KB Output is correct
105 Correct 681 ms 85260 KB Output is correct
106 Correct 588 ms 84828 KB Output is correct
107 Correct 587 ms 84996 KB Output is correct
108 Correct 617 ms 85048 KB Output is correct